./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 6c24879c 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.2-?-6c24879 [2022-07-12 12:25:49,141 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 12:25:49,163 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 12:25:49,201 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 12:25:49,202 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 12:25:49,203 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 12:25:49,206 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 12:25:49,209 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 12:25:49,210 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 12:25:49,214 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 12:25:49,215 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 12:25:49,216 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 12:25:49,217 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 12:25:49,217 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 12:25:49,218 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 12:25:49,219 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 12:25:49,220 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 12:25:49,221 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 12:25:49,224 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 12:25:49,230 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 12:25:49,232 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 12:25:49,232 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 12:25:49,233 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 12:25:49,234 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 12:25:49,235 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 12:25:49,242 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 12:25:49,242 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 12:25:49,242 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 12:25:49,243 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 12:25:49,244 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 12:25:49,245 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 12:25:49,245 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 12:25:49,246 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 12:25:49,247 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 12:25:49,247 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 12:25:49,248 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 12:25:49,248 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 12:25:49,249 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 12:25:49,249 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 12:25:49,250 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 12:25:49,251 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 12:25:49,252 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 12:25:49,253 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 12:25:49,281 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 12:25:49,281 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 12:25:49,281 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 12:25:49,282 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 12:25:49,282 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 12:25:49,282 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 12:25:49,283 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 12:25:49,283 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 12:25:49,283 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 12:25:49,284 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 12:25:49,284 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 12:25:49,284 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 12:25:49,285 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 12:25:49,285 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 12:25:49,285 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 12:25:49,285 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 12:25:49,285 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 12:25:49,286 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 12:25:49,286 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 12:25:49,287 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 12:25:49,287 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 12:25:49,287 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 12:25:49,288 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 12:25:49,288 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 12:25:49,288 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 12:25:49,288 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 12:25:49,288 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 12:25:49,289 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 12:25:49,289 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 12:25:49,289 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 12:25:49,289 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 [2022-07-12 12:25:49,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 12:25:49,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 12:25:49,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 12:25:49,537 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 12:25:49,537 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 12:25:49,538 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 [2022-07-12 12:25:49,597 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9689af4e/54ed44b9c77a449e9e811340b7927547/FLAGe4d8c5490 [2022-07-12 12:25:50,286 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 12:25:50,287 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 [2022-07-12 12:25:50,329 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9689af4e/54ed44b9c77a449e9e811340b7927547/FLAGe4d8c5490 [2022-07-12 12:25:50,436 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9689af4e/54ed44b9c77a449e9e811340b7927547 [2022-07-12 12:25:50,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 12:25:50,441 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 12:25:50,444 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 12:25:50,444 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 12:25:50,446 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 12:25:50,447 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 12:25:50" (1/1) ... [2022-07-12 12:25:50,448 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e7df2c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:25:50, skipping insertion in model container [2022-07-12 12:25:50,448 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 12:25:50" (1/1) ... [2022-07-12 12:25:50,454 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 12:25:50,551 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 12:25:51,115 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] [2022-07-12 12:25:51,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 12:25:51,484 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 12:25:51,594 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] [2022-07-12 12:25:51,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 12:25:51,760 INFO L208 MainTranslator]: Completed translation [2022-07-12 12:25:51,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:25:51 WrapperNode [2022-07-12 12:25:51,762 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 12:25:51,763 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 12:25:51,763 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 12:25:51,764 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 12:25:51,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:25:51" (1/1) ... [2022-07-12 12:25:51,828 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:25:51" (1/1) ... [2022-07-12 12:25:51,913 INFO L137 Inliner]: procedures = 139, calls = 575, calls flagged for inlining = 59, calls inlined = 59, statements flattened = 1725 [2022-07-12 12:25:51,914 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 12:25:51,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 12:25:51,915 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 12:25:51,915 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 12:25:51,929 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:25:51" (1/1) ... [2022-07-12 12:25:51,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:25:51" (1/1) ... [2022-07-12 12:25:51,951 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:25:51" (1/1) ... [2022-07-12 12:25:51,954 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:25:51" (1/1) ... [2022-07-12 12:25:52,024 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:25:51" (1/1) ... [2022-07-12 12:25:52,042 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:25:51" (1/1) ... [2022-07-12 12:25:52,054 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:25:51" (1/1) ... [2022-07-12 12:25:52,073 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 12:25:52,074 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 12:25:52,074 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 12:25:52,075 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 12:25:52,075 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:25:51" (1/1) ... [2022-07-12 12:25:52,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 12:25:52,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:25:52,104 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 12:25:52,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 12:25:52,146 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_resume [2022-07-12 12:25:52,146 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_resume [2022-07-12 12:25:52,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 12:25:52,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 12:25:52,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 12:25:52,147 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 12:25:52,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 12:25:52,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 12:25:52,147 INFO L130 BoogieDeclarations]: Found specification of procedure skb_headroom [2022-07-12 12:25:52,147 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_headroom [2022-07-12 12:25:52,147 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_disconnect [2022-07-12 12:25:52,147 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_disconnect [2022-07-12 12:25:52,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-12 12:25:52,148 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-12 12:25:52,148 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 12:25:52,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 12:25:52,148 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~pm_message_t~0~TO~int [2022-07-12 12:25:52,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~pm_message_t~0~TO~int [2022-07-12 12:25:52,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 12:25:52,149 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_suspend [2022-07-12 12:25:52,149 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_suspend [2022-07-12 12:25:52,149 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-12 12:25:52,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-12 12:25:52,149 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_resume [2022-07-12 12:25:52,149 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_resume [2022-07-12 12:25:52,149 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 12:25:52,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 12:25:52,150 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2022-07-12 12:25:52,150 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2022-07-12 12:25:52,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-12 12:25:52,150 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-12 12:25:52,150 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 12:25:52,150 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 12:25:52,150 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_tx_fixup [2022-07-12 12:25:52,151 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_tx_fixup [2022-07-12 12:25:52,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 12:25:52,151 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2022-07-12 12:25:52,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2022-07-12 12:25:52,151 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_4 [2022-07-12 12:25:52,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_4 [2022-07-12 12:25:52,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 12:25:52,152 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-12 12:25:52,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-12 12:25:52,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 12:25:52,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 12:25:52,153 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 12:25:52,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 12:25:52,153 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_bind [2022-07-12 12:25:52,153 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_bind [2022-07-12 12:25:52,153 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_manage_power [2022-07-12 12:25:52,153 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_manage_power [2022-07-12 12:25:52,153 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-12 12:25:52,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-12 12:25:52,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 12:25:52,154 INFO L130 BoogieDeclarations]: Found specification of procedure __xadd_wrong_size [2022-07-12 12:25:52,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 12:25:52,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 12:25:52,155 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-07-12 12:25:52,155 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-07-12 12:25:52,156 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_rx_fixup [2022-07-12 12:25:52,156 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_rx_fixup [2022-07-12 12:25:52,156 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-07-12 12:25:52,157 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-07-12 12:25:52,157 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_ncm_unbind [2022-07-12 12:25:52,157 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_ncm_unbind [2022-07-12 12:25:52,157 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_unbind [2022-07-12 12:25:52,157 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_unbind [2022-07-12 12:25:52,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 12:25:52,157 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reset_mac_header [2022-07-12 12:25:52,158 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reset_mac_header [2022-07-12 12:25:52,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-12 12:25:52,158 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-12 12:25:52,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-12 12:25:52,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 12:25:52,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 12:25:52,159 INFO L130 BoogieDeclarations]: Found specification of procedure eth_hdr [2022-07-12 12:25:52,159 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_hdr [2022-07-12 12:25:52,159 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-07-12 12:25:52,159 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-07-12 12:25:52,593 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 12:25:52,595 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 12:25:53,176 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 12:25:53,376 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2022-07-12 12:25:53,632 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 12:25:53,648 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 12:25:53,649 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 12:25:53,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:25:53 BoogieIcfgContainer [2022-07-12 12:25:53,652 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 12:25:53,655 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 12:25:53,655 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 12:25:53,658 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 12:25:53,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 12:25:50" (1/3) ... [2022-07-12 12:25:53,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b4bb2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 12:25:53, skipping insertion in model container [2022-07-12 12:25:53,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:25:51" (2/3) ... [2022-07-12 12:25:53,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b4bb2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 12:25:53, skipping insertion in model container [2022-07-12 12:25:53,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:25:53" (3/3) ... [2022-07-12 12:25:53,661 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--cdc_mbim.ko-entry_point.cil.out.i [2022-07-12 12:25:53,673 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 12:25:53,674 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 12:25:53,748 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 12:25:53,754 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@69b112f2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2d641390 [2022-07-12 12:25:53,754 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 12:25:53,759 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) [2022-07-12 12:25:53,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-12 12:25:53,770 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:25:53,770 INFO L195 NwaCegarLoop]: 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] [2022-07-12 12:25:53,771 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:25:53,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:25:53,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1589467643, now seen corresponding path program 1 times [2022-07-12 12:25:53,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:25:53,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506458396] [2022-07-12 12:25:53,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:25:53,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:25:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:54,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:25:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:54,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:25:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:54,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 12:25:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:54,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 12:25:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:54,202 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 12:25:54,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:25:54,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506458396] [2022-07-12 12:25:54,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506458396] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:25:54,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:25:54,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:25:54,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979394149] [2022-07-12 12:25:54,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:25:54,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:25:54,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:25:54,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:25:54,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:25:54,234 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) [2022-07-12 12:25:55,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:25:55,905 INFO L93 Difference]: Finished difference Result 1672 states and 2474 transitions. [2022-07-12 12:25:55,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:25:55,909 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 [2022-07-12 12:25:55,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:25:55,935 INFO L225 Difference]: With dead ends: 1672 [2022-07-12 12:25:55,936 INFO L226 Difference]: Without dead ends: 1132 [2022-07-12 12:25:55,946 INFO L412 NwaCegarLoop]: 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 [2022-07-12 12:25:55,950 INFO L413 NwaCegarLoop]: 753 mSDtfsCounter, 1145 mSDsluCounter, 1434 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 455 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1201 SdHoareTripleChecker+Valid, 2187 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 455 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-12 12:25:55,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1201 Valid, 2187 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [455 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-12 12:25:55,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2022-07-12 12:25:56,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 969. [2022-07-12 12:25:56,059 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) [2022-07-12 12:25:56,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1363 transitions. [2022-07-12 12:25:56,067 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1363 transitions. Word has length 40 [2022-07-12 12:25:56,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:25:56,068 INFO L495 AbstractCegarLoop]: Abstraction has 969 states and 1363 transitions. [2022-07-12 12:25:56,068 INFO L496 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) [2022-07-12 12:25:56,068 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1363 transitions. [2022-07-12 12:25:56,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-12 12:25:56,073 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:25:56,073 INFO L195 NwaCegarLoop]: 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] [2022-07-12 12:25:56,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 12:25:56,074 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:25:56,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:25:56,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1949626109, now seen corresponding path program 1 times [2022-07-12 12:25:56,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:25:56,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318511937] [2022-07-12 12:25:56,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:25:56,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:25:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:56,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:25:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:56,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:25:56,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:56,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 12:25:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:56,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 12:25:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:56,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 12:25:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:56,307 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-12 12:25:56,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:25:56,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318511937] [2022-07-12 12:25:56,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318511937] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:25:56,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:25:56,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:25:56,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840227751] [2022-07-12 12:25:56,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:25:56,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:25:56,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:25:56,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:25:56,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:25:56,312 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) [2022-07-12 12:25:57,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:25:57,293 INFO L93 Difference]: Finished difference Result 1131 states and 1631 transitions. [2022-07-12 12:25:57,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 12:25:57,294 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 [2022-07-12 12:25:57,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:25:57,303 INFO L225 Difference]: With dead ends: 1131 [2022-07-12 12:25:57,304 INFO L226 Difference]: Without dead ends: 1128 [2022-07-12 12:25:57,304 INFO L412 NwaCegarLoop]: 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 [2022-07-12 12:25:57,309 INFO L413 NwaCegarLoop]: 653 mSDtfsCounter, 948 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.9s IncrementalHoareTripleChecker+Time [2022-07-12 12:25:57,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1000 Valid, 1470 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 12:25:57,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2022-07-12 12:25:57,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 968. [2022-07-12 12:25:57,370 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) [2022-07-12 12:25:57,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1361 transitions. [2022-07-12 12:25:57,378 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1361 transitions. Word has length 50 [2022-07-12 12:25:57,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:25:57,379 INFO L495 AbstractCegarLoop]: Abstraction has 968 states and 1361 transitions. [2022-07-12 12:25:57,379 INFO L496 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) [2022-07-12 12:25:57,379 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1361 transitions. [2022-07-12 12:25:57,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-12 12:25:57,384 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:25:57,385 INFO L195 NwaCegarLoop]: 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] [2022-07-12 12:25:57,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 12:25:57,385 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:25:57,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:25:57,386 INFO L85 PathProgramCache]: Analyzing trace with hash 308647439, now seen corresponding path program 1 times [2022-07-12 12:25:57,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:25:57,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392092616] [2022-07-12 12:25:57,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:25:57,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:25:57,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:57,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:25:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:57,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:25:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:57,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 12:25:57,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:57,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 12:25:57,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:57,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 12:25:57,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:57,541 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-12 12:25:57,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:25:57,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392092616] [2022-07-12 12:25:57,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392092616] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:25:57,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:25:57,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:25:57,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545054909] [2022-07-12 12:25:57,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:25:57,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:25:57,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:25:57,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:25:57,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:25:57,544 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) [2022-07-12 12:25:58,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:25:58,496 INFO L93 Difference]: Finished difference Result 1130 states and 1629 transitions. [2022-07-12 12:25:58,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 12:25:58,497 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 [2022-07-12 12:25:58,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:25:58,503 INFO L225 Difference]: With dead ends: 1130 [2022-07-12 12:25:58,503 INFO L226 Difference]: Without dead ends: 1127 [2022-07-12 12:25:58,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 12:25:58,505 INFO L413 NwaCegarLoop]: 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.9s IncrementalHoareTripleChecker+Time [2022-07-12 12:25:58,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [997 Valid, 1466 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 12:25:58,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2022-07-12 12:25:58,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 967. [2022-07-12 12:25:58,552 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) [2022-07-12 12:25:58,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1359 transitions. [2022-07-12 12:25:58,565 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1359 transitions. Word has length 51 [2022-07-12 12:25:58,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:25:58,569 INFO L495 AbstractCegarLoop]: Abstraction has 967 states and 1359 transitions. [2022-07-12 12:25:58,569 INFO L496 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) [2022-07-12 12:25:58,570 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1359 transitions. [2022-07-12 12:25:58,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-12 12:25:58,573 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:25:58,573 INFO L195 NwaCegarLoop]: 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] [2022-07-12 12:25:58,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 12:25:58,574 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:25:58,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:25:58,575 INFO L85 PathProgramCache]: Analyzing trace with hash 977921088, now seen corresponding path program 1 times [2022-07-12 12:25:58,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:25:58,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197125571] [2022-07-12 12:25:58,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:25:58,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:25:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:58,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:25:58,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:58,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:25:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:58,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 12:25:58,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:58,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 12:25:58,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:58,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 12:25:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:58,706 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-12 12:25:58,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:25:58,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197125571] [2022-07-12 12:25:58,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197125571] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:25:58,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:25:58,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:25:58,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880730874] [2022-07-12 12:25:58,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:25:58,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:25:58,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:25:58,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:25:58,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:25:58,708 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) [2022-07-12 12:25:59,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:25:59,510 INFO L93 Difference]: Finished difference Result 1129 states and 1627 transitions. [2022-07-12 12:25:59,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 12:25:59,511 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 [2022-07-12 12:25:59,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:25:59,518 INFO L225 Difference]: With dead ends: 1129 [2022-07-12 12:25:59,518 INFO L226 Difference]: Without dead ends: 1126 [2022-07-12 12:25:59,521 INFO L412 NwaCegarLoop]: 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 [2022-07-12 12:25:59,523 INFO L413 NwaCegarLoop]: 649 mSDtfsCounter, 942 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2022-07-12 12:25:59,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [994 Valid, 1462 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 12:25:59,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2022-07-12 12:25:59,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 966. [2022-07-12 12:25:59,564 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) [2022-07-12 12:25:59,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1357 transitions. [2022-07-12 12:25:59,569 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1357 transitions. Word has length 52 [2022-07-12 12:25:59,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:25:59,570 INFO L495 AbstractCegarLoop]: Abstraction has 966 states and 1357 transitions. [2022-07-12 12:25:59,570 INFO L496 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) [2022-07-12 12:25:59,570 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1357 transitions. [2022-07-12 12:25:59,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-12 12:25:59,572 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:25:59,573 INFO L195 NwaCegarLoop]: 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] [2022-07-12 12:25:59,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 12:25:59,573 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:25:59,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:25:59,574 INFO L85 PathProgramCache]: Analyzing trace with hash 250572594, now seen corresponding path program 1 times [2022-07-12 12:25:59,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:25:59,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214786811] [2022-07-12 12:25:59,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:25:59,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:25:59,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:59,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:25:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:59,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:25:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:59,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 12:25:59,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:59,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 12:25:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:59,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 12:25:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:59,751 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-12 12:25:59,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:25:59,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214786811] [2022-07-12 12:25:59,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214786811] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:25:59,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:25:59,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:25:59,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090690684] [2022-07-12 12:25:59,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:25:59,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:25:59,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:25:59,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:25:59,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:25:59,753 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) [2022-07-12 12:26:01,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:26:01,068 INFO L93 Difference]: Finished difference Result 3187 states and 4578 transitions. [2022-07-12 12:26:01,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:26:01,069 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 [2022-07-12 12:26:01,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:26:01,085 INFO L225 Difference]: With dead ends: 3187 [2022-07-12 12:26:01,086 INFO L226 Difference]: Without dead ends: 2232 [2022-07-12 12:26:01,089 INFO L412 NwaCegarLoop]: 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 [2022-07-12 12:26:01,090 INFO L413 NwaCegarLoop]: 741 mSDtfsCounter, 1173 mSDsluCounter, 1424 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1234 SdHoareTripleChecker+Valid, 2165 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 12:26:01,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1234 Valid, 2165 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-12 12:26:01,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2232 states. [2022-07-12 12:26:01,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2232 to 1908. [2022-07-12 12:26:01,166 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) [2022-07-12 12:26:01,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1908 states to 1908 states and 2692 transitions. [2022-07-12 12:26:01,176 INFO L78 Accepts]: Start accepts. Automaton has 1908 states and 2692 transitions. Word has length 53 [2022-07-12 12:26:01,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:26:01,177 INFO L495 AbstractCegarLoop]: Abstraction has 1908 states and 2692 transitions. [2022-07-12 12:26:01,177 INFO L496 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) [2022-07-12 12:26:01,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 2692 transitions. [2022-07-12 12:26:01,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-12 12:26:01,179 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:26:01,179 INFO L195 NwaCegarLoop]: 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] [2022-07-12 12:26:01,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 12:26:01,179 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:26:01,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:26:01,180 INFO L85 PathProgramCache]: Analyzing trace with hash -822389373, now seen corresponding path program 1 times [2022-07-12 12:26:01,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:26:01,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254511690] [2022-07-12 12:26:01,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:26:01,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:26:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:01,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:26:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:01,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:26:01,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:01,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 12:26:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:01,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 12:26:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:01,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 12:26:01,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:01,291 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-12 12:26:01,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:26:01,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254511690] [2022-07-12 12:26:01,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254511690] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:26:01,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:26:01,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:26:01,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962786934] [2022-07-12 12:26:01,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:26:01,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:26:01,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:26:01,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:26:01,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:26:01,295 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) [2022-07-12 12:26:02,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:26:02,164 INFO L93 Difference]: Finished difference Result 2230 states and 3223 transitions. [2022-07-12 12:26:02,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 12:26:02,164 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 [2022-07-12 12:26:02,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:26:02,205 INFO L225 Difference]: With dead ends: 2230 [2022-07-12 12:26:02,205 INFO L226 Difference]: Without dead ends: 2218 [2022-07-12 12:26:02,207 INFO L412 NwaCegarLoop]: 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 [2022-07-12 12:26:02,208 INFO L413 NwaCegarLoop]: 648 mSDtfsCounter, 938 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2022-07-12 12:26:02,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [990 Valid, 1461 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 12:26:02,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2022-07-12 12:26:02,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 1898. [2022-07-12 12:26:02,289 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) [2022-07-12 12:26:02,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 2678 transitions. [2022-07-12 12:26:02,302 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 2678 transitions. Word has length 54 [2022-07-12 12:26:02,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:26:02,303 INFO L495 AbstractCegarLoop]: Abstraction has 1898 states and 2678 transitions. [2022-07-12 12:26:02,303 INFO L496 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) [2022-07-12 12:26:02,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2678 transitions. [2022-07-12 12:26:02,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-12 12:26:02,305 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:26:02,305 INFO L195 NwaCegarLoop]: 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] [2022-07-12 12:26:02,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 12:26:02,306 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:26:02,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:26:02,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1986046453, now seen corresponding path program 1 times [2022-07-12 12:26:02,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:26:02,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861201316] [2022-07-12 12:26:02,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:26:02,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:26:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:02,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:26:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:02,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:26:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:02,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 12:26:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:02,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 12:26:02,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:02,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 12:26:02,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:02,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 12:26:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:02,426 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 12:26:02,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:26:02,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861201316] [2022-07-12 12:26:02,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861201316] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:26:02,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:26:02,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:26:02,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847719947] [2022-07-12 12:26:02,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:26:02,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:26:02,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:26:02,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:26:02,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:26:02,429 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) [2022-07-12 12:26:03,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:26:03,905 INFO L93 Difference]: Finished difference Result 6142 states and 8755 transitions. [2022-07-12 12:26:03,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:26:03,906 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 [2022-07-12 12:26:03,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:26:03,926 INFO L225 Difference]: With dead ends: 6142 [2022-07-12 12:26:03,927 INFO L226 Difference]: Without dead ends: 4255 [2022-07-12 12:26:03,934 INFO L412 NwaCegarLoop]: 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 [2022-07-12 12:26:03,935 INFO L413 NwaCegarLoop]: 705 mSDtfsCounter, 1124 mSDsluCounter, 1360 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 2065 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 418 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-12 12:26:03,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1181 Valid, 2065 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [418 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-12 12:26:03,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4255 states. [2022-07-12 12:26:04,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4255 to 3604. [2022-07-12 12:26:04,091 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) [2022-07-12 12:26:04,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3604 states to 3604 states and 5049 transitions. [2022-07-12 12:26:04,103 INFO L78 Accepts]: Start accepts. Automaton has 3604 states and 5049 transitions. Word has length 66 [2022-07-12 12:26:04,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:26:04,103 INFO L495 AbstractCegarLoop]: Abstraction has 3604 states and 5049 transitions. [2022-07-12 12:26:04,104 INFO L496 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) [2022-07-12 12:26:04,104 INFO L276 IsEmpty]: Start isEmpty. Operand 3604 states and 5049 transitions. [2022-07-12 12:26:04,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-12 12:26:04,106 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:26:04,106 INFO L195 NwaCegarLoop]: 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] [2022-07-12 12:26:04,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 12:26:04,106 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:26:04,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:26:04,107 INFO L85 PathProgramCache]: Analyzing trace with hash -181003579, now seen corresponding path program 1 times [2022-07-12 12:26:04,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:26:04,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105416041] [2022-07-12 12:26:04,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:26:04,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:26:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:04,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:26:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:04,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:26:04,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:04,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 12:26:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:04,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 12:26:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:04,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 12:26:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:04,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 12:26:04,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:04,218 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 12:26:04,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:26:04,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105416041] [2022-07-12 12:26:04,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105416041] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:26:04,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:26:04,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:26:04,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059932629] [2022-07-12 12:26:04,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:26:04,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:26:04,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:26:04,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:26:04,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:26:04,221 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) [2022-07-12 12:26:06,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:26:06,114 INFO L93 Difference]: Finished difference Result 10431 states and 14766 transitions. [2022-07-12 12:26:06,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:26:06,115 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 [2022-07-12 12:26:06,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:26:06,147 INFO L225 Difference]: With dead ends: 10431 [2022-07-12 12:26:06,148 INFO L226 Difference]: Without dead ends: 6848 [2022-07-12 12:26:06,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:26:06,162 INFO L413 NwaCegarLoop]: 1049 mSDtfsCounter, 962 mSDsluCounter, 1807 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 2856 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-12 12:26:06,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1022 Valid, 2856 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-12 12:26:06,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6848 states. [2022-07-12 12:26:06,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6848 to 5818. [2022-07-12 12:26:06,418 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) [2022-07-12 12:26:06,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5818 states to 5818 states and 8111 transitions. [2022-07-12 12:26:06,437 INFO L78 Accepts]: Start accepts. Automaton has 5818 states and 8111 transitions. Word has length 65 [2022-07-12 12:26:06,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:26:06,439 INFO L495 AbstractCegarLoop]: Abstraction has 5818 states and 8111 transitions. [2022-07-12 12:26:06,439 INFO L496 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) [2022-07-12 12:26:06,439 INFO L276 IsEmpty]: Start isEmpty. Operand 5818 states and 8111 transitions. [2022-07-12 12:26:06,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-12 12:26:06,449 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:26:06,450 INFO L195 NwaCegarLoop]: 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] [2022-07-12 12:26:06,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 12:26:06,450 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:26:06,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:26:06,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1535676253, now seen corresponding path program 1 times [2022-07-12 12:26:06,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:26:06,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314712516] [2022-07-12 12:26:06,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:26:06,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:26:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:06,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:26:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:06,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:26:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:06,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 12:26:06,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:06,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 12:26:06,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:06,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 12:26:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:06,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:26:06,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:06,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 12:26:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:06,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 12:26:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:06,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 12:26:06,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:06,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 12:26:06,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:06,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 12:26:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:06,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 12:26:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:06,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 12:26:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:06,781 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-07-12 12:26:06,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:26:06,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314712516] [2022-07-12 12:26:06,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314712516] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:26:06,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:26:06,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 12:26:06,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937877775] [2022-07-12 12:26:06,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:26:06,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 12:26:06,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:26:06,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 12:26:06,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 12:26:06,784 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) [2022-07-12 12:26:09,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:26:09,329 INFO L93 Difference]: Finished difference Result 10230 states and 14590 transitions. [2022-07-12 12:26:09,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 12:26:09,334 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 [2022-07-12 12:26:09,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:26:09,384 INFO L225 Difference]: With dead ends: 10230 [2022-07-12 12:26:09,385 INFO L226 Difference]: Without dead ends: 10227 [2022-07-12 12:26:09,392 INFO L412 NwaCegarLoop]: 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 [2022-07-12 12:26:09,392 INFO L413 NwaCegarLoop]: 1327 mSDtfsCounter, 2079 mSDsluCounter, 2549 mSDsCounter, 0 mSdLazyCounter, 1477 mSolverCounterSat, 686 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2185 SdHoareTripleChecker+Valid, 3876 SdHoareTripleChecker+Invalid, 2163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 686 IncrementalHoareTripleChecker+Valid, 1477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-12 12:26:09,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2185 Valid, 3876 Invalid, 2163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [686 Valid, 1477 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-12 12:26:09,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10227 states. [2022-07-12 12:26:09,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10227 to 8696. [2022-07-12 12:26:09,828 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) [2022-07-12 12:26:09,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8696 states to 8696 states and 12159 transitions. [2022-07-12 12:26:09,857 INFO L78 Accepts]: Start accepts. Automaton has 8696 states and 12159 transitions. Word has length 122 [2022-07-12 12:26:09,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:26:09,857 INFO L495 AbstractCegarLoop]: Abstraction has 8696 states and 12159 transitions. [2022-07-12 12:26:09,858 INFO L496 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) [2022-07-12 12:26:09,858 INFO L276 IsEmpty]: Start isEmpty. Operand 8696 states and 12159 transitions. [2022-07-12 12:26:09,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-12 12:26:09,865 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:26:09,865 INFO L195 NwaCegarLoop]: 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] [2022-07-12 12:26:09,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 12:26:09,866 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:26:09,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:26:09,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1504761742, now seen corresponding path program 1 times [2022-07-12 12:26:09,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:26:09,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846564861] [2022-07-12 12:26:09,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:26:09,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:26:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:09,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:26:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:09,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:26:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:09,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 12:26:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:09,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 12:26:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:09,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 12:26:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:09,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:26:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:09,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 12:26:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:10,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 12:26:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:10,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 12:26:10,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:10,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 12:26:10,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:10,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 12:26:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:10,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 12:26:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:10,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 12:26:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:10,040 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-07-12 12:26:10,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:26:10,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846564861] [2022-07-12 12:26:10,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846564861] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:26:10,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:26:10,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:26:10,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799538964] [2022-07-12 12:26:10,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:26:10,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:26:10,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:26:10,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:26:10,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:26:10,043 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) [2022-07-12 12:26:11,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:26:11,943 INFO L93 Difference]: Finished difference Result 24686 states and 34978 transitions. [2022-07-12 12:26:11,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:26:11,943 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 [2022-07-12 12:26:11,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:26:12,020 INFO L225 Difference]: With dead ends: 24686 [2022-07-12 12:26:12,021 INFO L226 Difference]: Without dead ends: 16027 [2022-07-12 12:26:12,059 INFO L412 NwaCegarLoop]: 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 [2022-07-12 12:26:12,060 INFO L413 NwaCegarLoop]: 860 mSDtfsCounter, 1082 mSDsluCounter, 1551 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1140 SdHoareTripleChecker+Valid, 2411 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-12 12:26:12,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1140 Valid, 2411 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-12 12:26:12,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16027 states. [2022-07-12 12:26:12,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16027 to 13615. [2022-07-12 12:26:12,721 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) [2022-07-12 12:26:12,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13615 states to 13615 states and 18938 transitions. [2022-07-12 12:26:12,836 INFO L78 Accepts]: Start accepts. Automaton has 13615 states and 18938 transitions. Word has length 123 [2022-07-12 12:26:12,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:26:12,836 INFO L495 AbstractCegarLoop]: Abstraction has 13615 states and 18938 transitions. [2022-07-12 12:26:12,837 INFO L496 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) [2022-07-12 12:26:12,837 INFO L276 IsEmpty]: Start isEmpty. Operand 13615 states and 18938 transitions. [2022-07-12 12:26:12,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-12 12:26:12,849 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:26:12,849 INFO L195 NwaCegarLoop]: 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] [2022-07-12 12:26:12,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 12:26:12,849 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:26:12,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:26:12,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1949944417, now seen corresponding path program 1 times [2022-07-12 12:26:12,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:26:12,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565790941] [2022-07-12 12:26:12,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:26:12,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:26:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:12,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:26:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:13,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:26:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:13,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 12:26:13,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:13,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 12:26:13,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:13,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 12:26:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:13,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:26:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:13,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 12:26:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:13,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 12:26:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:13,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 12:26:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:13,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 12:26:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:13,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 12:26:13,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:13,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 12:26:13,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:13,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 12:26:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:13,067 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-07-12 12:26:13,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:26:13,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565790941] [2022-07-12 12:26:13,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565790941] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:26:13,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:26:13,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 12:26:13,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350408605] [2022-07-12 12:26:13,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:26:13,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 12:26:13,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:26:13,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 12:26:13,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-12 12:26:13,069 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) [2022-07-12 12:26:15,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:26:15,195 INFO L93 Difference]: Finished difference Result 20835 states and 29445 transitions. [2022-07-12 12:26:15,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 12:26:15,196 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 [2022-07-12 12:26:15,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:26:15,262 INFO L225 Difference]: With dead ends: 20835 [2022-07-12 12:26:15,263 INFO L226 Difference]: Without dead ends: 16267 [2022-07-12 12:26:15,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-07-12 12:26:15,286 INFO L413 NwaCegarLoop]: 655 mSDtfsCounter, 272 mSDsluCounter, 3588 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 4243 SdHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-12 12:26:15,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 4243 Invalid, 1381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-12 12:26:15,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16267 states. [2022-07-12 12:26:15,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16267 to 13754. [2022-07-12 12:26:15,912 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) [2022-07-12 12:26:16,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13754 states to 13754 states and 19087 transitions. [2022-07-12 12:26:16,027 INFO L78 Accepts]: Start accepts. Automaton has 13754 states and 19087 transitions. Word has length 122 [2022-07-12 12:26:16,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:26:16,027 INFO L495 AbstractCegarLoop]: Abstraction has 13754 states and 19087 transitions. [2022-07-12 12:26:16,028 INFO L496 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) [2022-07-12 12:26:16,028 INFO L276 IsEmpty]: Start isEmpty. Operand 13754 states and 19087 transitions. [2022-07-12 12:26:16,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-12 12:26:16,041 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:26:16,041 INFO L195 NwaCegarLoop]: 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] [2022-07-12 12:26:16,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 12:26:16,042 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:26:16,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:26:16,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1749310071, now seen corresponding path program 1 times [2022-07-12 12:26:16,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:26:16,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336277430] [2022-07-12 12:26:16,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:26:16,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:26:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:16,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:26:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:16,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:26:16,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:16,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 12:26:16,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:16,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 12:26:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:16,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 12:26:16,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:16,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:26:16,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:16,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 12:26:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:16,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 12:26:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:16,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 12:26:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:16,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 12:26:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:16,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 12:26:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:16,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 12:26:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:16,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:26:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:16,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 12:26:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:16,248 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-07-12 12:26:16,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:26:16,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336277430] [2022-07-12 12:26:16,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336277430] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:26:16,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:26:16,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 12:26:16,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489172046] [2022-07-12 12:26:16,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:26:16,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 12:26:16,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:26:16,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 12:26:16,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 12:26:16,251 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) [2022-07-12 12:26:18,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:26:18,576 INFO L93 Difference]: Finished difference Result 38432 states and 54071 transitions. [2022-07-12 12:26:18,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:26:18,577 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 [2022-07-12 12:26:18,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:26:18,693 INFO L225 Difference]: With dead ends: 38432 [2022-07-12 12:26:18,693 INFO L226 Difference]: Without dead ends: 24715 [2022-07-12 12:26:18,744 INFO L412 NwaCegarLoop]: 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 [2022-07-12 12:26:18,744 INFO L413 NwaCegarLoop]: 843 mSDtfsCounter, 1197 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 531 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1257 SdHoareTripleChecker+Valid, 2340 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 531 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-12 12:26:18,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1257 Valid, 2340 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [531 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-12 12:26:18,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24715 states. [2022-07-12 12:26:19,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24715 to 21044. [2022-07-12 12:26:19,547 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) [2022-07-12 12:26:19,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21044 states to 21044 states and 29052 transitions. [2022-07-12 12:26:19,711 INFO L78 Accepts]: Start accepts. Automaton has 21044 states and 29052 transitions. Word has length 141 [2022-07-12 12:26:19,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:26:19,711 INFO L495 AbstractCegarLoop]: Abstraction has 21044 states and 29052 transitions. [2022-07-12 12:26:19,712 INFO L496 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) [2022-07-12 12:26:19,712 INFO L276 IsEmpty]: Start isEmpty. Operand 21044 states and 29052 transitions. [2022-07-12 12:26:19,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-12 12:26:19,723 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:26:19,723 INFO L195 NwaCegarLoop]: 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] [2022-07-12 12:26:19,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 12:26:19,724 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:26:19,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:26:19,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1038448743, now seen corresponding path program 1 times [2022-07-12 12:26:19,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:26:19,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158377100] [2022-07-12 12:26:19,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:26:19,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:26:19,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:19,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:26:19,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:19,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:26:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:19,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 12:26:19,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:19,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 12:26:19,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:19,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 12:26:19,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:19,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:26:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:19,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 12:26:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:19,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 12:26:19,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:19,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 12:26:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:19,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 12:26:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:19,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 12:26:19,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:19,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 12:26:19,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:19,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:26:19,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:19,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 12:26:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:19,944 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-07-12 12:26:19,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:26:19,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158377100] [2022-07-12 12:26:19,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158377100] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:26:19,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:26:19,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 12:26:19,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002988669] [2022-07-12 12:26:19,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:26:19,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 12:26:19,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:26:19,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 12:26:19,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-12 12:26:19,947 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) [2022-07-12 12:26:21,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:26:21,786 INFO L93 Difference]: Finished difference Result 30746 states and 42907 transitions. [2022-07-12 12:26:21,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 12:26:21,786 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 [2022-07-12 12:26:21,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:26:21,847 INFO L225 Difference]: With dead ends: 30746 [2022-07-12 12:26:21,848 INFO L226 Difference]: Without dead ends: 16636 [2022-07-12 12:26:21,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-07-12 12:26:21,888 INFO L413 NwaCegarLoop]: 649 mSDtfsCounter, 309 mSDsluCounter, 2862 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 3511 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-12 12:26:21,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 3511 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-12 12:26:21,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16636 states. [2022-07-12 12:26:22,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16636 to 14099. [2022-07-12 12:26:22,468 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) [2022-07-12 12:26:22,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14099 states to 14099 states and 19390 transitions. [2022-07-12 12:26:22,506 INFO L78 Accepts]: Start accepts. Automaton has 14099 states and 19390 transitions. Word has length 140 [2022-07-12 12:26:22,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:26:22,507 INFO L495 AbstractCegarLoop]: Abstraction has 14099 states and 19390 transitions. [2022-07-12 12:26:22,507 INFO L496 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) [2022-07-12 12:26:22,507 INFO L276 IsEmpty]: Start isEmpty. Operand 14099 states and 19390 transitions. [2022-07-12 12:26:22,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-12 12:26:22,521 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:26:22,521 INFO L195 NwaCegarLoop]: 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] [2022-07-12 12:26:22,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 12:26:22,522 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:26:22,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:26:22,522 INFO L85 PathProgramCache]: Analyzing trace with hash 935962192, now seen corresponding path program 1 times [2022-07-12 12:26:22,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:26:22,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837233191] [2022-07-12 12:26:22,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:26:22,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:26:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:22,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:26:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:22,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:26:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:22,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 12:26:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:22,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 12:26:22,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:22,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 12:26:22,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:22,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:26:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:22,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 12:26:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:22,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 12:26:22,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:22,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 12:26:22,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:22,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 12:26:22,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:22,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 12:26:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:22,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 12:26:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:22,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:26:22,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:22,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 12:26:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:22,803 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2022-07-12 12:26:22,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:26:22,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837233191] [2022-07-12 12:26:22,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837233191] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:26:22,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579169533] [2022-07-12 12:26:22,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:26:22,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:26:22,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:26:22,806 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:26:22,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 12:26:23,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:23,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 1458 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 12:26:23,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:26:23,645 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-07-12 12:26:23,645 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:26:23,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579169533] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:26:23,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:26:23,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2022-07-12 12:26:23,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541497891] [2022-07-12 12:26:23,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:26:23,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 12:26:23,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:26:23,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 12:26:23,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-07-12 12:26:23,649 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) [2022-07-12 12:26:25,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:26:25,330 INFO L93 Difference]: Finished difference Result 14099 states and 19390 transitions. [2022-07-12 12:26:25,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 12:26:25,330 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 [2022-07-12 12:26:25,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:26:25,332 INFO L225 Difference]: With dead ends: 14099 [2022-07-12 12:26:25,332 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 12:26:25,354 INFO L412 NwaCegarLoop]: 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 [2022-07-12 12:26:25,355 INFO L413 NwaCegarLoop]: 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.9s IncrementalHoareTripleChecker+Time [2022-07-12 12:26:25,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1307 Valid, 1197 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [376 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 12:26:25,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 12:26:25,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 12:26:25,356 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) [2022-07-12 12:26:25,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 12:26:25,357 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 144 [2022-07-12 12:26:25,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:26:25,357 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 12:26:25,358 INFO L496 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) [2022-07-12 12:26:25,358 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 12:26:25,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 12:26:25,361 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 12:26:25,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 12:26:25,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-12 12:26:25,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-12 12:27:40,133 WARN L233 SmtUtils]: Spent 5.03s on a formula simplification. DAG size of input: 71 DAG size of output: 69 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-12 12:28:30,906 WARN L233 SmtUtils]: Spent 5.02s on a formula simplification. DAG size of input: 71 DAG size of output: 69 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or)