./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--input--touchscreen--usbtouchscreen.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--input--touchscreen--usbtouchscreen.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 5c13092b5fe0ffbf7fbf1fe31d493be6a68ca2455b811b10fd7983ff470e432f --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 12:21:10,217 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 12:21:10,219 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 12:21:10,276 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 12:21:10,277 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 12:21:10,278 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 12:21:10,280 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 12:21:10,282 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 12:21:10,284 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 12:21:10,289 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 12:21:10,290 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 12:21:10,291 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 12:21:10,291 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 12:21:10,293 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 12:21:10,294 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 12:21:10,296 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 12:21:10,297 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 12:21:10,298 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 12:21:10,299 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 12:21:10,303 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 12:21:10,304 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 12:21:10,305 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 12:21:10,306 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 12:21:10,306 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 12:21:10,308 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 12:21:10,313 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 12:21:10,313 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 12:21:10,313 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 12:21:10,314 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 12:21:10,314 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 12:21:10,315 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 12:21:10,315 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 12:21:10,316 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 12:21:10,317 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 12:21:10,317 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 12:21:10,318 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 12:21:10,318 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 12:21:10,319 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 12:21:10,319 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 12:21:10,320 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 12:21:10,320 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 12:21:10,322 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 12:21:10,323 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:21:10,345 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 12:21:10,345 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 12:21:10,345 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 12:21:10,345 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 12:21:10,346 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 12:21:10,346 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 12:21:10,347 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 12:21:10,347 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 12:21:10,347 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 12:21:10,347 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 12:21:10,348 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 12:21:10,348 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 12:21:10,348 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 12:21:10,348 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 12:21:10,348 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 12:21:10,348 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 12:21:10,348 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 12:21:10,349 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 12:21:10,349 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 12:21:10,349 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 12:21:10,349 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 12:21:10,349 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 12:21:10,349 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 12:21:10,350 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 12:21:10,350 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 12:21:10,350 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 12:21:10,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 12:21:10,350 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 12:21:10,350 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 12:21:10,350 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 12:21:10,351 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 -> 5c13092b5fe0ffbf7fbf1fe31d493be6a68ca2455b811b10fd7983ff470e432f [2022-07-12 12:21:10,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 12:21:10,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 12:21:10,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 12:21:10,631 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 12:21:10,632 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 12:21:10,633 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--input--touchscreen--usbtouchscreen.ko-entry_point.cil.out.i [2022-07-12 12:21:10,712 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dcafc02b/4830d6dc4cbf4adc8b18af6475aa89c5/FLAGd06b58efd [2022-07-12 12:21:11,553 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 12:21:11,554 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--input--touchscreen--usbtouchscreen.ko-entry_point.cil.out.i [2022-07-12 12:21:11,644 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dcafc02b/4830d6dc4cbf4adc8b18af6475aa89c5/FLAGd06b58efd [2022-07-12 12:21:11,668 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dcafc02b/4830d6dc4cbf4adc8b18af6475aa89c5 [2022-07-12 12:21:11,670 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 12:21:11,672 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 12:21:11,673 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 12:21:11,673 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 12:21:11,675 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 12:21:11,676 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 12:21:11" (1/1) ... [2022-07-12 12:21:11,677 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58607aa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:21:11, skipping insertion in model container [2022-07-12 12:21:11,677 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 12:21:11" (1/1) ... [2022-07-12 12:21:11,681 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 12:21:11,784 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 12:21:12,468 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--input--touchscreen--usbtouchscreen.ko-entry_point.cil.out.i[108030,108043] [2022-07-12 12:21:12,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 12:21:12,991 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 12:21:13,090 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--input--touchscreen--usbtouchscreen.ko-entry_point.cil.out.i[108030,108043] [2022-07-12 12:21:13,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 12:21:13,336 INFO L208 MainTranslator]: Completed translation [2022-07-12 12:21:13,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:21:13 WrapperNode [2022-07-12 12:21:13,338 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 12:21:13,339 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 12:21:13,339 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 12:21:13,339 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 12:21:13,344 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:21:13" (1/1) ... [2022-07-12 12:21:13,419 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:21:13" (1/1) ... [2022-07-12 12:21:13,543 INFO L137 Inliner]: procedures = 178, calls = 1868, calls flagged for inlining = 81, calls inlined = 81, statements flattened = 3566 [2022-07-12 12:21:13,544 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 12:21:13,545 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 12:21:13,545 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 12:21:13,545 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 12:21:13,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:21:13" (1/1) ... [2022-07-12 12:21:13,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:21:13" (1/1) ... [2022-07-12 12:21:13,603 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:21:13" (1/1) ... [2022-07-12 12:21:13,604 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:21:13" (1/1) ... [2022-07-12 12:21:13,715 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:21:13" (1/1) ... [2022-07-12 12:21:13,734 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:21:13" (1/1) ... [2022-07-12 12:21:13,758 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:21:13" (1/1) ... [2022-07-12 12:21:13,782 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 12:21:13,783 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 12:21:13,783 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 12:21:13,784 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 12:21:13,784 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:21:13" (1/1) ... [2022-07-12 12:21:13,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 12:21:13,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:21:13,808 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:21:13,813 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:21:13,832 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~int [2022-07-12 12:21:13,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~int [2022-07-12 12:21:13,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 12:21:13,833 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_3 [2022-07-12 12:21:13,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_3 [2022-07-12 12:21:13,833 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_8 [2022-07-12 12:21:13,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_8 [2022-07-12 12:21:13,833 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_5 [2022-07-12 12:21:13,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_5 [2022-07-12 12:21:13,834 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_6 [2022-07-12 12:21:13,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_6 [2022-07-12 12:21:13,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 12:21:13,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 12:21:13,834 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2022-07-12 12:21:13,834 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2022-07-12 12:21:13,834 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 12:21:13,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 12:21:13,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 12:21:13,835 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_20 [2022-07-12 12:21:13,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_20 [2022-07-12 12:21:13,835 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2022-07-12 12:21:13,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2022-07-12 12:21:13,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-12 12:21:13,835 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-12 12:21:13,835 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-12 12:21:13,835 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-12 12:21:13,836 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 12:21:13,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 12:21:13,836 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2022-07-12 12:21:13,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2022-07-12 12:21:13,836 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-12 12:21:13,836 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-12 12:21:13,836 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~VOID [2022-07-12 12:21:13,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~VOID [2022-07-12 12:21:13,837 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-12 12:21:13,837 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-12 12:21:13,837 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_resume [2022-07-12 12:21:13,837 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_resume [2022-07-12 12:21:13,837 INFO L130 BoogieDeclarations]: Found specification of procedure kstrdup [2022-07-12 12:21:13,837 INFO L138 BoogieDeclarations]: Found implementation of procedure kstrdup [2022-07-12 12:21:13,837 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2022-07-12 12:21:13,837 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2022-07-12 12:21:13,837 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_reset_resume [2022-07-12 12:21:13,838 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_reset_resume [2022-07-12 12:21:13,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 12:21:13,838 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-12 12:21:13,838 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-12 12:21:13,838 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-12 12:21:13,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-12 12:21:13,838 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2022-07-12 12:21:13,838 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2022-07-12 12:21:13,839 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 12:21:13,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 12:21:13,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-12 12:21:13,839 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-12 12:21:13,839 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 12:21:13,839 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 12:21:13,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 12:21:13,839 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2022-07-12 12:21:13,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2022-07-12 12:21:13,840 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_free_buffers [2022-07-12 12:21:13,840 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_free_buffers [2022-07-12 12:21:13,840 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_disconnect [2022-07-12 12:21:13,840 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_disconnect [2022-07-12 12:21:13,840 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_22 [2022-07-12 12:21:13,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_22 [2022-07-12 12:21:13,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 12:21:13,840 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-12 12:21:13,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-12 12:21:13,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 12:21:13,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 12:21:13,841 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2022-07-12 12:21:13,841 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2022-07-12 12:21:13,841 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-07-12 12:21:13,841 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-07-12 12:21:13,841 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 12:21:13,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 12:21:13,842 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-12 12:21:13,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-12 12:21:13,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 12:21:13,842 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2022-07-12 12:21:13,842 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2022-07-12 12:21:13,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_14 [2022-07-12 12:21:13,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_14 [2022-07-12 12:21:13,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_16 [2022-07-12 12:21:13,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_16 [2022-07-12 12:21:13,843 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_get_interface [2022-07-12 12:21:13,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_get_interface [2022-07-12 12:21:13,843 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_probe [2022-07-12 12:21:13,843 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_probe [2022-07-12 12:21:13,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 12:21:13,843 INFO L130 BoogieDeclarations]: Found specification of procedure input_get_drvdata [2022-07-12 12:21:13,843 INFO L138 BoogieDeclarations]: Found implementation of procedure input_get_drvdata [2022-07-12 12:21:13,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 12:21:13,844 INFO L130 BoogieDeclarations]: Found specification of procedure input_unregister_device [2022-07-12 12:21:13,844 INFO L138 BoogieDeclarations]: Found implementation of procedure input_unregister_device [2022-07-12 12:21:13,844 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_open [2022-07-12 12:21:13,844 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_open [2022-07-12 12:21:13,844 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_12 [2022-07-12 12:21:13,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_12 [2022-07-12 12:21:13,844 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-12 12:21:13,844 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-12 12:21:13,845 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-12 12:21:13,845 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-12 12:21:13,845 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-07-12 12:21:13,845 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-07-12 12:21:13,845 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_irq [2022-07-12 12:21:13,845 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_irq [2022-07-12 12:21:13,845 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-12 12:21:13,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-12 12:21:13,845 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_process_pkt [2022-07-12 12:21:13,846 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_process_pkt [2022-07-12 12:21:13,846 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2022-07-12 12:21:13,846 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2022-07-12 12:21:13,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_put_interface [2022-07-12 12:21:13,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_put_interface [2022-07-12 12:21:13,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2022-07-12 12:21:13,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2022-07-12 12:21:13,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 12:21:13,847 INFO L130 BoogieDeclarations]: Found specification of procedure nexio_read_data [2022-07-12 12:21:13,847 INFO L138 BoogieDeclarations]: Found implementation of procedure nexio_read_data [2022-07-12 12:21:13,847 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2022-07-12 12:21:13,847 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2022-07-12 12:21:13,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-12 12:21:13,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-12 12:21:13,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-12 12:21:13,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 12:21:13,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 12:21:13,848 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_abs [2022-07-12 12:21:13,848 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_abs [2022-07-12 12:21:13,848 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_process_multi [2022-07-12 12:21:13,848 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_process_multi [2022-07-12 12:21:14,377 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 12:21:14,396 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 12:21:14,626 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 12:21:16,261 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2022-07-12 12:21:16,840 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 12:21:16,849 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 12:21:16,849 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 12:21:16,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:21:16 BoogieIcfgContainer [2022-07-12 12:21:16,851 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 12:21:16,852 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 12:21:16,852 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 12:21:16,854 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 12:21:16,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 12:21:11" (1/3) ... [2022-07-12 12:21:16,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d36663d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 12:21:16, skipping insertion in model container [2022-07-12 12:21:16,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:21:13" (2/3) ... [2022-07-12 12:21:16,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d36663d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 12:21:16, skipping insertion in model container [2022-07-12 12:21:16,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:21:16" (3/3) ... [2022-07-12 12:21:16,856 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--input--touchscreen--usbtouchscreen.ko-entry_point.cil.out.i [2022-07-12 12:21:16,866 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 12:21:16,866 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 12:21:16,907 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 12:21:16,911 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@508c9fa3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@d587cab [2022-07-12 12:21:16,912 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 12:21:16,917 INFO L276 IsEmpty]: Start isEmpty. Operand has 969 states, 704 states have (on average 1.359375) internal successors, (957), 723 states have internal predecessors, (957), 207 states have call successors, (207), 58 states have call predecessors, (207), 56 states have return successors, (201), 199 states have call predecessors, (201), 201 states have call successors, (201) [2022-07-12 12:21:16,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 12:21:16,923 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:21:16,924 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 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:21:16,924 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:21:16,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:21:16,927 INFO L85 PathProgramCache]: Analyzing trace with hash -84985716, now seen corresponding path program 1 times [2022-07-12 12:21:16,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:21:16,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690797368] [2022-07-12 12:21:16,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:21:16,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:21:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:17,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:21:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:17,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:21:17,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:17,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 12:21:17,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:21:17,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690797368] [2022-07-12 12:21:17,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690797368] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:21:17,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:21:17,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:21:17,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799017314] [2022-07-12 12:21:17,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:21:17,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:21:17,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:21:17,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:21:17,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:21:17,393 INFO L87 Difference]: Start difference. First operand has 969 states, 704 states have (on average 1.359375) internal successors, (957), 723 states have internal predecessors, (957), 207 states have call successors, (207), 58 states have call predecessors, (207), 56 states have return successors, (201), 199 states have call predecessors, (201), 201 states have call successors, (201) Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 12:21:24,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:21:24,466 INFO L93 Difference]: Finished difference Result 3568 states and 5311 transitions. [2022-07-12 12:21:24,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:21:24,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-07-12 12:21:24,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:21:24,497 INFO L225 Difference]: With dead ends: 3568 [2022-07-12 12:21:24,498 INFO L226 Difference]: Without dead ends: 2580 [2022-07-12 12:21:24,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 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:21:24,516 INFO L413 NwaCegarLoop]: 1549 mSDtfsCounter, 3152 mSDsluCounter, 2140 mSDsCounter, 0 mSdLazyCounter, 2297 mSolverCounterSat, 1580 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3338 SdHoareTripleChecker+Valid, 3689 SdHoareTripleChecker+Invalid, 3877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1580 IncrementalHoareTripleChecker+Valid, 2297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-07-12 12:21:24,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3338 Valid, 3689 Invalid, 3877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1580 Valid, 2297 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2022-07-12 12:21:24,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2580 states. [2022-07-12 12:21:24,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2580 to 1879. [2022-07-12 12:21:24,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1879 states, 1375 states have (on average 1.3447272727272728) internal successors, (1849), 1392 states have internal predecessors, (1849), 393 states have call successors, (393), 111 states have call predecessors, (393), 110 states have return successors, (387), 383 states have call predecessors, (387), 387 states have call successors, (387) [2022-07-12 12:21:24,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 2629 transitions. [2022-07-12 12:21:24,684 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 2629 transitions. Word has length 28 [2022-07-12 12:21:24,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:21:24,684 INFO L495 AbstractCegarLoop]: Abstraction has 1879 states and 2629 transitions. [2022-07-12 12:21:24,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 12:21:24,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 2629 transitions. [2022-07-12 12:21:24,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-12 12:21:24,691 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:21:24,691 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 12:21:24,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 12:21:24,692 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:21:24,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:21:24,692 INFO L85 PathProgramCache]: Analyzing trace with hash 818955978, now seen corresponding path program 1 times [2022-07-12 12:21:24,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:21:24,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072193817] [2022-07-12 12:21:24,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:21:24,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:21:24,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:24,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:21:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:24,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:21:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:24,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 12:21:24,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:24,868 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 12:21:24,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:21:24,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072193817] [2022-07-12 12:21:24,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072193817] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:21:24,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:21:24,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:21:24,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338297744] [2022-07-12 12:21:24,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:21:24,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:21:24,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:21:24,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:21:24,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:21:24,872 INFO L87 Difference]: Start difference. First operand 1879 states and 2629 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 12:21:27,870 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:21:31,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:21:31,485 INFO L93 Difference]: Finished difference Result 2603 states and 3754 transitions. [2022-07-12 12:21:31,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 12:21:31,486 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2022-07-12 12:21:31,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:21:31,516 INFO L225 Difference]: With dead ends: 2603 [2022-07-12 12:21:31,516 INFO L226 Difference]: Without dead ends: 2590 [2022-07-12 12:21:31,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 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:21:31,521 INFO L413 NwaCegarLoop]: 1215 mSDtfsCounter, 2242 mSDsluCounter, 1051 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 1011 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2363 SdHoareTripleChecker+Valid, 2266 SdHoareTripleChecker+Invalid, 2095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1011 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-07-12 12:21:31,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2363 Valid, 2266 Invalid, 2095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1011 Valid, 1084 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2022-07-12 12:21:31,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2590 states. [2022-07-12 12:21:31,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2590 to 1879. [2022-07-12 12:21:31,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1879 states, 1375 states have (on average 1.344) internal successors, (1848), 1392 states have internal predecessors, (1848), 393 states have call successors, (393), 111 states have call predecessors, (393), 110 states have return successors, (387), 383 states have call predecessors, (387), 387 states have call successors, (387) [2022-07-12 12:21:31,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 2628 transitions. [2022-07-12 12:21:31,617 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 2628 transitions. Word has length 38 [2022-07-12 12:21:31,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:21:31,619 INFO L495 AbstractCegarLoop]: Abstraction has 1879 states and 2628 transitions. [2022-07-12 12:21:31,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 12:21:31,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 2628 transitions. [2022-07-12 12:21:31,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-12 12:21:31,622 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:21:31,625 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 12:21:31,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 12:21:31,626 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:21:31,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:21:31,626 INFO L85 PathProgramCache]: Analyzing trace with hash 876214280, now seen corresponding path program 1 times [2022-07-12 12:21:31,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:21:31,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777291642] [2022-07-12 12:21:31,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:21:31,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:21:31,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:31,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:21:31,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:31,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:21:31,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:31,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 12:21:31,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:31,944 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 12:21:31,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:21:31,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777291642] [2022-07-12 12:21:31,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777291642] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:21:31,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:21:31,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:21:31,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248242633] [2022-07-12 12:21:31,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:21:31,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:21:31,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:21:31,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:21:31,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:21:31,947 INFO L87 Difference]: Start difference. First operand 1879 states and 2628 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 12:21:34,396 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:21:40,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:21:40,698 INFO L93 Difference]: Finished difference Result 7002 states and 10466 transitions. [2022-07-12 12:21:40,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:21:40,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2022-07-12 12:21:40,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:21:40,764 INFO L225 Difference]: With dead ends: 7002 [2022-07-12 12:21:40,779 INFO L226 Difference]: Without dead ends: 5137 [2022-07-12 12:21:40,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 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:21:40,792 INFO L413 NwaCegarLoop]: 1477 mSDtfsCounter, 3265 mSDsluCounter, 2130 mSDsCounter, 0 mSdLazyCounter, 2331 mSolverCounterSat, 1640 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3423 SdHoareTripleChecker+Valid, 3607 SdHoareTripleChecker+Invalid, 3971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1640 IncrementalHoareTripleChecker+Valid, 2331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-07-12 12:21:40,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3423 Valid, 3607 Invalid, 3971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1640 Valid, 2331 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2022-07-12 12:21:40,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5137 states. [2022-07-12 12:21:40,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5137 to 4286. [2022-07-12 12:21:40,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4286 states, 3139 states have (on average 1.3284485504937877) internal successors, (4170), 3172 states have internal predecessors, (4170), 851 states have call successors, (851), 220 states have call predecessors, (851), 295 states have return successors, (1211), 909 states have call predecessors, (1211), 845 states have call successors, (1211) [2022-07-12 12:21:40,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4286 states to 4286 states and 6232 transitions. [2022-07-12 12:21:40,968 INFO L78 Accepts]: Start accepts. Automaton has 4286 states and 6232 transitions. Word has length 38 [2022-07-12 12:21:40,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:21:40,969 INFO L495 AbstractCegarLoop]: Abstraction has 4286 states and 6232 transitions. [2022-07-12 12:21:40,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 12:21:40,969 INFO L276 IsEmpty]: Start isEmpty. Operand 4286 states and 6232 transitions. [2022-07-12 12:21:40,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 12:21:40,971 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:21:40,972 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 12:21:40,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 12:21:40,972 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:21:40,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:21:40,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1392341914, now seen corresponding path program 1 times [2022-07-12 12:21:40,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:21:40,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248474422] [2022-07-12 12:21:40,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:21:40,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:21:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:41,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:21:41,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:41,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:21:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:41,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 12:21:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:41,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 12:21:41,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:21:41,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248474422] [2022-07-12 12:21:41,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248474422] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:21:41,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:21:41,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:21:41,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391577359] [2022-07-12 12:21:41,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:21:41,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:21:41,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:21:41,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:21:41,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:21:41,151 INFO L87 Difference]: Start difference. First operand 4286 states and 6232 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 12:21:45,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:21:45,062 INFO L93 Difference]: Finished difference Result 5128 states and 7662 transitions. [2022-07-12 12:21:45,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 12:21:45,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2022-07-12 12:21:45,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:21:45,087 INFO L225 Difference]: With dead ends: 5128 [2022-07-12 12:21:45,087 INFO L226 Difference]: Without dead ends: 5125 [2022-07-12 12:21:45,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 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:21:45,092 INFO L413 NwaCegarLoop]: 1188 mSDtfsCounter, 2263 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 1078 mSolverCounterSat, 1011 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2387 SdHoareTripleChecker+Valid, 2161 SdHoareTripleChecker+Invalid, 2089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1011 IncrementalHoareTripleChecker+Valid, 1078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-12 12:21:45,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2387 Valid, 2161 Invalid, 2089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1011 Valid, 1078 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-07-12 12:21:45,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5125 states. [2022-07-12 12:21:45,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5125 to 4285. [2022-07-12 12:21:45,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4285 states, 3139 states have (on average 1.3281299776999045) internal successors, (4169), 3171 states have internal predecessors, (4169), 850 states have call successors, (850), 220 states have call predecessors, (850), 295 states have return successors, (1211), 909 states have call predecessors, (1211), 845 states have call successors, (1211) [2022-07-12 12:21:45,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4285 states to 4285 states and 6230 transitions. [2022-07-12 12:21:45,253 INFO L78 Accepts]: Start accepts. Automaton has 4285 states and 6230 transitions. Word has length 39 [2022-07-12 12:21:45,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:21:45,255 INFO L495 AbstractCegarLoop]: Abstraction has 4285 states and 6230 transitions. [2022-07-12 12:21:45,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 12:21:45,255 INFO L276 IsEmpty]: Start isEmpty. Operand 4285 states and 6230 transitions. [2022-07-12 12:21:45,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-12 12:21:45,256 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:21:45,256 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 12:21:45,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 12:21:45,256 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:21:45,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:21:45,257 INFO L85 PathProgramCache]: Analyzing trace with hash 212434251, now seen corresponding path program 1 times [2022-07-12 12:21:45,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:21:45,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964862680] [2022-07-12 12:21:45,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:21:45,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:21:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:45,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:21:45,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:45,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:21:45,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:45,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 12:21:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:45,455 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 12:21:45,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:21:45,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964862680] [2022-07-12 12:21:45,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964862680] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:21:45,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:21:45,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:21:45,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331695870] [2022-07-12 12:21:45,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:21:45,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:21:45,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:21:45,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:21:45,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:21:45,460 INFO L87 Difference]: Start difference. First operand 4285 states and 6230 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 12:21:49,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:21:49,518 INFO L93 Difference]: Finished difference Result 5127 states and 7660 transitions. [2022-07-12 12:21:49,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 12:21:49,518 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-07-12 12:21:49,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:21:49,546 INFO L225 Difference]: With dead ends: 5127 [2022-07-12 12:21:49,547 INFO L226 Difference]: Without dead ends: 5124 [2022-07-12 12:21:49,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 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:21:49,568 INFO L413 NwaCegarLoop]: 1187 mSDtfsCounter, 2223 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 1001 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2350 SdHoareTripleChecker+Valid, 2182 SdHoareTripleChecker+Invalid, 2082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1001 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-12 12:21:49,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2350 Valid, 2182 Invalid, 2082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1001 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-07-12 12:21:49,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5124 states. [2022-07-12 12:21:49,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5124 to 4284. [2022-07-12 12:21:49,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4284 states, 3139 states have (on average 1.327811404906021) internal successors, (4168), 3170 states have internal predecessors, (4168), 849 states have call successors, (849), 220 states have call predecessors, (849), 295 states have return successors, (1211), 909 states have call predecessors, (1211), 845 states have call successors, (1211) [2022-07-12 12:21:49,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4284 states to 4284 states and 6228 transitions. [2022-07-12 12:21:49,941 INFO L78 Accepts]: Start accepts. Automaton has 4284 states and 6228 transitions. Word has length 40 [2022-07-12 12:21:49,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:21:49,941 INFO L495 AbstractCegarLoop]: Abstraction has 4284 states and 6228 transitions. [2022-07-12 12:21:49,942 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 12:21:49,942 INFO L276 IsEmpty]: Start isEmpty. Operand 4284 states and 6228 transitions. [2022-07-12 12:21:49,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 12:21:49,943 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:21:49,943 INFO L195 NwaCegarLoop]: trace histogram [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:21:49,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 12:21:49,944 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:21:49,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:21:49,944 INFO L85 PathProgramCache]: Analyzing trace with hash -2004960067, now seen corresponding path program 1 times [2022-07-12 12:21:49,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:21:49,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450635900] [2022-07-12 12:21:49,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:21:49,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:21:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:50,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:21:50,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:50,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:21:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:50,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 12:21:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:50,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 12:21:50,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:21:50,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450635900] [2022-07-12 12:21:50,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450635900] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:21:50,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:21:50,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:21:50,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940250148] [2022-07-12 12:21:50,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:21:50,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:21:50,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:21:50,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:21:50,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:21:50,200 INFO L87 Difference]: Start difference. First operand 4284 states and 6228 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 12:21:56,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:21:56,623 INFO L93 Difference]: Finished difference Result 14467 states and 22170 transitions. [2022-07-12 12:21:56,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:21:56,624 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2022-07-12 12:21:56,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:21:56,779 INFO L225 Difference]: With dead ends: 14467 [2022-07-12 12:21:56,779 INFO L226 Difference]: Without dead ends: 10197 [2022-07-12 12:21:56,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 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:21:56,817 INFO L413 NwaCegarLoop]: 1418 mSDtfsCounter, 3193 mSDsluCounter, 2177 mSDsCounter, 0 mSdLazyCounter, 2193 mSolverCounterSat, 1621 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3355 SdHoareTripleChecker+Valid, 3595 SdHoareTripleChecker+Invalid, 3814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1621 IncrementalHoareTripleChecker+Valid, 2193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-07-12 12:21:56,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3355 Valid, 3595 Invalid, 3814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1621 Valid, 2193 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2022-07-12 12:21:56,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10197 states. [2022-07-12 12:21:57,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10197 to 8775. [2022-07-12 12:21:57,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8775 states, 6431 states have (on average 1.3276317835484372) internal successors, (8538), 6491 states have internal predecessors, (8538), 1726 states have call successors, (1726), 435 states have call predecessors, (1726), 617 states have return successors, (2913), 1880 states have call predecessors, (2913), 1719 states have call successors, (2913) [2022-07-12 12:21:57,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8775 states to 8775 states and 13177 transitions. [2022-07-12 12:21:57,288 INFO L78 Accepts]: Start accepts. Automaton has 8775 states and 13177 transitions. Word has length 41 [2022-07-12 12:21:57,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:21:57,289 INFO L495 AbstractCegarLoop]: Abstraction has 8775 states and 13177 transitions. [2022-07-12 12:21:57,289 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 12:21:57,290 INFO L276 IsEmpty]: Start isEmpty. Operand 8775 states and 13177 transitions. [2022-07-12 12:21:57,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-12 12:21:57,292 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:21:57,292 INFO L195 NwaCegarLoop]: trace histogram [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:21:57,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 12:21:57,292 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:21:57,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:21:57,293 INFO L85 PathProgramCache]: Analyzing trace with hash -2024702322, now seen corresponding path program 1 times [2022-07-12 12:21:57,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:21:57,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335540835] [2022-07-12 12:21:57,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:21:57,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:21:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:57,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:21:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:57,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:21:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:57,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 12:21:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:57,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 12:21:57,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:21:57,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335540835] [2022-07-12 12:21:57,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335540835] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:21:57,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:21:57,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:21:57,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876583768] [2022-07-12 12:21:57,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:21:57,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:21:57,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:21:57,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:21:57,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:21:57,465 INFO L87 Difference]: Start difference. First operand 8775 states and 13177 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 12:22:01,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:22:01,695 INFO L93 Difference]: Finished difference Result 10165 states and 15561 transitions. [2022-07-12 12:22:01,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 12:22:01,696 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2022-07-12 12:22:01,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:22:01,790 INFO L225 Difference]: With dead ends: 10165 [2022-07-12 12:22:01,803 INFO L226 Difference]: Without dead ends: 10153 [2022-07-12 12:22:01,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 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:22:01,812 INFO L413 NwaCegarLoop]: 1212 mSDtfsCounter, 2192 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 1077 mSolverCounterSat, 992 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2318 SdHoareTripleChecker+Valid, 2233 SdHoareTripleChecker+Invalid, 2069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 992 IncrementalHoareTripleChecker+Valid, 1077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-12 12:22:01,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2318 Valid, 2233 Invalid, 2069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [992 Valid, 1077 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-07-12 12:22:01,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10153 states. [2022-07-12 12:22:02,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10153 to 8765. [2022-07-12 12:22:02,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8765 states, 6422 states have (on average 1.3274680784802242) internal successors, (8525), 6481 states have internal predecessors, (8525), 1725 states have call successors, (1725), 435 states have call predecessors, (1725), 617 states have return successors, (2913), 1880 states have call predecessors, (2913), 1719 states have call successors, (2913) [2022-07-12 12:22:02,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8765 states to 8765 states and 13163 transitions. [2022-07-12 12:22:02,597 INFO L78 Accepts]: Start accepts. Automaton has 8765 states and 13163 transitions. Word has length 42 [2022-07-12 12:22:02,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:22:02,598 INFO L495 AbstractCegarLoop]: Abstraction has 8765 states and 13163 transitions. [2022-07-12 12:22:02,598 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 12:22:02,599 INFO L276 IsEmpty]: Start isEmpty. Operand 8765 states and 13163 transitions. [2022-07-12 12:22:02,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-12 12:22:02,604 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:22:02,604 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:22:02,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 12:22:02,604 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:22:02,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:22:02,617 INFO L85 PathProgramCache]: Analyzing trace with hash -8229079, now seen corresponding path program 1 times [2022-07-12 12:22:02,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:22:02,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456904737] [2022-07-12 12:22:02,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:22:02,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:22:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:02,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:22:02,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:02,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:22:02,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:02,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 12:22:02,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:02,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 12:22:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:02,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 12:22:02,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:02,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 12:22:02,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:02,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:22:02,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:02,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 12:22:02,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:02,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:22:02,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:02,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 12:22:02,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:22:02,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456904737] [2022-07-12 12:22:02,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456904737] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:22:02,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:22:02,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 12:22:02,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559474610] [2022-07-12 12:22:02,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:22:02,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 12:22:02,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:22:02,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 12:22:02,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 12:22:02,998 INFO L87 Difference]: Start difference. First operand 8765 states and 13163 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 12:22:09,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:22:09,773 INFO L93 Difference]: Finished difference Result 21687 states and 33736 transitions. [2022-07-12 12:22:09,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 12:22:09,775 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 88 [2022-07-12 12:22:09,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:22:09,865 INFO L225 Difference]: With dead ends: 21687 [2022-07-12 12:22:09,866 INFO L226 Difference]: Without dead ends: 12936 [2022-07-12 12:22:09,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-07-12 12:22:09,939 INFO L413 NwaCegarLoop]: 1283 mSDtfsCounter, 2711 mSDsluCounter, 2922 mSDsCounter, 0 mSdLazyCounter, 2483 mSolverCounterSat, 1854 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2833 SdHoareTripleChecker+Valid, 4205 SdHoareTripleChecker+Invalid, 4337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1854 IncrementalHoareTripleChecker+Valid, 2483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-07-12 12:22:09,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2833 Valid, 4205 Invalid, 4337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1854 Valid, 2483 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-07-12 12:22:09,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12936 states. [2022-07-12 12:22:10,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12936 to 10735. [2022-07-12 12:22:10,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10735 states, 7852 states have (on average 1.3136780438104942) internal successors, (10315), 7905 states have internal predecessors, (10315), 2063 states have call successors, (2063), 437 states have call predecessors, (2063), 819 states have return successors, (4329), 2428 states have call predecessors, (4329), 2057 states have call successors, (4329) [2022-07-12 12:22:10,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10735 states to 10735 states and 16707 transitions. [2022-07-12 12:22:10,922 INFO L78 Accepts]: Start accepts. Automaton has 10735 states and 16707 transitions. Word has length 88 [2022-07-12 12:22:10,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:22:10,923 INFO L495 AbstractCegarLoop]: Abstraction has 10735 states and 16707 transitions. [2022-07-12 12:22:10,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 12:22:10,923 INFO L276 IsEmpty]: Start isEmpty. Operand 10735 states and 16707 transitions. [2022-07-12 12:22:10,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-12 12:22:10,928 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:22:10,928 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:22:10,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 12:22:10,929 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:22:10,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:22:10,929 INFO L85 PathProgramCache]: Analyzing trace with hash 420567316, now seen corresponding path program 1 times [2022-07-12 12:22:10,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:22:10,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573000983] [2022-07-12 12:22:10,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:22:10,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:22:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:11,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:22:11,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:11,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:22:11,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:11,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 12:22:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:11,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 12:22:11,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:11,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 12:22:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:11,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 12:22:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:11,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 12:22:11,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:11,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:22:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:11,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 12:22:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:11,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:22:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:11,142 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 12:22:11,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:22:11,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573000983] [2022-07-12 12:22:11,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573000983] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:22:11,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:22:11,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 12:22:11,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856471485] [2022-07-12 12:22:11,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:22:11,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 12:22:11,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:22:11,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 12:22:11,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 12:22:11,145 INFO L87 Difference]: Start difference. First operand 10735 states and 16707 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-12 12:22:24,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:22:24,842 INFO L93 Difference]: Finished difference Result 36184 states and 57105 transitions. [2022-07-12 12:22:24,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 12:22:24,859 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 106 [2022-07-12 12:22:24,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:22:25,002 INFO L225 Difference]: With dead ends: 36184 [2022-07-12 12:22:25,003 INFO L226 Difference]: Without dead ends: 25471 [2022-07-12 12:22:25,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2022-07-12 12:22:25,052 INFO L413 NwaCegarLoop]: 2164 mSDtfsCounter, 3878 mSDsluCounter, 5031 mSDsCounter, 0 mSdLazyCounter, 4956 mSolverCounterSat, 3077 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4058 SdHoareTripleChecker+Valid, 7195 SdHoareTripleChecker+Invalid, 8033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3077 IncrementalHoareTripleChecker+Valid, 4956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2022-07-12 12:22:25,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4058 Valid, 7195 Invalid, 8033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3077 Valid, 4956 Invalid, 0 Unknown, 0 Unchecked, 12.3s Time] [2022-07-12 12:22:25,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25471 states. [2022-07-12 12:22:26,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25471 to 21097. [2022-07-12 12:22:26,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21097 states, 15412 states have (on average 1.3101479366727224) internal successors, (20192), 15515 states have internal predecessors, (20192), 4053 states have call successors, (4053), 865 states have call predecessors, (4053), 1631 states have return successors, (8423), 4788 states have call predecessors, (8423), 4047 states have call successors, (8423) [2022-07-12 12:22:26,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21097 states to 21097 states and 32668 transitions. [2022-07-12 12:22:26,208 INFO L78 Accepts]: Start accepts. Automaton has 21097 states and 32668 transitions. Word has length 106 [2022-07-12 12:22:26,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:22:26,208 INFO L495 AbstractCegarLoop]: Abstraction has 21097 states and 32668 transitions. [2022-07-12 12:22:26,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-12 12:22:26,209 INFO L276 IsEmpty]: Start isEmpty. Operand 21097 states and 32668 transitions. [2022-07-12 12:22:26,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-12 12:22:26,215 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:22:26,215 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:26,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 12:22:26,216 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:22:26,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:22:26,216 INFO L85 PathProgramCache]: Analyzing trace with hash -351145482, now seen corresponding path program 1 times [2022-07-12 12:22:26,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:22:26,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442606610] [2022-07-12 12:22:26,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:22:26,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:22:26,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:26,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:22:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:26,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:22:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:26,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 12:22:26,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:26,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 12:22:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:26,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:22:26,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:26,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:22:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:26,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:22:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:26,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 12:22:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:26,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 12:22:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:26,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 12:22:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:26,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:22:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:26,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:22:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:26,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 12:22:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:26,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:22:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:26,505 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-12 12:22:26,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:22:26,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442606610] [2022-07-12 12:22:26,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442606610] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:22:26,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:22:26,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 12:22:26,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407186220] [2022-07-12 12:22:26,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:22:26,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 12:22:26,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:22:26,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 12:22:26,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:22:26,508 INFO L87 Difference]: Start difference. First operand 21097 states and 32668 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 12:22:41,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:22:41,560 INFO L93 Difference]: Finished difference Result 61683 states and 97245 transitions. [2022-07-12 12:22:41,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 12:22:41,562 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 139 [2022-07-12 12:22:41,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:22:41,951 INFO L225 Difference]: With dead ends: 61683 [2022-07-12 12:22:41,952 INFO L226 Difference]: Without dead ends: 40608 [2022-07-12 12:22:42,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2022-07-12 12:22:42,025 INFO L413 NwaCegarLoop]: 2228 mSDtfsCounter, 4332 mSDsluCounter, 4955 mSDsCounter, 0 mSdLazyCounter, 5287 mSolverCounterSat, 3169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4545 SdHoareTripleChecker+Valid, 7183 SdHoareTripleChecker+Invalid, 8456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3169 IncrementalHoareTripleChecker+Valid, 5287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2022-07-12 12:22:42,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4545 Valid, 7183 Invalid, 8456 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3169 Valid, 5287 Invalid, 0 Unknown, 0 Unchecked, 12.8s Time] [2022-07-12 12:22:42,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40608 states. [2022-07-12 12:22:43,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40608 to 31579. [2022-07-12 12:22:43,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31579 states, 23056 states have (on average 1.3092036780013878) internal successors, (30185), 23221 states have internal predecessors, (30185), 6055 states have call successors, (6055), 1293 states have call predecessors, (6055), 2467 states have return successors, (12553), 7172 states have call predecessors, (12553), 6049 states have call successors, (12553) [2022-07-12 12:22:43,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31579 states to 31579 states and 48793 transitions. [2022-07-12 12:22:43,849 INFO L78 Accepts]: Start accepts. Automaton has 31579 states and 48793 transitions. Word has length 139 [2022-07-12 12:22:43,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:22:43,850 INFO L495 AbstractCegarLoop]: Abstraction has 31579 states and 48793 transitions. [2022-07-12 12:22:43,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 12:22:43,850 INFO L276 IsEmpty]: Start isEmpty. Operand 31579 states and 48793 transitions. [2022-07-12 12:22:43,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-12 12:22:43,859 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:22:43,859 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:43,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 12:22:43,859 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:22:43,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:22:43,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1913868486, now seen corresponding path program 1 times [2022-07-12 12:22:43,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:22:43,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016796267] [2022-07-12 12:22:43,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:22:43,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:22:44,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:44,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:22:44,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:44,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:22:44,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:44,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 12:22:44,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:44,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 12:22:44,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:44,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:22:44,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:44,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:22:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:44,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 12:22:44,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:44,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 12:22:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:44,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 12:22:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:44,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 12:22:44,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:44,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 12:22:44,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:44,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 12:22:44,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:44,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:22:44,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:44,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 12:22:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:44,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:22:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:44,331 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 12:22:44,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:22:44,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016796267] [2022-07-12 12:22:44,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016796267] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:22:44,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:22:44,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 12:22:44,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28452666] [2022-07-12 12:22:44,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:22:44,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 12:22:44,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:22:44,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 12:22:44,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-12 12:22:44,333 INFO L87 Difference]: Start difference. First operand 31579 states and 48793 transitions. Second operand has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (19), 9 states have call predecessors, (19), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 12:23:13,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:23:13,024 INFO L93 Difference]: Finished difference Result 115438 states and 201604 transitions. [2022-07-12 12:23:13,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-07-12 12:23:13,025 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (19), 9 states have call predecessors, (19), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 139 [2022-07-12 12:23:13,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:23:13,722 INFO L225 Difference]: With dead ends: 115438 [2022-07-12 12:23:13,722 INFO L226 Difference]: Without dead ends: 83881 [2022-07-12 12:23:13,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=443, Invalid=1537, Unknown=0, NotChecked=0, Total=1980 [2022-07-12 12:23:13,836 INFO L413 NwaCegarLoop]: 2466 mSDtfsCounter, 8806 mSDsluCounter, 10517 mSDsCounter, 0 mSdLazyCounter, 13333 mSolverCounterSat, 9860 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9022 SdHoareTripleChecker+Valid, 12983 SdHoareTripleChecker+Invalid, 23193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 9860 IncrementalHoareTripleChecker+Valid, 13333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.5s IncrementalHoareTripleChecker+Time [2022-07-12 12:23:13,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9022 Valid, 12983 Invalid, 23193 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [9860 Valid, 13333 Invalid, 0 Unknown, 0 Unchecked, 23.5s Time] [2022-07-12 12:23:13,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83881 states. [2022-07-12 12:23:16,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83881 to 34437. [2022-07-12 12:23:16,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34437 states, 24964 states have (on average 1.3055199487261657) internal successors, (32591), 25039 states have internal predecessors, (32591), 6865 states have call successors, (6865), 1293 states have call predecessors, (6865), 2607 states have return successors, (14493), 8224 states have call predecessors, (14493), 6859 states have call successors, (14493) [2022-07-12 12:23:16,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34437 states to 34437 states and 53949 transitions. [2022-07-12 12:23:16,868 INFO L78 Accepts]: Start accepts. Automaton has 34437 states and 53949 transitions. Word has length 139 [2022-07-12 12:23:16,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:23:16,868 INFO L495 AbstractCegarLoop]: Abstraction has 34437 states and 53949 transitions. [2022-07-12 12:23:16,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (19), 9 states have call predecessors, (19), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 12:23:16,868 INFO L276 IsEmpty]: Start isEmpty. Operand 34437 states and 53949 transitions. [2022-07-12 12:23:16,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-07-12 12:23:16,875 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:23:16,875 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:16,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 12:23:16,876 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:23:16,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:23:16,876 INFO L85 PathProgramCache]: Analyzing trace with hash -100167631, now seen corresponding path program 1 times [2022-07-12 12:23:16,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:23:16,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457605873] [2022-07-12 12:23:16,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:23:16,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:23:16,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:17,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:23:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:17,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:23:17,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:17,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 12:23:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:17,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 12:23:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:17,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:23:17,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:17,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:23:17,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:17,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:23:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:17,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 12:23:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:17,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 12:23:17,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:17,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 12:23:17,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:17,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 12:23:17,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:17,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 12:23:17,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:17,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:23:17,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:17,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 12:23:17,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:17,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:23:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:17,199 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 12:23:17,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:23:17,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457605873] [2022-07-12 12:23:17,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457605873] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:23:17,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:23:17,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 12:23:17,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308701293] [2022-07-12 12:23:17,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:23:17,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 12:23:17,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:23:17,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 12:23:17,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-12 12:23:17,201 INFO L87 Difference]: Start difference. First operand 34437 states and 53949 transitions. Second operand has 12 states, 12 states have (on average 8.5) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (19), 9 states have call predecessors, (19), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 12:23:47,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:23:47,200 INFO L93 Difference]: Finished difference Result 118352 states and 206832 transitions. [2022-07-12 12:23:47,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-07-12 12:23:47,202 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.5) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (19), 9 states have call predecessors, (19), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 143 [2022-07-12 12:23:47,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:23:47,671 INFO L225 Difference]: With dead ends: 118352 [2022-07-12 12:23:47,672 INFO L226 Difference]: Without dead ends: 83937 [2022-07-12 12:23:47,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=443, Invalid=1537, Unknown=0, NotChecked=0, Total=1980 [2022-07-12 12:23:47,827 INFO L413 NwaCegarLoop]: 2432 mSDtfsCounter, 8537 mSDsluCounter, 10671 mSDsCounter, 0 mSdLazyCounter, 13306 mSolverCounterSat, 9343 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8742 SdHoareTripleChecker+Valid, 13103 SdHoareTripleChecker+Invalid, 22649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 9343 IncrementalHoareTripleChecker+Valid, 13306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.0s IncrementalHoareTripleChecker+Time [2022-07-12 12:23:47,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8742 Valid, 13103 Invalid, 22649 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [9343 Valid, 13306 Invalid, 0 Unknown, 0 Unchecked, 23.0s Time] [2022-07-12 12:23:47,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83937 states. [2022-07-12 12:23:51,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83937 to 34437. [2022-07-12 12:23:51,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34437 states, 24964 states have (on average 1.3055199487261657) internal successors, (32591), 25039 states have internal predecessors, (32591), 6865 states have call successors, (6865), 1293 states have call predecessors, (6865), 2607 states have return successors, (14493), 8224 states have call predecessors, (14493), 6859 states have call successors, (14493) [2022-07-12 12:23:51,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34437 states to 34437 states and 53949 transitions. [2022-07-12 12:23:51,347 INFO L78 Accepts]: Start accepts. Automaton has 34437 states and 53949 transitions. Word has length 143 [2022-07-12 12:23:51,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:23:51,347 INFO L495 AbstractCegarLoop]: Abstraction has 34437 states and 53949 transitions. [2022-07-12 12:23:51,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.5) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (19), 9 states have call predecessors, (19), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 12:23:51,348 INFO L276 IsEmpty]: Start isEmpty. Operand 34437 states and 53949 transitions. [2022-07-12 12:23:51,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-12 12:23:51,387 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:23:51,388 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:23:51,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 12:23:51,388 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:23:51,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:23:51,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1956184300, now seen corresponding path program 1 times [2022-07-12 12:23:51,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:23:51,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235994735] [2022-07-12 12:23:51,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:23:51,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:23:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:51,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:23:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:51,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:23:51,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:51,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 12:23:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:51,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 12:23:51,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:51,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:23:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:51,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:23:51,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:51,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:23:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:51,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:23:51,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:51,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:23:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:51,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 12:23:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:51,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:23:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:51,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:23:51,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:51,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 12:23:51,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:51,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:23:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:51,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:23:51,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:51,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:23:51,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:51,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 12:23:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:51,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 12:23:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:51,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:23:51,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:51,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 12:23:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:51,801 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-12 12:23:51,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:23:51,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235994735] [2022-07-12 12:23:51,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235994735] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:23:51,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516803155] [2022-07-12 12:23:51,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:23:51,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:23:51,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:23:51,804 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:23:51,805 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:23:52,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:52,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 3514 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 12:23:52,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:23:52,623 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-12 12:23:52,623 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:23:52,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516803155] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:23:52,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:23:52,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-07-12 12:23:52,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2958491] [2022-07-12 12:23:52,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:23:52,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 12:23:52,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:23:52,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 12:23:52,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-07-12 12:23:52,625 INFO L87 Difference]: Start difference. First operand 34437 states and 53949 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 12:23:56,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:23:56,061 INFO L93 Difference]: Finished difference Result 81119 states and 127134 transitions. [2022-07-12 12:23:56,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 12:23:56,061 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 169 [2022-07-12 12:23:56,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:23:56,292 INFO L225 Difference]: With dead ends: 81119 [2022-07-12 12:23:56,293 INFO L226 Difference]: Without dead ends: 46704 [2022-07-12 12:23:56,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-07-12 12:23:56,417 INFO L413 NwaCegarLoop]: 2587 mSDtfsCounter, 1346 mSDsluCounter, 8869 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1363 SdHoareTripleChecker+Valid, 11456 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 12:23:56,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1363 Valid, 11456 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 12:23:56,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46704 states. [2022-07-12 12:23:59,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46704 to 34505. [2022-07-12 12:23:59,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34505 states, 25004 states have (on average 1.3050311950087985) internal successors, (32631), 25083 states have internal predecessors, (32631), 6889 states have call successors, (6889), 1293 states have call predecessors, (6889), 2611 states have return successors, (14533), 8248 states have call predecessors, (14533), 6883 states have call successors, (14533) [2022-07-12 12:23:59,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34505 states to 34505 states and 54053 transitions. [2022-07-12 12:23:59,228 INFO L78 Accepts]: Start accepts. Automaton has 34505 states and 54053 transitions. Word has length 169 [2022-07-12 12:23:59,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:23:59,229 INFO L495 AbstractCegarLoop]: Abstraction has 34505 states and 54053 transitions. [2022-07-12 12:23:59,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 12:23:59,229 INFO L276 IsEmpty]: Start isEmpty. Operand 34505 states and 54053 transitions. [2022-07-12 12:23:59,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-12 12:23:59,231 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:23:59,232 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:23:59,257 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:23:59,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-12 12:23:59,447 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:23:59,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:23:59,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1327665746, now seen corresponding path program 1 times [2022-07-12 12:23:59,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:23:59,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441233792] [2022-07-12 12:23:59,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:23:59,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:23:59,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:59,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:23:59,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:59,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:23:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:59,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 12:23:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:59,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 12:23:59,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:59,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:23:59,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:59,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:23:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:59,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:23:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:59,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:23:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:59,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:23:59,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:59,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 12:23:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:59,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:23:59,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:59,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:23:59,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:59,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 12:23:59,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:59,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:23:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:59,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:23:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:59,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:23:59,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:59,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 12:23:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:59,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 12:23:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:59,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:23:59,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:59,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 12:23:59,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:59,923 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-07-12 12:23:59,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:23:59,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441233792] [2022-07-12 12:23:59,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441233792] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:23:59,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104981887] [2022-07-12 12:23:59,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:23:59,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:23:59,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:23:59,924 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:23:59,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 12:24:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:00,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 3509 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-12 12:24:00,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:24:00,771 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-12 12:24:00,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 12:24:01,209 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-12 12:24:01,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104981887] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 12:24:01,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 12:24:01,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 27 [2022-07-12 12:24:01,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939970844] [2022-07-12 12:24:01,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 12:24:01,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-12 12:24:01,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:24:01,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-12 12:24:01,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2022-07-12 12:24:01,211 INFO L87 Difference]: Start difference. First operand 34505 states and 54053 transitions. Second operand has 27 states, 27 states have (on average 6.222222222222222) internal successors, (168), 14 states have internal predecessors, (168), 4 states have call successors, (44), 8 states have call predecessors, (44), 9 states have return successors, (36), 11 states have call predecessors, (36), 4 states have call successors, (36) [2022-07-12 12:24:23,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:24:23,674 INFO L93 Difference]: Finished difference Result 82976 states and 142537 transitions. [2022-07-12 12:24:23,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 12:24:23,675 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 6.222222222222222) internal successors, (168), 14 states have internal predecessors, (168), 4 states have call successors, (44), 8 states have call predecessors, (44), 9 states have return successors, (36), 11 states have call predecessors, (36), 4 states have call successors, (36) Word has length 169 [2022-07-12 12:24:23,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:24:23,916 INFO L225 Difference]: With dead ends: 82976 [2022-07-12 12:24:23,916 INFO L226 Difference]: Without dead ends: 48445 [2022-07-12 12:24:24,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=195, Invalid=1287, Unknown=0, NotChecked=0, Total=1482 [2022-07-12 12:24:24,086 INFO L413 NwaCegarLoop]: 1171 mSDtfsCounter, 1124 mSDsluCounter, 17492 mSDsCounter, 0 mSdLazyCounter, 12010 mSolverCounterSat, 599 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1233 SdHoareTripleChecker+Valid, 18663 SdHoareTripleChecker+Invalid, 12609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 599 IncrementalHoareTripleChecker+Valid, 12010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.4s IncrementalHoareTripleChecker+Time [2022-07-12 12:24:24,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1233 Valid, 18663 Invalid, 12609 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [599 Valid, 12010 Invalid, 0 Unknown, 0 Unchecked, 18.4s Time] [2022-07-12 12:24:24,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48445 states. [2022-07-12 12:24:26,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48445 to 34841. [2022-07-12 12:24:26,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34841 states, 25244 states have (on average 1.3021311994929488) internal successors, (32871), 25323 states have internal predecessors, (32871), 6913 states have call successors, (6913), 1293 states have call predecessors, (6913), 2683 states have return successors, (14917), 8344 states have call predecessors, (14917), 6907 states have call successors, (14917) [2022-07-12 12:24:27,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34841 states to 34841 states and 54701 transitions. [2022-07-12 12:24:27,091 INFO L78 Accepts]: Start accepts. Automaton has 34841 states and 54701 transitions. Word has length 169 [2022-07-12 12:24:27,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:24:27,091 INFO L495 AbstractCegarLoop]: Abstraction has 34841 states and 54701 transitions. [2022-07-12 12:24:27,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 6.222222222222222) internal successors, (168), 14 states have internal predecessors, (168), 4 states have call successors, (44), 8 states have call predecessors, (44), 9 states have return successors, (36), 11 states have call predecessors, (36), 4 states have call successors, (36) [2022-07-12 12:24:27,091 INFO L276 IsEmpty]: Start isEmpty. Operand 34841 states and 54701 transitions. [2022-07-12 12:24:27,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-07-12 12:24:27,094 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:24:27,094 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:24:27,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 12:24:27,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-12 12:24:27,317 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:24:27,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:24:27,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1028666573, now seen corresponding path program 1 times [2022-07-12 12:24:27,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:24:27,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288404139] [2022-07-12 12:24:27,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:24:27,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:24:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:27,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:24:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:27,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:24:27,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:27,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 12:24:27,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:27,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 12:24:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:27,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:24:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:27,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:24:27,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:27,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:24:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:27,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:24:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:27,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:24:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:27,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:24:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:27,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:24:27,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:27,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 12:24:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:27,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:24:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:27,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:24:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:27,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:24:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:27,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 12:24:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:27,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 12:24:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:27,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:24:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:27,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:24:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:27,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 12:24:27,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:27,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 12:24:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:27,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:24:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:27,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 12:24:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:27,606 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-07-12 12:24:27,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:24:27,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288404139] [2022-07-12 12:24:27,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288404139] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:24:27,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:24:27,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 12:24:27,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702794386] [2022-07-12 12:24:27,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:24:27,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 12:24:27,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:24:27,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 12:24:27,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-12 12:24:27,608 INFO L87 Difference]: Start difference. First operand 34841 states and 54701 transitions. Second operand has 10 states, 10 states have (on average 10.8) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (20), 8 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 12:24:37,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:24:37,315 INFO L93 Difference]: Finished difference Result 83216 states and 142469 transitions. [2022-07-12 12:24:37,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 12:24:37,316 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (20), 8 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 187 [2022-07-12 12:24:37,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:24:37,545 INFO L225 Difference]: With dead ends: 83216 [2022-07-12 12:24:37,546 INFO L226 Difference]: Without dead ends: 48397 [2022-07-12 12:24:37,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-12 12:24:37,703 INFO L413 NwaCegarLoop]: 1177 mSDtfsCounter, 1964 mSDsluCounter, 3650 mSDsCounter, 0 mSdLazyCounter, 2797 mSolverCounterSat, 1402 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2075 SdHoareTripleChecker+Valid, 4827 SdHoareTripleChecker+Invalid, 4199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1402 IncrementalHoareTripleChecker+Valid, 2797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-07-12 12:24:37,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2075 Valid, 4827 Invalid, 4199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1402 Valid, 2797 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-07-12 12:24:37,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48397 states. [2022-07-12 12:24:40,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48397 to 34889. [2022-07-12 12:24:40,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34889 states, 25292 states have (on average 1.301557804839475) internal successors, (32919), 25371 states have internal predecessors, (32919), 6913 states have call successors, (6913), 1293 states have call predecessors, (6913), 2683 states have return successors, (14917), 8344 states have call predecessors, (14917), 6907 states have call successors, (14917) [2022-07-12 12:24:40,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34889 states to 34889 states and 54749 transitions. [2022-07-12 12:24:40,390 INFO L78 Accepts]: Start accepts. Automaton has 34889 states and 54749 transitions. Word has length 187 [2022-07-12 12:24:40,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:24:40,390 INFO L495 AbstractCegarLoop]: Abstraction has 34889 states and 54749 transitions. [2022-07-12 12:24:40,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (20), 8 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 12:24:40,391 INFO L276 IsEmpty]: Start isEmpty. Operand 34889 states and 54749 transitions. [2022-07-12 12:24:40,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-07-12 12:24:40,393 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:24:40,394 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:24:40,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 12:24:40,394 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:24:40,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:24:40,394 INFO L85 PathProgramCache]: Analyzing trace with hash -219059742, now seen corresponding path program 1 times [2022-07-12 12:24:40,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:24:40,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616833424] [2022-07-12 12:24:40,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:24:40,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:24:40,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:40,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:24:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:40,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:24:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:40,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 12:24:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:40,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 12:24:40,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:40,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:24:40,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:40,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:24:40,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:40,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:24:40,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:40,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:24:40,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:40,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 12:24:40,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:40,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:24:40,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:40,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:24:40,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:40,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:24:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:40,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:24:40,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:40,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:24:40,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:40,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:24:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:40,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:24:40,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:40,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 12:24:40,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:40,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 12:24:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:40,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:24:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:40,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:24:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:40,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 12:24:40,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:40,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 12:24:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:40,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:24:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:40,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 12:24:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:40,791 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-07-12 12:24:40,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:24:40,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616833424] [2022-07-12 12:24:40,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616833424] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:24:40,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:24:40,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 12:24:40,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633498150] [2022-07-12 12:24:40,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:24:40,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 12:24:40,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:24:40,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 12:24:40,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-07-12 12:24:40,793 INFO L87 Difference]: Start difference. First operand 34889 states and 54749 transitions. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 4 states have internal predecessors, (115), 3 states have call successors, (21), 8 states have call predecessors, (21), 3 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2022-07-12 12:24:52,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:24:52,819 INFO L93 Difference]: Finished difference Result 83252 states and 139593 transitions. [2022-07-12 12:24:52,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 12:24:52,820 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 4 states have internal predecessors, (115), 3 states have call successors, (21), 8 states have call predecessors, (21), 3 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) Word has length 194 [2022-07-12 12:24:52,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:24:53,039 INFO L225 Difference]: With dead ends: 83252 [2022-07-12 12:24:53,039 INFO L226 Difference]: Without dead ends: 48385 [2022-07-12 12:24:53,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2022-07-12 12:24:53,191 INFO L413 NwaCegarLoop]: 1165 mSDtfsCounter, 2453 mSDsluCounter, 4564 mSDsCounter, 0 mSdLazyCounter, 3383 mSolverCounterSat, 1782 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2561 SdHoareTripleChecker+Valid, 5729 SdHoareTripleChecker+Invalid, 5165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1782 IncrementalHoareTripleChecker+Valid, 3383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-07-12 12:24:53,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2561 Valid, 5729 Invalid, 5165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1782 Valid, 3383 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2022-07-12 12:24:53,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48385 states. [2022-07-12 12:24:55,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48385 to 35009. [2022-07-12 12:24:55,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35009 states, 25388 states have (on average 1.301362848589885) internal successors, (33039), 25443 states have internal predecessors, (33039), 6937 states have call successors, (6937), 1293 states have call predecessors, (6937), 2683 states have return successors, (14941), 8392 states have call predecessors, (14941), 6931 states have call successors, (14941) [2022-07-12 12:24:56,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35009 states to 35009 states and 54917 transitions. [2022-07-12 12:24:56,093 INFO L78 Accepts]: Start accepts. Automaton has 35009 states and 54917 transitions. Word has length 194 [2022-07-12 12:24:56,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:24:56,093 INFO L495 AbstractCegarLoop]: Abstraction has 35009 states and 54917 transitions. [2022-07-12 12:24:56,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 4 states have internal predecessors, (115), 3 states have call successors, (21), 8 states have call predecessors, (21), 3 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2022-07-12 12:24:56,094 INFO L276 IsEmpty]: Start isEmpty. Operand 35009 states and 54917 transitions. [2022-07-12 12:24:56,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-07-12 12:24:56,096 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:24:56,096 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:24:56,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 12:24:56,096 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:24:56,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:24:56,097 INFO L85 PathProgramCache]: Analyzing trace with hash -218637337, now seen corresponding path program 2 times [2022-07-12 12:24:56,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:24:56,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677934979] [2022-07-12 12:24:56,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:24:56,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:24:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:56,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:24:56,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:56,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:24:56,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:56,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 12:24:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:56,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 12:24:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:56,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:24:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:56,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:24:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:56,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:24:56,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:56,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:24:56,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:56,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 12:24:56,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:56,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:24:56,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:56,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:24:56,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:56,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:24:56,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:56,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:24:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:56,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:24:56,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:56,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:24:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:56,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:24:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:56,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 12:24:56,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:56,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 12:24:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:56,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:24:56,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:56,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:24:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:56,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:24:56,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:56,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 12:24:56,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:56,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 12:24:56,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:56,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:24:56,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:56,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 12:24:56,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:56,474 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-07-12 12:24:56,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:24:56,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677934979] [2022-07-12 12:24:56,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677934979] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:24:56,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932483143] [2022-07-12 12:24:56,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 12:24:56,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:24:56,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:24:56,476 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:24:56,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 12:24:57,259 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 12:24:57,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 12:24:57,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 3637 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 12:24:57,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:24:57,301 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-12 12:24:57,301 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:24:57,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932483143] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:24:57,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:24:57,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 14 [2022-07-12 12:24:57,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292738325] [2022-07-12 12:24:57,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:24:57,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 12:24:57,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:24:57,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 12:24:57,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-07-12 12:24:57,306 INFO L87 Difference]: Start difference. First operand 35009 states and 54917 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-12 12:24:59,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:24:59,568 INFO L93 Difference]: Finished difference Result 69808 states and 116951 transitions. [2022-07-12 12:24:59,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 12:24:59,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 200 [2022-07-12 12:24:59,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:24:59,733 INFO L225 Difference]: With dead ends: 69808 [2022-07-12 12:24:59,733 INFO L226 Difference]: Without dead ends: 34770 [2022-07-12 12:24:59,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-07-12 12:24:59,887 INFO L413 NwaCegarLoop]: 1326 mSDtfsCounter, 2 mSDsluCounter, 2649 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3975 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 12:24:59,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3975 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 12:24:59,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34770 states. [2022-07-12 12:25:02,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34770 to 34758. [2022-07-12 12:25:02,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34758 states, 25209 states have (on average 1.2996945535324687) internal successors, (32764), 25252 states have internal predecessors, (32764), 6877 states have call successors, (6877), 1293 states have call predecessors, (6877), 2671 states have return successors, (14857), 8332 states have call predecessors, (14857), 6871 states have call successors, (14857) [2022-07-12 12:25:02,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34758 states to 34758 states and 54498 transitions. [2022-07-12 12:25:02,443 INFO L78 Accepts]: Start accepts. Automaton has 34758 states and 54498 transitions. Word has length 200 [2022-07-12 12:25:02,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:25:02,444 INFO L495 AbstractCegarLoop]: Abstraction has 34758 states and 54498 transitions. [2022-07-12 12:25:02,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-12 12:25:02,444 INFO L276 IsEmpty]: Start isEmpty. Operand 34758 states and 54498 transitions. [2022-07-12 12:25:02,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-07-12 12:25:02,446 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:25:02,446 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:25:02,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 12:25:02,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:25:02,660 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:25:02,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:25:02,660 INFO L85 PathProgramCache]: Analyzing trace with hash 2114587026, now seen corresponding path program 1 times [2022-07-12 12:25:02,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:25:02,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311441428] [2022-07-12 12:25:02,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:25:02,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:25:02,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:02,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:25:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:02,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:25:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:02,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 12:25:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:02,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 12:25:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:02,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:25:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:02,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:25:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:02,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:25:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:02,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:25:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:02,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 12:25:02,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:02,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:25:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:02,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:25:02,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:02,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:25:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:02,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:25:02,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:02,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:25:02,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:02,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:25:02,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:02,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:25:02,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:02,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 12:25:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:02,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 12:25:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:03,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:25:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:03,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:25:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:03,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:25:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:03,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 12:25:03,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:03,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 12:25:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:03,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:25:03,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:03,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 12:25:03,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:03,038 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-07-12 12:25:03,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:25:03,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311441428] [2022-07-12 12:25:03,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311441428] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:25:03,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149031675] [2022-07-12 12:25:03,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:25:03,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:25:03,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:25:03,044 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:25:03,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 12:25:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:03,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 3652 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-12 12:25:03,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:25:03,800 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-07-12 12:25:03,800 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:25:03,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149031675] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:25:03,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:25:03,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 16 [2022-07-12 12:25:03,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582848145] [2022-07-12 12:25:03,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:25:03,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 12:25:03,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:25:03,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 12:25:03,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-07-12 12:25:03,803 INFO L87 Difference]: Start difference. First operand 34758 states and 54498 transitions. Second operand has 6 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-07-12 12:25:06,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:25:06,361 INFO L93 Difference]: Finished difference Result 69717 states and 116579 transitions. [2022-07-12 12:25:06,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 12:25:06,362 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 201 [2022-07-12 12:25:06,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:25:06,496 INFO L225 Difference]: With dead ends: 69717 [2022-07-12 12:25:06,496 INFO L226 Difference]: Without dead ends: 34982 [2022-07-12 12:25:06,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2022-07-12 12:25:06,625 INFO L413 NwaCegarLoop]: 1310 mSDtfsCounter, 5 mSDsluCounter, 5203 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 6513 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 12:25:06,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 6513 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 12:25:06,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34982 states. [2022-07-12 12:25:08,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34982 to 34758. [2022-07-12 12:25:08,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34758 states, 25209 states have (on average 1.298266492125828) internal successors, (32728), 25252 states have internal predecessors, (32728), 6877 states have call successors, (6877), 1293 states have call predecessors, (6877), 2671 states have return successors, (14857), 8332 states have call predecessors, (14857), 6871 states have call successors, (14857) [2022-07-12 12:25:09,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34758 states to 34758 states and 54462 transitions. [2022-07-12 12:25:09,129 INFO L78 Accepts]: Start accepts. Automaton has 34758 states and 54462 transitions. Word has length 201 [2022-07-12 12:25:09,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:25:09,129 INFO L495 AbstractCegarLoop]: Abstraction has 34758 states and 54462 transitions. [2022-07-12 12:25:09,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-07-12 12:25:09,130 INFO L276 IsEmpty]: Start isEmpty. Operand 34758 states and 54462 transitions. [2022-07-12 12:25:09,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-07-12 12:25:09,131 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:25:09,132 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:25:09,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 12:25:09,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-12 12:25:09,334 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:25:09,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:25:09,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1526146375, now seen corresponding path program 1 times [2022-07-12 12:25:09,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:25:09,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945913226] [2022-07-12 12:25:09,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:25:09,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:25:09,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:09,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:25:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:09,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:25:09,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:09,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 12:25:09,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:09,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 12:25:09,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:09,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:25:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:09,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:25:09,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:09,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:25:09,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:09,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:25:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:09,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 12:25:09,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:09,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:25:09,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:09,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:25:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:09,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:25:09,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:09,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:25:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:09,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:25:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:09,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:25:09,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:09,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 12:25:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:09,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 12:25:09,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:09,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:25:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:09,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:25:09,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:09,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:25:09,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:09,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 12:25:09,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:09,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 12:25:09,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:09,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:25:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:09,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 12:25:09,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:09,817 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-12 12:25:09,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:25:09,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945913226] [2022-07-12 12:25:09,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945913226] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:25:09,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279036836] [2022-07-12 12:25:09,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:25:09,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:25:09,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:25:09,819 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:25:09,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 12:25:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:10,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 3627 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-12 12:25:10,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:25:10,631 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-12 12:25:10,631 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:25:10,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279036836] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:25:10,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:25:10,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 20 [2022-07-12 12:25:10,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83472264] [2022-07-12 12:25:10,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:25:10,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 12:25:10,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:25:10,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 12:25:10,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2022-07-12 12:25:10,633 INFO L87 Difference]: Start difference. First operand 34758 states and 54462 transitions. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 5 states have internal predecessors, (123), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 12:25:13,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:25:13,177 INFO L93 Difference]: Finished difference Result 69709 states and 116475 transitions. [2022-07-12 12:25:13,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 12:25:13,177 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 5 states have internal predecessors, (123), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) Word has length 195 [2022-07-12 12:25:13,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:25:13,317 INFO L225 Difference]: With dead ends: 69709 [2022-07-12 12:25:13,317 INFO L226 Difference]: Without dead ends: 34974 [2022-07-12 12:25:13,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 236 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2022-07-12 12:25:13,437 INFO L413 NwaCegarLoop]: 1332 mSDtfsCounter, 5 mSDsluCounter, 5313 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 6645 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 12:25:13,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 6645 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 12:25:13,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34974 states. [2022-07-12 12:25:15,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34974 to 34830. [2022-07-12 12:25:15,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34830 states, 25281 states have (on average 1.297417032554092) internal successors, (32800), 25300 states have internal predecessors, (32800), 6877 states have call successors, (6877), 1293 states have call predecessors, (6877), 2671 states have return successors, (14857), 8356 states have call predecessors, (14857), 6871 states have call successors, (14857) [2022-07-12 12:25:15,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34830 states to 34830 states and 54534 transitions. [2022-07-12 12:25:15,846 INFO L78 Accepts]: Start accepts. Automaton has 34830 states and 54534 transitions. Word has length 195 [2022-07-12 12:25:15,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:25:15,847 INFO L495 AbstractCegarLoop]: Abstraction has 34830 states and 54534 transitions. [2022-07-12 12:25:15,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 5 states have internal predecessors, (123), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 12:25:15,847 INFO L276 IsEmpty]: Start isEmpty. Operand 34830 states and 54534 transitions. [2022-07-12 12:25:15,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-07-12 12:25:15,849 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:25:15,849 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:25:15,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 12:25:16,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:25:16,050 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:25:16,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:25:16,050 INFO L85 PathProgramCache]: Analyzing trace with hash 661547710, now seen corresponding path program 2 times [2022-07-12 12:25:16,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:25:16,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570661245] [2022-07-12 12:25:16,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:25:16,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:25:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:16,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:25:16,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:16,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:25:16,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:16,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 12:25:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:16,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 12:25:16,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:16,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:25:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:16,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:25:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:16,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:25:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:16,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:25:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:16,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 12:25:16,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:16,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:25:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:16,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:25:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:16,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:25:16,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:16,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:25:16,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:16,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:25:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:16,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:25:16,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:16,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 12:25:16,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:16,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:25:16,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:16,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 12:25:16,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:16,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:25:16,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:16,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:25:16,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:16,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:25:16,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:16,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 12:25:16,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:16,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 12:25:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:16,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:25:16,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:16,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 12:25:16,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:16,875 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-07-12 12:25:16,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:25:16,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570661245] [2022-07-12 12:25:16,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570661245] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:25:16,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529992390] [2022-07-12 12:25:16,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 12:25:16,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:25:16,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:25:16,888 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:25:16,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 12:25:18,114 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 12:25:18,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 12:25:18,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 3653 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-12 12:25:18,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:25:18,204 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-12 12:25:18,205 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:25:18,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529992390] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:25:18,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:25:18,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 17 [2022-07-12 12:25:18,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419084663] [2022-07-12 12:25:18,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:25:18,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 12:25:18,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:25:18,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 12:25:18,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-07-12 12:25:18,207 INFO L87 Difference]: Start difference. First operand 34830 states and 54534 transitions. Second operand has 11 states, 11 states have (on average 11.545454545454545) internal successors, (127), 8 states have internal predecessors, (127), 2 states have call successors, (22), 2 states have call predecessors, (22), 5 states have return successors, (23), 5 states have call predecessors, (23), 2 states have call successors, (23)