./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--media--usb--ttusb-dec--ttusb_dec.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--media--usb--ttusb-dec--ttusb_dec.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 1848e360a16ec6531e7d7aea690ab68ac7295c6b0bdec191a41fa9ee0518b66d --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 12:23:39,596 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 12:23:39,598 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 12:23:39,639 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 12:23:39,639 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 12:23:39,641 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 12:23:39,643 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 12:23:39,648 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 12:23:39,650 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 12:23:39,654 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 12:23:39,655 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 12:23:39,657 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 12:23:39,657 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 12:23:39,659 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 12:23:39,660 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 12:23:39,664 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 12:23:39,664 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 12:23:39,665 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 12:23:39,667 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 12:23:39,670 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 12:23:39,672 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 12:23:39,673 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 12:23:39,674 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 12:23:39,675 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 12:23:39,676 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 12:23:39,683 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 12:23:39,684 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 12:23:39,684 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 12:23:39,685 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 12:23:39,686 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 12:23:39,688 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 12:23:39,688 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 12:23:39,689 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 12:23:39,690 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 12:23:39,691 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 12:23:39,691 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 12:23:39,692 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 12:23:39,692 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 12:23:39,692 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 12:23:39,692 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 12:23:39,693 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 12:23:39,695 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 12:23:39,696 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:23:39,726 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 12:23:39,727 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 12:23:39,727 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 12:23:39,727 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 12:23:39,728 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 12:23:39,728 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 12:23:39,728 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 12:23:39,729 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 12:23:39,729 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 12:23:39,730 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 12:23:39,730 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 12:23:39,730 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 12:23:39,730 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 12:23:39,730 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 12:23:39,730 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 12:23:39,731 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 12:23:39,731 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 12:23:39,731 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 12:23:39,731 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 12:23:39,731 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 12:23:39,733 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 12:23:39,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 12:23:39,733 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 12:23:39,733 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 12:23:39,733 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 12:23:39,733 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 12:23:39,734 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 12:23:39,734 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 12:23:39,734 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 12:23:39,734 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 12:23:39,734 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 -> 1848e360a16ec6531e7d7aea690ab68ac7295c6b0bdec191a41fa9ee0518b66d [2022-07-12 12:23:40,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 12:23:40,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 12:23:40,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 12:23:40,049 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 12:23:40,049 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 12:23:40,050 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--media--usb--ttusb-dec--ttusb_dec.ko-entry_point.cil.out.i [2022-07-12 12:23:40,086 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dc024d83/d87cc2a660c34fbb899ace5ba59857b1/FLAG32ff72049 [2022-07-12 12:23:40,680 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 12:23:40,681 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--media--usb--ttusb-dec--ttusb_dec.ko-entry_point.cil.out.i [2022-07-12 12:23:40,715 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dc024d83/d87cc2a660c34fbb899ace5ba59857b1/FLAG32ff72049 [2022-07-12 12:23:40,865 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dc024d83/d87cc2a660c34fbb899ace5ba59857b1 [2022-07-12 12:23:40,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 12:23:40,868 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 12:23:40,870 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 12:23:40,870 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 12:23:40,873 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 12:23:40,873 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 12:23:40" (1/1) ... [2022-07-12 12:23:40,874 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4134d738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:23:40, skipping insertion in model container [2022-07-12 12:23:40,874 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 12:23:40" (1/1) ... [2022-07-12 12:23:40,879 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 12:23:40,969 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 12:23:41,568 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--media--usb--ttusb-dec--ttusb_dec.ko-entry_point.cil.out.i[196736,196749] [2022-07-12 12:23:42,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 12:23:42,092 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 12:23:42,176 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--media--usb--ttusb-dec--ttusb_dec.ko-entry_point.cil.out.i[196736,196749] [2022-07-12 12:23:42,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 12:23:42,316 INFO L208 MainTranslator]: Completed translation [2022-07-12 12:23:42,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:23:42 WrapperNode [2022-07-12 12:23:42,317 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 12:23:42,318 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 12:23:42,318 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 12:23:42,319 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 12:23:42,324 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:23:42" (1/1) ... [2022-07-12 12:23:42,372 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:23:42" (1/1) ... [2022-07-12 12:23:42,477 INFO L137 Inliner]: procedures = 201, calls = 1494, calls flagged for inlining = 91, calls inlined = 86, statements flattened = 2632 [2022-07-12 12:23:42,477 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 12:23:42,478 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 12:23:42,478 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 12:23:42,478 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 12:23:42,484 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:23:42" (1/1) ... [2022-07-12 12:23:42,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:23:42" (1/1) ... [2022-07-12 12:23:42,509 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:23:42" (1/1) ... [2022-07-12 12:23:42,510 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:23:42" (1/1) ... [2022-07-12 12:23:42,607 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:23:42" (1/1) ... [2022-07-12 12:23:42,625 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:23:42" (1/1) ... [2022-07-12 12:23:42,658 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:23:42" (1/1) ... [2022-07-12 12:23:42,684 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 12:23:42,685 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 12:23:42,685 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 12:23:42,685 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 12:23:42,686 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:23:42" (1/1) ... [2022-07-12 12:23:42,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 12:23:42,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:23:42,709 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:23:42,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 12:23:42,761 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2022-07-12 12:23:42,761 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2022-07-12 12:23:42,762 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_free_iso_urbs [2022-07-12 12:23:42,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_free_iso_urbs [2022-07-12 12:23:42,762 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_12 [2022-07-12 12:23:42,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_12 [2022-07-12 12:23:42,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 12:23:42,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 12:23:42,762 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 12:23:42,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 12:23:42,763 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_init_dvb [2022-07-12 12:23:42,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_init_dvb [2022-07-12 12:23:42,763 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_interface [2022-07-12 12:23:42,763 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_interface [2022-07-12 12:23:42,763 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2022-07-12 12:23:42,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2022-07-12 12:23:42,767 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_unregister_adapter [2022-07-12 12:23:42,767 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_unregister_adapter [2022-07-12 12:23:42,767 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 12:23:42,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 12:23:42,767 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_start_sec_feed [2022-07-12 12:23:42,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_start_sec_feed [2022-07-12 12:23:42,768 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2022-07-12 12:23:42,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2022-07-12 12:23:42,768 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_interruptible_nested [2022-07-12 12:23:42,768 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_interruptible_nested [2022-07-12 12:23:42,768 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_start_iso_xfer [2022-07-12 12:23:42,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_start_iso_xfer [2022-07-12 12:23:42,769 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-12 12:23:42,769 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-12 12:23:42,769 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-12 12:23:42,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-12 12:23:42,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-12 12:23:42,769 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-12 12:23:42,769 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 12:23:42,769 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 12:23:42,770 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_dmx_release [2022-07-12 12:23:42,770 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_dmx_release [2022-07-12 12:23:42,770 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2022-07-12 12:23:42,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2022-07-12 12:23:42,770 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-12 12:23:42,770 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-12 12:23:42,770 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_process_urb [2022-07-12 12:23:42,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_process_urb [2022-07-12 12:23:42,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 12:23:42,771 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2022-07-12 12:23:42,771 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2022-07-12 12:23:42,771 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-07-12 12:23:42,771 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-07-12 12:23:42,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 12:23:42,772 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-12 12:23:42,772 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-12 12:23:42,773 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_start_feed [2022-07-12 12:23:42,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_start_feed [2022-07-12 12:23:42,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 12:23:42,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 12:23:42,773 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_probe [2022-07-12 12:23:42,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_probe [2022-07-12 12:23:42,774 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2022-07-12 12:23:42,774 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2022-07-12 12:23:42,774 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2022-07-12 12:23:42,775 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2022-07-12 12:23:42,775 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_start_ts_feed [2022-07-12 12:23:42,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_start_ts_feed [2022-07-12 12:23:42,775 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-12 12:23:42,775 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-12 12:23:42,775 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-12 12:23:42,776 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-12 12:23:42,776 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-07-12 12:23:42,776 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-07-12 12:23:42,776 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_exit_dvb [2022-07-12 12:23:42,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_exit_dvb [2022-07-12 12:23:42,777 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2022-07-12 12:23:42,777 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2022-07-12 12:23:42,777 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_set_model [2022-07-12 12:23:42,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_set_model [2022-07-12 12:23:42,777 INFO L130 BoogieDeclarations]: Found specification of procedure release_firmware [2022-07-12 12:23:42,778 INFO L138 BoogieDeclarations]: Found implementation of procedure release_firmware [2022-07-12 12:23:42,778 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_key [2022-07-12 12:23:42,778 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_key [2022-07-12 12:23:42,778 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_stop_iso_xfer [2022-07-12 12:23:42,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_stop_iso_xfer [2022-07-12 12:23:42,778 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_filter_pes2ts_init [2022-07-12 12:23:42,778 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_filter_pes2ts_init [2022-07-12 12:23:42,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-12 12:23:42,779 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-12 12:23:42,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-12 12:23:42,779 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2022-07-12 12:23:42,779 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2022-07-12 12:23:42,779 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-12 12:23:42,779 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-12 12:23:42,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 12:23:42,780 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_3 [2022-07-12 12:23:42,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_3 [2022-07-12 12:23:42,780 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_4 [2022-07-12 12:23:42,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_4 [2022-07-12 12:23:42,781 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_2 [2022-07-12 12:23:42,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_2 [2022-07-12 12:23:42,781 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_7 [2022-07-12 12:23:42,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_7 [2022-07-12 12:23:42,782 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~X~$Pointer$~X~int~TO~int [2022-07-12 12:23:42,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~X~$Pointer$~X~int~TO~int [2022-07-12 12:23:42,783 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2022-07-12 12:23:42,783 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2022-07-12 12:23:42,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 12:23:42,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-12 12:23:42,783 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-12 12:23:42,783 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-12 12:23:42,783 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-12 12:23:42,783 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-12 12:23:42,784 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-12 12:23:42,784 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-12 12:23:42,784 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-12 12:23:42,784 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2022-07-12 12:23:42,784 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2022-07-12 12:23:42,785 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_send_command [2022-07-12 12:23:42,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_send_command [2022-07-12 12:23:42,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 12:23:42,785 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_setup_urbs [2022-07-12 12:23:42,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_setup_urbs [2022-07-12 12:23:42,787 INFO L130 BoogieDeclarations]: Found specification of procedure input_sync [2022-07-12 12:23:42,787 INFO L138 BoogieDeclarations]: Found implementation of procedure input_sync [2022-07-12 12:23:42,787 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 12:23:42,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 12:23:42,788 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_set_pids [2022-07-12 12:23:42,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_set_pids [2022-07-12 12:23:42,788 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_exit_usb [2022-07-12 12:23:42,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_exit_usb [2022-07-12 12:23:42,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 12:23:42,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 12:23:42,789 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-12 12:23:42,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-12 12:23:42,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 12:23:42,790 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 12:23:42,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 12:23:42,790 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-12 12:23:42,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-12 12:23:42,790 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_init_rc [2022-07-12 12:23:42,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_init_rc [2022-07-12 12:23:42,791 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_dmxdev_release [2022-07-12 12:23:42,791 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_dmxdev_release [2022-07-12 12:23:42,791 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-12 12:23:42,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-12 12:23:42,791 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_disconnect [2022-07-12 12:23:42,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_disconnect [2022-07-12 12:23:42,791 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_handle_irq [2022-07-12 12:23:42,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_handle_irq [2022-07-12 12:23:42,792 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2022-07-12 12:23:42,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2022-07-12 12:23:42,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 12:23:42,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 12:23:42,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 12:23:43,314 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 12:23:43,317 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 12:23:43,556 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 12:23:47,593 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2022-07-12 12:23:47,799 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 12:23:47,809 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 12:23:47,809 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 12:23:47,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:23:47 BoogieIcfgContainer [2022-07-12 12:23:47,811 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 12:23:47,813 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 12:23:47,813 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 12:23:47,815 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 12:23:47,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 12:23:40" (1/3) ... [2022-07-12 12:23:47,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@733ab947 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 12:23:47, skipping insertion in model container [2022-07-12 12:23:47,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:23:42" (2/3) ... [2022-07-12 12:23:47,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@733ab947 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 12:23:47, skipping insertion in model container [2022-07-12 12:23:47,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:23:47" (3/3) ... [2022-07-12 12:23:47,817 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-entry_point.cil.out.i [2022-07-12 12:23:47,826 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 12:23:47,827 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 12:23:47,868 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 12:23:47,873 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@6ea154c4, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@393c6282 [2022-07-12 12:23:47,873 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 12:23:47,878 INFO L276 IsEmpty]: Start isEmpty. Operand has 1076 states, 777 states have (on average 1.3384813384813385) internal successors, (1040), 804 states have internal predecessors, (1040), 231 states have call successors, (231), 68 states have call predecessors, (231), 66 states have return successors, (225), 217 states have call predecessors, (225), 225 states have call successors, (225) [2022-07-12 12:23:47,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-12 12:23:47,885 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:23:47,886 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,886 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:23:47,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:23:47,889 INFO L85 PathProgramCache]: Analyzing trace with hash 303000669, now seen corresponding path program 1 times [2022-07-12 12:23:47,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:23:47,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203778664] [2022-07-12 12:23:47,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:23:47,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:23:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:48,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:23:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:48,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:23:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:48,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:23:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:48,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:23:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:48,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:23:48,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:48,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 12:23:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:48,418 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-12 12:23:48,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:23:48,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203778664] [2022-07-12 12:23:48,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203778664] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:23:48,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:23:48,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:23:48,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150614446] [2022-07-12 12:23:48,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:23:48,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:23:48,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:23:48,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:23:48,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:23:48,451 INFO L87 Difference]: Start difference. First operand has 1076 states, 777 states have (on average 1.3384813384813385) internal successors, (1040), 804 states have internal predecessors, (1040), 231 states have call successors, (231), 68 states have call predecessors, (231), 66 states have return successors, (225), 217 states have call predecessors, (225), 225 states have call successors, (225) Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-12 12:23:51,555 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:23:55,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:23:55,555 INFO L93 Difference]: Finished difference Result 3572 states and 5251 transitions. [2022-07-12 12:23:55,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:23:55,557 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 52 [2022-07-12 12:23:55,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:23:55,582 INFO L225 Difference]: With dead ends: 3572 [2022-07-12 12:23:55,582 INFO L226 Difference]: Without dead ends: 2475 [2022-07-12 12:23:55,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:23:55,592 INFO L413 NwaCegarLoop]: 1643 mSDtfsCounter, 2971 mSDsluCounter, 2366 mSDsCounter, 0 mSdLazyCounter, 1923 mSolverCounterSat, 1415 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3133 SdHoareTripleChecker+Valid, 4009 SdHoareTripleChecker+Invalid, 3339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1415 IncrementalHoareTripleChecker+Valid, 1923 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-07-12 12:23:55,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3133 Valid, 4009 Invalid, 3339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1415 Valid, 1923 Invalid, 1 Unknown, 0 Unchecked, 6.8s Time] [2022-07-12 12:23:55,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2022-07-12 12:23:55,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 2044. [2022-07-12 12:23:55,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2044 states, 1490 states have (on average 1.3187919463087248) internal successors, (1965), 1524 states have internal predecessors, (1965), 424 states have call successors, (424), 130 states have call predecessors, (424), 129 states have return successors, (419), 403 states have call predecessors, (419), 419 states have call successors, (419) [2022-07-12 12:23:55,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 2808 transitions. [2022-07-12 12:23:55,715 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 2808 transitions. Word has length 52 [2022-07-12 12:23:55,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:23:55,716 INFO L495 AbstractCegarLoop]: Abstraction has 2044 states and 2808 transitions. [2022-07-12 12:23:55,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-12 12:23:55,717 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 2808 transitions. [2022-07-12 12:23:55,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-12 12:23:55,723 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:23:55,723 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 12:23:55,724 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:23:55,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:23:55,724 INFO L85 PathProgramCache]: Analyzing trace with hash 2056314414, now seen corresponding path program 1 times [2022-07-12 12:23:55,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:23:55,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175073248] [2022-07-12 12:23:55,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:23:55,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:23:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:55,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:23:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:55,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:23:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:55,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:23:55,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:55,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:23:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:55,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:23:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:55,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 12:23:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:55,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 12:23:55,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:23:55,944 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-12 12:23:55,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:23:55,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175073248] [2022-07-12 12:23:55,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175073248] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:23:55,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:23:55,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:23:55,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881642518] [2022-07-12 12:23:55,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:23:55,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:23:55,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:23:55,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:23:55,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:23:55,947 INFO L87 Difference]: Start difference. First operand 2044 states and 2808 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, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-12 12:23:58,464 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:24:02,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:24:02,775 INFO L93 Difference]: Finished difference Result 3656 states and 5220 transitions. [2022-07-12 12:24:02,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:24:02,775 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, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 62 [2022-07-12 12:24:02,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:24:02,793 INFO L225 Difference]: With dead ends: 3656 [2022-07-12 12:24:02,794 INFO L226 Difference]: Without dead ends: 3643 [2022-07-12 12:24:02,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 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:24:02,797 INFO L413 NwaCegarLoop]: 1543 mSDtfsCounter, 3006 mSDsluCounter, 2200 mSDsCounter, 0 mSdLazyCounter, 1824 mSolverCounterSat, 1405 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3175 SdHoareTripleChecker+Valid, 3743 SdHoareTripleChecker+Invalid, 3230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1405 IncrementalHoareTripleChecker+Valid, 1824 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-07-12 12:24:02,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3175 Valid, 3743 Invalid, 3230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1405 Valid, 1824 Invalid, 1 Unknown, 0 Unchecked, 6.6s Time] [2022-07-12 12:24:02,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3643 states. [2022-07-12 12:24:02,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3643 to 2986. [2022-07-12 12:24:02,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2986 states, 2174 states have (on average 1.3164673413063477) internal successors, (2862), 2223 states have internal predecessors, (2862), 619 states have call successors, (619), 193 states have call predecessors, (619), 192 states have return successors, (614), 590 states have call predecessors, (614), 614 states have call successors, (614) [2022-07-12 12:24:02,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2986 states to 2986 states and 4095 transitions. [2022-07-12 12:24:02,909 INFO L78 Accepts]: Start accepts. Automaton has 2986 states and 4095 transitions. Word has length 62 [2022-07-12 12:24:02,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:24:02,909 INFO L495 AbstractCegarLoop]: Abstraction has 2986 states and 4095 transitions. [2022-07-12 12:24:02,909 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, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-12 12:24:02,910 INFO L276 IsEmpty]: Start isEmpty. Operand 2986 states and 4095 transitions. [2022-07-12 12:24:02,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-12 12:24:02,912 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:24:02,912 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 12:24:02,912 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:24:02,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:24:02,913 INFO L85 PathProgramCache]: Analyzing trace with hash 2113572716, now seen corresponding path program 1 times [2022-07-12 12:24:02,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:24:02,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958844575] [2022-07-12 12:24:02,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:24:02,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:24:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:03,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:24:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:03,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:24:03,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:03,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:24:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:03,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:24:03,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:03,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:24:03,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:03,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 12:24:03,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:03,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 12:24:03,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:03,163 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-12 12:24:03,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:24:03,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958844575] [2022-07-12 12:24:03,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958844575] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:24:03,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:24:03,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:24:03,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188527845] [2022-07-12 12:24:03,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:24:03,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:24:03,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:24:03,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:24:03,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:24:03,168 INFO L87 Difference]: Start difference. First operand 2986 states and 4095 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, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-12 12:24:05,675 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:24:09,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:24:09,802 INFO L93 Difference]: Finished difference Result 10161 states and 14863 transitions. [2022-07-12 12:24:09,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:24:09,802 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, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 62 [2022-07-12 12:24:09,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:24:09,865 INFO L225 Difference]: With dead ends: 10161 [2022-07-12 12:24:09,865 INFO L226 Difference]: Without dead ends: 7197 [2022-07-12 12:24:09,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 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:24:09,887 INFO L413 NwaCegarLoop]: 1671 mSDtfsCounter, 3025 mSDsluCounter, 2484 mSDsCounter, 0 mSdLazyCounter, 1926 mSolverCounterSat, 1383 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3165 SdHoareTripleChecker+Valid, 4155 SdHoareTripleChecker+Invalid, 3310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1383 IncrementalHoareTripleChecker+Valid, 1926 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-07-12 12:24:09,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3165 Valid, 4155 Invalid, 3310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1383 Valid, 1926 Invalid, 1 Unknown, 0 Unchecked, 6.3s Time] [2022-07-12 12:24:09,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7197 states. [2022-07-12 12:24:10,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7197 to 6331. [2022-07-12 12:24:10,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6331 states, 4588 states have (on average 1.305797733217088) internal successors, (5991), 4709 states have internal predecessors, (5991), 1263 states have call successors, (1263), 383 states have call predecessors, (1263), 479 states have return successors, (1666), 1274 states have call predecessors, (1666), 1258 states have call successors, (1666) [2022-07-12 12:24:10,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6331 states to 6331 states and 8920 transitions. [2022-07-12 12:24:10,165 INFO L78 Accepts]: Start accepts. Automaton has 6331 states and 8920 transitions. Word has length 62 [2022-07-12 12:24:10,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:24:10,166 INFO L495 AbstractCegarLoop]: Abstraction has 6331 states and 8920 transitions. [2022-07-12 12:24:10,166 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, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-12 12:24:10,167 INFO L276 IsEmpty]: Start isEmpty. Operand 6331 states and 8920 transitions. [2022-07-12 12:24:10,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-12 12:24:10,168 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:24:10,168 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 12:24:10,168 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:24:10,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:24:10,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1095762274, now seen corresponding path program 1 times [2022-07-12 12:24:10,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:24:10,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355401187] [2022-07-12 12:24:10,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:24:10,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:24:10,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:10,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:24:10,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:10,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:24:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:10,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:24:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:10,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:24:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:10,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:24:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:10,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 12:24:10,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:10,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 12:24:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:10,383 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-12 12:24:10,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:24:10,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355401187] [2022-07-12 12:24:10,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355401187] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:24:10,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:24:10,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:24:10,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777576491] [2022-07-12 12:24:10,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:24:10,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:24:10,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:24:10,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:24:10,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:24:10,387 INFO L87 Difference]: Start difference. First operand 6331 states and 8920 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-12 12:24:12,876 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:24:17,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:24:17,008 INFO L93 Difference]: Finished difference Result 7186 states and 10506 transitions. [2022-07-12 12:24:17,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:24:17,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 63 [2022-07-12 12:24:17,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:24:17,044 INFO L225 Difference]: With dead ends: 7186 [2022-07-12 12:24:17,044 INFO L226 Difference]: Without dead ends: 7183 [2022-07-12 12:24:17,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 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:24:17,050 INFO L413 NwaCegarLoop]: 1535 mSDtfsCounter, 2970 mSDsluCounter, 2182 mSDsCounter, 0 mSdLazyCounter, 1836 mSolverCounterSat, 1392 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3131 SdHoareTripleChecker+Valid, 3717 SdHoareTripleChecker+Invalid, 3229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1392 IncrementalHoareTripleChecker+Valid, 1836 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-07-12 12:24:17,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3131 Valid, 3717 Invalid, 3229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1392 Valid, 1836 Invalid, 1 Unknown, 0 Unchecked, 6.4s Time] [2022-07-12 12:24:17,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7183 states. [2022-07-12 12:24:17,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7183 to 6330. [2022-07-12 12:24:17,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6330 states, 4588 states have (on average 1.3055797733217087) internal successors, (5990), 4708 states have internal predecessors, (5990), 1262 states have call successors, (1262), 383 states have call predecessors, (1262), 479 states have return successors, (1666), 1274 states have call predecessors, (1666), 1258 states have call successors, (1666) [2022-07-12 12:24:17,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6330 states to 6330 states and 8918 transitions. [2022-07-12 12:24:17,331 INFO L78 Accepts]: Start accepts. Automaton has 6330 states and 8918 transitions. Word has length 63 [2022-07-12 12:24:17,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:24:17,333 INFO L495 AbstractCegarLoop]: Abstraction has 6330 states and 8918 transitions. [2022-07-12 12:24:17,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-12 12:24:17,334 INFO L276 IsEmpty]: Start isEmpty. Operand 6330 states and 8918 transitions. [2022-07-12 12:24:17,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-12 12:24:17,335 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:24:17,335 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 12:24:17,335 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:24:17,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:24:17,336 INFO L85 PathProgramCache]: Analyzing trace with hash -391585489, now seen corresponding path program 1 times [2022-07-12 12:24:17,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:24:17,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906124326] [2022-07-12 12:24:17,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:24:17,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:24:17,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:17,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:24:17,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:17,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:24:17,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:17,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:24:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:17,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:24:17,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:17,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:24:17,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:17,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 12:24:17,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:17,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 12:24:17,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:17,522 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-12 12:24:17,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:24:17,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906124326] [2022-07-12 12:24:17,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906124326] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:24:17,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:24:17,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:24:17,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384451190] [2022-07-12 12:24:17,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:24:17,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:24:17,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:24:17,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:24:17,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:24:17,525 INFO L87 Difference]: Start difference. First operand 6330 states and 8918 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-12 12:24:20,036 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:24:24,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:24:24,165 INFO L93 Difference]: Finished difference Result 7185 states and 10504 transitions. [2022-07-12 12:24:24,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:24:24,165 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 64 [2022-07-12 12:24:24,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:24:24,203 INFO L225 Difference]: With dead ends: 7185 [2022-07-12 12:24:24,203 INFO L226 Difference]: Without dead ends: 7182 [2022-07-12 12:24:24,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 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:24:24,209 INFO L413 NwaCegarLoop]: 1532 mSDtfsCounter, 2981 mSDsluCounter, 2167 mSDsCounter, 0 mSdLazyCounter, 1823 mSolverCounterSat, 1404 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3141 SdHoareTripleChecker+Valid, 3699 SdHoareTripleChecker+Invalid, 3228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1404 IncrementalHoareTripleChecker+Valid, 1823 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-07-12 12:24:24,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3141 Valid, 3699 Invalid, 3228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1404 Valid, 1823 Invalid, 1 Unknown, 0 Unchecked, 6.4s Time] [2022-07-12 12:24:24,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7182 states. [2022-07-12 12:24:24,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7182 to 6329. [2022-07-12 12:24:24,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6329 states, 4588 states have (on average 1.3053618134263296) internal successors, (5989), 4707 states have internal predecessors, (5989), 1261 states have call successors, (1261), 383 states have call predecessors, (1261), 479 states have return successors, (1666), 1274 states have call predecessors, (1666), 1258 states have call successors, (1666) [2022-07-12 12:24:24,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6329 states to 6329 states and 8916 transitions. [2022-07-12 12:24:24,413 INFO L78 Accepts]: Start accepts. Automaton has 6329 states and 8916 transitions. Word has length 64 [2022-07-12 12:24:24,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:24:24,414 INFO L495 AbstractCegarLoop]: Abstraction has 6329 states and 8916 transitions. [2022-07-12 12:24:24,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-12 12:24:24,415 INFO L276 IsEmpty]: Start isEmpty. Operand 6329 states and 8916 transitions. [2022-07-12 12:24:24,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-12 12:24:24,415 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:24:24,415 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 12:24:24,416 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:24:24,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:24:24,416 INFO L85 PathProgramCache]: Analyzing trace with hash 745278981, now seen corresponding path program 1 times [2022-07-12 12:24:24,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:24:24,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71455421] [2022-07-12 12:24:24,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:24:24,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:24:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:24,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:24:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:24,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:24:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:24,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:24:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:24,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:24:24,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:24,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:24:24,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:24,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 12:24:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:24,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 12:24:24,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:24,671 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-12 12:24:24,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:24:24,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71455421] [2022-07-12 12:24:24,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71455421] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:24:24,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:24:24,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:24:24,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110644008] [2022-07-12 12:24:24,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:24:24,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:24:24,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:24:24,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:24:24,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:24:24,674 INFO L87 Difference]: Start difference. First operand 6329 states and 8916 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-12 12:24:27,206 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:24:31,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:24:31,086 INFO L93 Difference]: Finished difference Result 7184 states and 10502 transitions. [2022-07-12 12:24:31,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:24:31,086 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 65 [2022-07-12 12:24:31,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:24:31,122 INFO L225 Difference]: With dead ends: 7184 [2022-07-12 12:24:31,123 INFO L226 Difference]: Without dead ends: 7181 [2022-07-12 12:24:31,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 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:24:31,125 INFO L413 NwaCegarLoop]: 1510 mSDtfsCounter, 2997 mSDsluCounter, 2167 mSDsCounter, 0 mSdLazyCounter, 1810 mSolverCounterSat, 1406 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3158 SdHoareTripleChecker+Valid, 3677 SdHoareTripleChecker+Invalid, 3217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1406 IncrementalHoareTripleChecker+Valid, 1810 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-07-12 12:24:31,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3158 Valid, 3677 Invalid, 3217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1406 Valid, 1810 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2022-07-12 12:24:31,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7181 states. [2022-07-12 12:24:31,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7181 to 6328. [2022-07-12 12:24:31,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6328 states, 4588 states have (on average 1.3051438535309503) internal successors, (5988), 4706 states have internal predecessors, (5988), 1260 states have call successors, (1260), 383 states have call predecessors, (1260), 479 states have return successors, (1666), 1274 states have call predecessors, (1666), 1258 states have call successors, (1666) [2022-07-12 12:24:31,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6328 states to 6328 states and 8914 transitions. [2022-07-12 12:24:31,331 INFO L78 Accepts]: Start accepts. Automaton has 6328 states and 8914 transitions. Word has length 65 [2022-07-12 12:24:31,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:24:31,332 INFO L495 AbstractCegarLoop]: Abstraction has 6328 states and 8914 transitions. [2022-07-12 12:24:31,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-12 12:24:31,333 INFO L276 IsEmpty]: Start isEmpty. Operand 6328 states and 8914 transitions. [2022-07-12 12:24:31,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-12 12:24:31,333 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:24:31,334 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 12:24:31,334 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:24:31,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:24:31,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1628344050, now seen corresponding path program 1 times [2022-07-12 12:24:31,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:24:31,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258373874] [2022-07-12 12:24:31,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:24:31,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:24:31,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:31,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:24:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:31,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:24:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:31,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:24:31,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:31,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:24:31,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:31,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:24:31,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:31,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 12:24:31,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:31,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 12:24:31,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:31,486 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-12 12:24:31,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:24:31,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258373874] [2022-07-12 12:24:31,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258373874] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:24:31,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:24:31,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:24:31,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028065961] [2022-07-12 12:24:31,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:24:31,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:24:31,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:24:31,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:24:31,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:24:31,488 INFO L87 Difference]: Start difference. First operand 6328 states and 8914 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-12 12:24:33,964 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:24:37,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:24:37,710 INFO L93 Difference]: Finished difference Result 7183 states and 10500 transitions. [2022-07-12 12:24:37,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:24:37,710 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 66 [2022-07-12 12:24:37,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:24:37,739 INFO L225 Difference]: With dead ends: 7183 [2022-07-12 12:24:37,739 INFO L226 Difference]: Without dead ends: 7171 [2022-07-12 12:24:37,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 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:24:37,744 INFO L413 NwaCegarLoop]: 1519 mSDtfsCounter, 2976 mSDsluCounter, 2159 mSDsCounter, 0 mSdLazyCounter, 1817 mSolverCounterSat, 1398 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3137 SdHoareTripleChecker+Valid, 3678 SdHoareTripleChecker+Invalid, 3216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1398 IncrementalHoareTripleChecker+Valid, 1817 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-07-12 12:24:37,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3137 Valid, 3678 Invalid, 3216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1398 Valid, 1817 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2022-07-12 12:24:37,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7171 states. [2022-07-12 12:24:37,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7171 to 6318. [2022-07-12 12:24:37,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6318 states, 4579 states have (on average 1.305088447259227) internal successors, (5976), 4696 states have internal predecessors, (5976), 1259 states have call successors, (1259), 383 states have call predecessors, (1259), 479 states have return successors, (1666), 1274 states have call predecessors, (1666), 1258 states have call successors, (1666) [2022-07-12 12:24:37,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6318 states to 6318 states and 8901 transitions. [2022-07-12 12:24:37,987 INFO L78 Accepts]: Start accepts. Automaton has 6318 states and 8901 transitions. Word has length 66 [2022-07-12 12:24:37,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:24:37,988 INFO L495 AbstractCegarLoop]: Abstraction has 6318 states and 8901 transitions. [2022-07-12 12:24:37,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-12 12:24:37,988 INFO L276 IsEmpty]: Start isEmpty. Operand 6318 states and 8901 transitions. [2022-07-12 12:24:37,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-07-12 12:24:37,997 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:24:37,997 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 12:24:37,998 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:24:37,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:24:37,998 INFO L85 PathProgramCache]: Analyzing trace with hash -878887734, now seen corresponding path program 1 times [2022-07-12 12:24:37,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:24:37,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540535504] [2022-07-12 12:24:37,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:24:37,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:24:38,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:38,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:24:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:38,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:24:38,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:38,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:24:38,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:38,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:24:38,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:38,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:24:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:38,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 12:24:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:38,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:24:38,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:38,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:24:38,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:38,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:24:38,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:38,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:24:38,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:38,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:24:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:38,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 12:24:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:38,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 12:24:38,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:38,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 12:24:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:38,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 12:24:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:38,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 12:24:38,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:38,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 12:24:38,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:38,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 12:24:38,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:38,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 12:24:38,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:38,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 12:24:38,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:38,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:24:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:38,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:24:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:38,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 12:24:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:38,328 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-12 12:24:38,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:24:38,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540535504] [2022-07-12 12:24:38,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540535504] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:24:38,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:24:38,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 12:24:38,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476944458] [2022-07-12 12:24:38,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:24:38,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 12:24:38,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:24:38,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 12:24:38,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-12 12:24:38,331 INFO L87 Difference]: Start difference. First operand 6318 states and 8901 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (24), 8 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-12 12:24:41,598 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:24:45,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:24:45,756 INFO L93 Difference]: Finished difference Result 15572 states and 22875 transitions. [2022-07-12 12:24:45,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 12:24:45,757 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (24), 8 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 173 [2022-07-12 12:24:45,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:24:45,787 INFO L225 Difference]: With dead ends: 15572 [2022-07-12 12:24:45,787 INFO L226 Difference]: Without dead ends: 9276 [2022-07-12 12:24:45,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2022-07-12 12:24:45,810 INFO L413 NwaCegarLoop]: 1345 mSDtfsCounter, 2275 mSDsluCounter, 3181 mSDsCounter, 0 mSdLazyCounter, 2900 mSolverCounterSat, 1487 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2391 SdHoareTripleChecker+Valid, 4526 SdHoareTripleChecker+Invalid, 4388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1487 IncrementalHoareTripleChecker+Valid, 2900 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-07-12 12:24:45,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2391 Valid, 4526 Invalid, 4388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1487 Valid, 2900 Invalid, 1 Unknown, 0 Unchecked, 6.9s Time] [2022-07-12 12:24:45,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9276 states. [2022-07-12 12:24:46,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9276 to 7472. [2022-07-12 12:24:46,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7472 states, 5377 states have (on average 1.2955179468104892) internal successors, (6966), 5497 states have internal predecessors, (6966), 1455 states have call successors, (1455), 420 states have call predecessors, (1455), 639 states have return successors, (2228), 1590 states have call predecessors, (2228), 1454 states have call successors, (2228) [2022-07-12 12:24:46,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7472 states to 7472 states and 10649 transitions. [2022-07-12 12:24:46,110 INFO L78 Accepts]: Start accepts. Automaton has 7472 states and 10649 transitions. Word has length 173 [2022-07-12 12:24:46,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:24:46,111 INFO L495 AbstractCegarLoop]: Abstraction has 7472 states and 10649 transitions. [2022-07-12 12:24:46,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (24), 8 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-12 12:24:46,111 INFO L276 IsEmpty]: Start isEmpty. Operand 7472 states and 10649 transitions. [2022-07-12 12:24:46,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-07-12 12:24:46,116 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:24:46,116 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:24:46,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 12:24:46,116 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:24:46,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:24:46,117 INFO L85 PathProgramCache]: Analyzing trace with hash 2055648344, now seen corresponding path program 1 times [2022-07-12 12:24:46,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:24:46,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144863515] [2022-07-12 12:24:46,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:24:46,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:24:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:46,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:24:46,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:46,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:24:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:46,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:24:46,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:46,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:24:46,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:46,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:24:46,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:46,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 12:24:46,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:46,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 12:24:46,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:46,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 12:24:46,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:46,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:24:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:46,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:24:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:46,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:24:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:46,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:24:46,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:46,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 12:24:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:46,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 12:24:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:46,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 12:24:46,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:46,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 12:24:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:46,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 12:24:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:46,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 12:24:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:46,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 12:24:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:46,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 12:24:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:46,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 12:24:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:46,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:24:46,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:46,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:24:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:24:46,502 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-07-12 12:24:46,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:24:46,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144863515] [2022-07-12 12:24:46,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144863515] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:24:46,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:24:46,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 12:24:46,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596106537] [2022-07-12 12:24:46,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:24:46,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 12:24:46,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:24:46,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 12:24:46,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-07-12 12:24:46,505 INFO L87 Difference]: Start difference. First operand 7472 states and 10649 transitions. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 4 states have internal predecessors, (103), 4 states have call successors, (24), 8 states have call predecessors, (24), 2 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) [2022-07-12 12:24:49,673 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:24:58,166 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:25:03,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:25:03,652 INFO L93 Difference]: Finished difference Result 19562 states and 30825 transitions. [2022-07-12 12:25:03,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-12 12:25:03,653 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 4 states have internal predecessors, (103), 4 states have call successors, (24), 8 states have call predecessors, (24), 2 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) Word has length 182 [2022-07-12 12:25:03,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:25:03,690 INFO L225 Difference]: With dead ends: 19562 [2022-07-12 12:25:03,690 INFO L226 Difference]: Without dead ends: 9216 [2022-07-12 12:25:03,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=248, Invalid=874, Unknown=0, NotChecked=0, Total=1122 [2022-07-12 12:25:03,737 INFO L413 NwaCegarLoop]: 2362 mSDtfsCounter, 6752 mSDsluCounter, 6244 mSDsCounter, 0 mSdLazyCounter, 7212 mSolverCounterSat, 4309 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7046 SdHoareTripleChecker+Valid, 8606 SdHoareTripleChecker+Invalid, 11523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4309 IncrementalHoareTripleChecker+Valid, 7212 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2022-07-12 12:25:03,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7046 Valid, 8606 Invalid, 11523 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4309 Valid, 7212 Invalid, 2 Unknown, 0 Unchecked, 16.2s Time] [2022-07-12 12:25:03,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9216 states. [2022-07-12 12:25:04,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9216 to 7422. [2022-07-12 12:25:04,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7422 states, 5327 states have (on average 1.2459170264689319) internal successors, (6637), 5447 states have internal predecessors, (6637), 1455 states have call successors, (1455), 420 states have call predecessors, (1455), 639 states have return successors, (2228), 1590 states have call predecessors, (2228), 1454 states have call successors, (2228) [2022-07-12 12:25:04,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7422 states to 7422 states and 10320 transitions. [2022-07-12 12:25:04,043 INFO L78 Accepts]: Start accepts. Automaton has 7422 states and 10320 transitions. Word has length 182 [2022-07-12 12:25:04,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:25:04,043 INFO L495 AbstractCegarLoop]: Abstraction has 7422 states and 10320 transitions. [2022-07-12 12:25:04,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 4 states have internal predecessors, (103), 4 states have call successors, (24), 8 states have call predecessors, (24), 2 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) [2022-07-12 12:25:04,044 INFO L276 IsEmpty]: Start isEmpty. Operand 7422 states and 10320 transitions. [2022-07-12 12:25:04,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-07-12 12:25:04,048 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:25:04,048 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:25:04,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 12:25:04,049 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:25:04,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:25:04,049 INFO L85 PathProgramCache]: Analyzing trace with hash 333645658, now seen corresponding path program 1 times [2022-07-12 12:25:04,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:25:04,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282108795] [2022-07-12 12:25:04,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:25:04,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:25:04,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:04,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:25:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:04,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:25:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:04,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:25:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:04,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:25:04,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:04,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:25:04,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:04,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 12:25:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:04,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 12:25:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:04,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 12:25:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:04,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:25:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:04,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:25:04,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:04,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:25:04,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:04,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:25:04,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:04,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 12:25:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:04,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 12:25:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:04,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 12:25:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:04,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 12:25:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:04,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 12:25:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:04,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 12:25:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:04,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 12:25:04,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:04,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 12:25:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:04,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 12:25:04,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:04,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:25:04,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:04,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:25:04,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:04,465 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-07-12 12:25:04,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:25:04,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282108795] [2022-07-12 12:25:04,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282108795] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:25:04,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:25:04,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 12:25:04,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778293634] [2022-07-12 12:25:04,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:25:04,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 12:25:04,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:25:04,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 12:25:04,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-07-12 12:25:04,467 INFO L87 Difference]: Start difference. First operand 7422 states and 10320 transitions. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 4 states have internal predecessors, (103), 4 states have call successors, (24), 8 states have call predecessors, (24), 2 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) [2022-07-12 12:25:07,599 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:25:15,862 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:25:25,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:25:25,222 INFO L93 Difference]: Finished difference Result 19409 states and 28983 transitions. [2022-07-12 12:25:25,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-12 12:25:25,222 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 4 states have internal predecessors, (103), 4 states have call successors, (24), 8 states have call predecessors, (24), 2 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) Word has length 182 [2022-07-12 12:25:25,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:25:25,271 INFO L225 Difference]: With dead ends: 19409 [2022-07-12 12:25:25,271 INFO L226 Difference]: Without dead ends: 9158 [2022-07-12 12:25:25,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=289, Invalid=1043, Unknown=0, NotChecked=0, Total=1332 [2022-07-12 12:25:25,305 INFO L413 NwaCegarLoop]: 2389 mSDtfsCounter, 4687 mSDsluCounter, 7324 mSDsCounter, 0 mSdLazyCounter, 8909 mSolverCounterSat, 2531 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4969 SdHoareTripleChecker+Valid, 9713 SdHoareTripleChecker+Invalid, 11442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2531 IncrementalHoareTripleChecker+Valid, 8909 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.7s IncrementalHoareTripleChecker+Time [2022-07-12 12:25:25,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4969 Valid, 9713 Invalid, 11442 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2531 Valid, 8909 Invalid, 2 Unknown, 0 Unchecked, 19.7s Time] [2022-07-12 12:25:25,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9158 states. [2022-07-12 12:25:25,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9158 to 7292. [2022-07-12 12:25:25,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7292 states, 5212 states have (on average 1.2432847275518035) internal successors, (6480), 5336 states have internal predecessors, (6480), 1439 states have call successors, (1439), 439 states have call predecessors, (1439), 640 states have return successors, (2165), 1554 states have call predecessors, (2165), 1438 states have call successors, (2165) [2022-07-12 12:25:25,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7292 states to 7292 states and 10084 transitions. [2022-07-12 12:25:25,862 INFO L78 Accepts]: Start accepts. Automaton has 7292 states and 10084 transitions. Word has length 182 [2022-07-12 12:25:25,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:25:25,862 INFO L495 AbstractCegarLoop]: Abstraction has 7292 states and 10084 transitions. [2022-07-12 12:25:25,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 4 states have internal predecessors, (103), 4 states have call successors, (24), 8 states have call predecessors, (24), 2 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) [2022-07-12 12:25:25,863 INFO L276 IsEmpty]: Start isEmpty. Operand 7292 states and 10084 transitions. [2022-07-12 12:25:25,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2022-07-12 12:25:25,871 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:25:25,871 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 12:25:25,872 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:25:25,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:25:25,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1756662636, now seen corresponding path program 1 times [2022-07-12 12:25:25,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:25:25,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740827385] [2022-07-12 12:25:25,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:25:25,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:25:25,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:26,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:25:26,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:26,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:25:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:26,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:25:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:26,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:25:26,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:26,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:25:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:26,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 12:25:26,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:26,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 12:25:26,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:26,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 12:25:26,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:26,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:25:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:26,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:25:26,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:26,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:25:26,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:26,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:25:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:26,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 12:25:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:26,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 12:25:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:26,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 12:25:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:26,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 12:25:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:26,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 12:25:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:26,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 12:25:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:26,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 12:25:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:26,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 12:25:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:26,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 12:25:26,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:26,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:25:26,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:26,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 12:25:26,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:26,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 12:25:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:26,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:25:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:26,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:25:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:26,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 12:25:26,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:26,342 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-12 12:25:26,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:25:26,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740827385] [2022-07-12 12:25:26,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740827385] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:25:26,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:25:26,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 12:25:26,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567378156] [2022-07-12 12:25:26,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:25:26,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 12:25:26,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:25:26,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 12:25:26,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-12 12:25:26,344 INFO L87 Difference]: Start difference. First operand 7292 states and 10084 transitions. Second operand has 9 states, 9 states have (on average 15.222222222222221) internal successors, (137), 3 states have internal predecessors, (137), 3 states have call successors, (28), 8 states have call predecessors, (28), 2 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2022-07-12 12:25:29,121 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:25:31,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:25:31,993 INFO L93 Difference]: Finished difference Result 14248 states and 20624 transitions. [2022-07-12 12:25:31,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 12:25:31,994 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.222222222222221) internal successors, (137), 3 states have internal predecessors, (137), 3 states have call successors, (28), 8 states have call predecessors, (28), 2 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) Word has length 227 [2022-07-12 12:25:31,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:25:32,017 INFO L225 Difference]: With dead ends: 14248 [2022-07-12 12:25:32,017 INFO L226 Difference]: Without dead ends: 6616 [2022-07-12 12:25:32,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-07-12 12:25:32,037 INFO L413 NwaCegarLoop]: 747 mSDtfsCounter, 1732 mSDsluCounter, 1259 mSDsCounter, 0 mSdLazyCounter, 1660 mSolverCounterSat, 1020 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1819 SdHoareTripleChecker+Valid, 2006 SdHoareTripleChecker+Invalid, 2681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1020 IncrementalHoareTripleChecker+Valid, 1660 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-07-12 12:25:32,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1819 Valid, 2006 Invalid, 2681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1020 Valid, 1660 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2022-07-12 12:25:32,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6616 states. [2022-07-12 12:25:32,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6616 to 4994. [2022-07-12 12:25:32,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4994 states, 3541 states have (on average 1.2157582603784243) internal successors, (4305), 3620 states have internal predecessors, (4305), 902 states have call successors, (902), 373 states have call predecessors, (902), 550 states have return successors, (1449), 1026 states have call predecessors, (1449), 901 states have call successors, (1449) [2022-07-12 12:25:32,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4994 states to 4994 states and 6656 transitions. [2022-07-12 12:25:32,320 INFO L78 Accepts]: Start accepts. Automaton has 4994 states and 6656 transitions. Word has length 227 [2022-07-12 12:25:32,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:25:32,320 INFO L495 AbstractCegarLoop]: Abstraction has 4994 states and 6656 transitions. [2022-07-12 12:25:32,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.222222222222221) internal successors, (137), 3 states have internal predecessors, (137), 3 states have call successors, (28), 8 states have call predecessors, (28), 2 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2022-07-12 12:25:32,321 INFO L276 IsEmpty]: Start isEmpty. Operand 4994 states and 6656 transitions. [2022-07-12 12:25:32,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-07-12 12:25:32,328 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:25:32,328 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 12:25:32,328 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:25:32,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:25:32,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1517578895, now seen corresponding path program 1 times [2022-07-12 12:25:32,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:25:32,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104666736] [2022-07-12 12:25:32,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:25:32,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:25:32,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:32,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:25:32,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:32,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:25:32,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:32,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:25:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:32,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:25:32,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:32,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:25:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:32,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 12:25:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:32,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 12:25:32,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:32,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 12:25:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:32,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:25:32,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:32,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 12:25:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:32,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 12:25:32,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:32,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:25:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:32,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:25:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:32,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:25:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:32,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:25:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:32,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:25:32,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:32,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 12:25:32,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:32,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 12:25:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:32,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:25:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:32,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:25:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:32,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:25:32,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:32,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:25:32,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:32,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:25:32,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:32,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 12:25:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:32,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 12:25:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:32,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:25:32,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:33,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:25:33,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:33,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 12:25:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:33,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:25:33,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:33,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 12:25:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:33,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 12:25:33,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:33,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 12:25:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:33,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-12 12:25:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:33,054 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-07-12 12:25:33,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:25:33,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104666736] [2022-07-12 12:25:33,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104666736] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:25:33,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:25:33,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-12 12:25:33,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586230275] [2022-07-12 12:25:33,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:25:33,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 12:25:33,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:25:33,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 12:25:33,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-07-12 12:25:33,056 INFO L87 Difference]: Start difference. First operand 4994 states and 6656 transitions. Second operand has 13 states, 13 states have (on average 13.23076923076923) internal successors, (172), 4 states have internal predecessors, (172), 3 states have call successors, (34), 11 states have call predecessors, (34), 2 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2022-07-12 12:25:36,670 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:25:40,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:25:40,146 INFO L93 Difference]: Finished difference Result 12609 states and 18300 transitions. [2022-07-12 12:25:40,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 12:25:40,146 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 13.23076923076923) internal successors, (172), 4 states have internal predecessors, (172), 3 states have call successors, (34), 11 states have call predecessors, (34), 2 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) Word has length 268 [2022-07-12 12:25:40,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:25:40,171 INFO L225 Difference]: With dead ends: 12609 [2022-07-12 12:25:40,172 INFO L226 Difference]: Without dead ends: 7641 [2022-07-12 12:25:40,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=474, Unknown=0, NotChecked=0, Total=650 [2022-07-12 12:25:40,185 INFO L413 NwaCegarLoop]: 793 mSDtfsCounter, 2022 mSDsluCounter, 2111 mSDsCounter, 0 mSdLazyCounter, 2946 mSolverCounterSat, 1274 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2056 SdHoareTripleChecker+Valid, 2904 SdHoareTripleChecker+Invalid, 4221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1274 IncrementalHoareTripleChecker+Valid, 2946 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-07-12 12:25:40,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2056 Valid, 2904 Invalid, 4221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1274 Valid, 2946 Invalid, 1 Unknown, 0 Unchecked, 6.5s Time] [2022-07-12 12:25:40,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7641 states. [2022-07-12 12:25:40,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7641 to 5139. [2022-07-12 12:25:40,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5139 states, 3669 states have (on average 1.2210411556282366) internal successors, (4480), 3738 states have internal predecessors, (4480), 943 states have call successors, (943), 417 states have call predecessors, (943), 526 states have return successors, (1310), 1014 states have call predecessors, (1310), 942 states have call successors, (1310) [2022-07-12 12:25:40,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5139 states to 5139 states and 6733 transitions. [2022-07-12 12:25:40,524 INFO L78 Accepts]: Start accepts. Automaton has 5139 states and 6733 transitions. Word has length 268 [2022-07-12 12:25:40,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:25:40,524 INFO L495 AbstractCegarLoop]: Abstraction has 5139 states and 6733 transitions. [2022-07-12 12:25:40,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 13.23076923076923) internal successors, (172), 4 states have internal predecessors, (172), 3 states have call successors, (34), 11 states have call predecessors, (34), 2 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2022-07-12 12:25:40,525 INFO L276 IsEmpty]: Start isEmpty. Operand 5139 states and 6733 transitions. [2022-07-12 12:25:40,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2022-07-12 12:25:40,536 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:25:40,536 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 12:25:40,537 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:25:40,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:25:40,537 INFO L85 PathProgramCache]: Analyzing trace with hash -953087407, now seen corresponding path program 1 times [2022-07-12 12:25:40,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:25:40,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502764995] [2022-07-12 12:25:40,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:25:40,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:25:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:40,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:25:40,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:40,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:25:40,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:40,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:25:40,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:40,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:25:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:40,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:25:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:40,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 12:25:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:40,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 12:25:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:40,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 12:25:40,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:40,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:25:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:40,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:25:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:40,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:25:40,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:40,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:25:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:40,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 12:25:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:40,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:25:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:40,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 12:25:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:40,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 12:25:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:40,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 12:25:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:40,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:25:40,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:40,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:25:40,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:40,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:25:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:40,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:25:40,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:40,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:25:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:41,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 12:25:41,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:41,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 12:25:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:41,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:25:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:41,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:25:41,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:41,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:25:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:41,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:25:41,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:41,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:25:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:41,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 12:25:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:41,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 12:25:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:41,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:25:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:41,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:25:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:41,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 12:25:41,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:41,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:25:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:41,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 12:25:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:41,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 12:25:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:41,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 12:25:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:41,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-12 12:25:41,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:41,263 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-07-12 12:25:41,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:25:41,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502764995] [2022-07-12 12:25:41,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502764995] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:25:41,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516078734] [2022-07-12 12:25:41,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:25:41,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:25:41,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:25:41,265 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:25:41,268 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:25:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:42,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 3679 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 12:25:42,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:25:42,158 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-07-12 12:25:42,159 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:25:42,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516078734] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:25:42,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:25:42,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2022-07-12 12:25:42,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129191073] [2022-07-12 12:25:42,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:25:42,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 12:25:42,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:25:42,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 12:25:42,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-07-12 12:25:42,161 INFO L87 Difference]: Start difference. First operand 5139 states and 6733 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2022-07-12 12:25:42,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:25:42,389 INFO L93 Difference]: Finished difference Result 10279 states and 13925 transitions. [2022-07-12 12:25:42,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 12:25:42,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 316 [2022-07-12 12:25:42,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:25:42,403 INFO L225 Difference]: With dead ends: 10279 [2022-07-12 12:25:42,404 INFO L226 Difference]: Without dead ends: 5166 [2022-07-12 12:25:42,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-07-12 12:25:42,413 INFO L413 NwaCegarLoop]: 821 mSDtfsCounter, 2 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 12:25:42,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1638 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 12:25:42,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2022-07-12 12:25:42,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 5145. [2022-07-12 12:25:42,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5145 states, 3675 states have (on average 1.2206802721088434) internal successors, (4486), 3744 states have internal predecessors, (4486), 943 states have call successors, (943), 417 states have call predecessors, (943), 526 states have return successors, (1310), 1014 states have call predecessors, (1310), 942 states have call successors, (1310) [2022-07-12 12:25:42,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5145 states to 5145 states and 6739 transitions. [2022-07-12 12:25:42,628 INFO L78 Accepts]: Start accepts. Automaton has 5145 states and 6739 transitions. Word has length 316 [2022-07-12 12:25:42,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:25:42,629 INFO L495 AbstractCegarLoop]: Abstraction has 5145 states and 6739 transitions. [2022-07-12 12:25:42,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2022-07-12 12:25:42,629 INFO L276 IsEmpty]: Start isEmpty. Operand 5145 states and 6739 transitions. [2022-07-12 12:25:42,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2022-07-12 12:25:42,637 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:25:42,637 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,663 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:25:42,853 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:25:42,854 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:25:42,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:25:42,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1543928242, now seen corresponding path program 1 times [2022-07-12 12:25:42,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:25:42,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764943462] [2022-07-12 12:25:42,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:25:42,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:25:42,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:42,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:25:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:43,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:25:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:43,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:25:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:43,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:25:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:43,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:25:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:43,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 12:25:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:43,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 12:25:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:43,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 12:25:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:43,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:25:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:43,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:25:43,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:43,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:25:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:43,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:25:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:43,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 12:25:43,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:43,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:25:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:43,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 12:25:43,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:43,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 12:25:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:43,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 12:25:43,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:43,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 12:25:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:43,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:25:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:43,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:25:43,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:43,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:25:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:43,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 12:25:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:43,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 12:25:43,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:43,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 12:25:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:43,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 12:25:43,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:43,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:25:43,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:43,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:25:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:43,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:25:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:43,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:25:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:43,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:25:43,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:43,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 12:25:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:43,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 12:25:43,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:43,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:25:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:43,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:25:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:43,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 12:25:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:43,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:25:43,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:43,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 12:25:43,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:43,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 12:25:43,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:43,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 12:25:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:43,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-12 12:25:43,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:43,676 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-12 12:25:43,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:25:43,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764943462] [2022-07-12 12:25:43,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764943462] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:25:43,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990729799] [2022-07-12 12:25:43,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:25:43,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:25:43,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:25:43,700 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:25:43,719 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:25:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:25:44,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 3713 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 12:25:44,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:25:44,733 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-07-12 12:25:44,733 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:25:44,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990729799] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:25:44,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:25:44,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2022-07-12 12:25:44,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399942699] [2022-07-12 12:25:44,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:25:44,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:25:44,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:25:44,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:25:44,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-07-12 12:25:44,737 INFO L87 Difference]: Start difference. First operand 5145 states and 6739 transitions. Second operand has 5 states, 5 states have (on average 41.8) internal successors, (209), 4 states have internal predecessors, (209), 2 states have call successors, (41), 2 states have call predecessors, (41), 3 states have return successors, (40), 3 states have call predecessors, (40), 2 states have call successors, (40) [2022-07-12 12:25:44,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:25:44,877 INFO L93 Difference]: Finished difference Result 5760 states and 7511 transitions. [2022-07-12 12:25:44,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:25:44,877 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.8) internal successors, (209), 4 states have internal predecessors, (209), 2 states have call successors, (41), 2 states have call predecessors, (41), 3 states have return successors, (40), 3 states have call predecessors, (40), 2 states have call successors, (40) Word has length 324 [2022-07-12 12:25:44,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:25:44,879 INFO L225 Difference]: With dead ends: 5760 [2022-07-12 12:25:44,879 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 12:25:44,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 395 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2022-07-12 12:25:44,886 INFO L413 NwaCegarLoop]: 366 mSDtfsCounter, 170 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 12:25:44,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 1284 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 12:25:44,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 12:25:44,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 12:25:44,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 12:25:44,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 12:25:44,888 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 324 [2022-07-12 12:25:44,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:25:44,888 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 12:25:44,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.8) internal successors, (209), 4 states have internal predecessors, (209), 2 states have call successors, (41), 2 states have call predecessors, (41), 3 states have return successors, (40), 3 states have call predecessors, (40), 2 states have call successors, (40) [2022-07-12 12:25:44,889 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 12:25:44,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 12:25:44,891 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 12:25:44,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-12 12:25:45,107 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:25:45,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-12 12:26:28,063 WARN L233 SmtUtils]: Spent 6.39s on a formula simplification. DAG size of input: 71 DAG size of output: 67 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-12 12:26:34,554 WARN L233 SmtUtils]: Spent 6.48s on a formula simplification. DAG size of input: 71 DAG size of output: 67 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-12 12:26:41,346 WARN L233 SmtUtils]: Spent 6.79s on a formula simplification. DAG size of input: 71 DAG size of output: 67 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-12 12:26:48,239 WARN L233 SmtUtils]: Spent 6.36s on a formula simplification. DAG size of input: 71 DAG size of output: 67 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-12 12:26:58,879 WARN L233 SmtUtils]: Spent 6.81s on a formula simplification. DAG size of input: 71 DAG size of output: 67 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or)