./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--at76c50x-usb.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.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--at76c50x-usb.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 d88455bf5089be24833f69dfcbd91003e7e136bcd5efcd63ae18e59d7f59e87d --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 12:37:49,572 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 12:37:49,574 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 12:37:49,608 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 12:37:49,609 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 12:37:49,610 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 12:37:49,611 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 12:37:49,613 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 12:37:49,614 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 12:37:49,618 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 12:37:49,618 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 12:37:49,620 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 12:37:49,620 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 12:37:49,621 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 12:37:49,622 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 12:37:49,625 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 12:37:49,625 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 12:37:49,626 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 12:37:49,629 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 12:37:49,633 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 12:37:49,634 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 12:37:49,635 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 12:37:49,636 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 12:37:49,637 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 12:37:49,638 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 12:37:49,642 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 12:37:49,643 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 12:37:49,643 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 12:37:49,644 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 12:37:49,644 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 12:37:49,645 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 12:37:49,645 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 12:37:49,646 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 12:37:49,647 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 12:37:49,647 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 12:37:49,648 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 12:37:49,648 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 12:37:49,649 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 12:37:49,650 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 12:37:49,650 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 12:37:49,650 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 12:37:49,651 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 12:37:49,651 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:37:49,681 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 12:37:49,682 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 12:37:49,682 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 12:37:49,682 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 12:37:49,682 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 12:37:49,683 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 12:37:49,683 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 12:37:49,683 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 12:37:49,683 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 12:37:49,684 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 12:37:49,684 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 12:37:49,684 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 12:37:49,685 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 12:37:49,685 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 12:37:49,685 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 12:37:49,685 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 12:37:49,685 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 12:37:49,685 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 12:37:49,685 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 12:37:49,686 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 12:37:49,686 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 12:37:49,686 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 12:37:49,686 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 12:37:49,686 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 12:37:49,686 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 12:37:49,687 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 12:37:49,687 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 12:37:49,687 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 12:37:49,687 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 12:37:49,687 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 12:37:49,687 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 -> d88455bf5089be24833f69dfcbd91003e7e136bcd5efcd63ae18e59d7f59e87d [2022-07-12 12:37:49,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 12:37:49,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 12:37:49,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 12:37:49,880 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 12:37:49,881 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 12:37:49,882 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--at76c50x-usb.ko-entry_point.cil.out.i [2022-07-12 12:37:49,936 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d75325f51/f1cd6929ab56401ebc013be8b87b801a/FLAGa06dfb4b0 [2022-07-12 12:37:50,498 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 12:37:50,499 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--at76c50x-usb.ko-entry_point.cil.out.i [2022-07-12 12:37:50,536 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d75325f51/f1cd6929ab56401ebc013be8b87b801a/FLAGa06dfb4b0 [2022-07-12 12:37:50,958 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d75325f51/f1cd6929ab56401ebc013be8b87b801a [2022-07-12 12:37:50,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 12:37:50,961 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 12:37:50,962 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 12:37:50,962 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 12:37:50,966 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 12:37:50,967 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 12:37:50" (1/1) ... [2022-07-12 12:37:50,967 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2602ac2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:37:50, skipping insertion in model container [2022-07-12 12:37:50,968 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 12:37:50" (1/1) ... [2022-07-12 12:37:50,973 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 12:37:51,063 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 12:37:51,714 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.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--at76c50x-usb.ko-entry_point.cil.out.i[205251,205264] [2022-07-12 12:37:52,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 12:37:52,493 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 12:37:52,626 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.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--at76c50x-usb.ko-entry_point.cil.out.i[205251,205264] [2022-07-12 12:37:52,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 12:37:52,838 INFO L208 MainTranslator]: Completed translation [2022-07-12 12:37:52,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:37:52 WrapperNode [2022-07-12 12:37:52,840 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 12:37:52,842 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 12:37:52,842 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 12:37:52,842 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 12:37:52,847 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:37:52" (1/1) ... [2022-07-12 12:37:52,926 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:37:52" (1/1) ... [2022-07-12 12:37:53,084 INFO L137 Inliner]: procedures = 239, calls = 2983, calls flagged for inlining = 111, calls inlined = 96, statements flattened = 5266 [2022-07-12 12:37:53,085 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 12:37:53,085 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 12:37:53,085 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 12:37:53,085 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 12:37:53,091 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:37:52" (1/1) ... [2022-07-12 12:37:53,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:37:52" (1/1) ... [2022-07-12 12:37:53,113 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:37:52" (1/1) ... [2022-07-12 12:37:53,114 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:37:52" (1/1) ... [2022-07-12 12:37:53,188 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:37:52" (1/1) ... [2022-07-12 12:37:53,200 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:37:52" (1/1) ... [2022-07-12 12:37:53,261 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:37:52" (1/1) ... [2022-07-12 12:37:53,290 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 12:37:53,292 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 12:37:53,292 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 12:37:53,292 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 12:37:53,293 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:37:52" (1/1) ... [2022-07-12 12:37:53,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 12:37:53,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:37:53,317 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:37:53,335 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:37:53,353 INFO L130 BoogieDeclarations]: Found specification of procedure at76_hw_scan [2022-07-12 12:37:53,353 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_hw_scan [2022-07-12 12:37:53,354 INFO L130 BoogieDeclarations]: Found specification of procedure at76_dfu_get_status [2022-07-12 12:37:53,354 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_dfu_get_status [2022-07-12 12:37:53,354 INFO L130 BoogieDeclarations]: Found specification of procedure at76_join [2022-07-12 12:37:53,354 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_join [2022-07-12 12:37:53,354 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2022-07-12 12:37:53,354 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2022-07-12 12:37:53,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 12:37:53,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 12:37:53,355 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 12:37:53,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 12:37:53,355 INFO L130 BoogieDeclarations]: Found specification of procedure usb_put_dev [2022-07-12 12:37:53,355 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_put_dev [2022-07-12 12:37:53,355 INFO L130 BoogieDeclarations]: Found specification of procedure at76_submit_rx_urb [2022-07-12 12:37:53,355 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_submit_rx_urb [2022-07-12 12:37:53,355 INFO L130 BoogieDeclarations]: Found specification of procedure at76_add_interface [2022-07-12 12:37:53,355 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_add_interface [2022-07-12 12:37:53,356 INFO L130 BoogieDeclarations]: Found specification of procedure at76_get_timeout [2022-07-12 12:37:53,356 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_get_timeout [2022-07-12 12:37:53,356 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 12:37:53,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 12:37:53,356 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-07-12 12:37:53,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-07-12 12:37:53,356 INFO L130 BoogieDeclarations]: Found specification of procedure at76_bss_info_changed [2022-07-12 12:37:53,356 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_bss_info_changed [2022-07-12 12:37:53,357 INFO L130 BoogieDeclarations]: Found specification of procedure at76_wait_completion [2022-07-12 12:37:53,357 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_wait_completion [2022-07-12 12:37:53,357 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-12 12:37:53,357 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-12 12:37:53,357 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2022-07-12 12:37:53,357 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2022-07-12 12:37:53,357 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-12 12:37:53,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-12 12:37:53,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-12 12:37:53,358 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-12 12:37:53,358 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 12:37:53,358 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 12:37:53,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 12:37:53,359 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-07-12 12:37:53,359 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-07-12 12:37:53,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 12:37:53,359 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-07-12 12:37:53,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-07-12 12:37:53,359 INFO L130 BoogieDeclarations]: Found specification of procedure at76_delete_device [2022-07-12 12:37:53,359 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_delete_device [2022-07-12 12:37:53,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_u32 [2022-07-12 12:37:53,360 INFO L130 BoogieDeclarations]: Found specification of procedure at76_get_mib [2022-07-12 12:37:53,360 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_get_mib [2022-07-12 12:37:53,360 INFO L130 BoogieDeclarations]: Found specification of procedure at76_set_radio [2022-07-12 12:37:53,360 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_set_radio [2022-07-12 12:37:53,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 12:37:53,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 12:37:53,361 INFO L130 BoogieDeclarations]: Found specification of procedure led_trigger_event [2022-07-12 12:37:53,361 INFO L138 BoogieDeclarations]: Found implementation of procedure led_trigger_event [2022-07-12 12:37:53,361 INFO L130 BoogieDeclarations]: Found specification of procedure at76_set_card_command [2022-07-12 12:37:53,361 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_set_card_command [2022-07-12 12:37:53,362 INFO L130 BoogieDeclarations]: Found specification of procedure at76_get_cmd_status [2022-07-12 12:37:53,362 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_get_cmd_status [2022-07-12 12:37:53,362 INFO L130 BoogieDeclarations]: Found specification of procedure cancel_work_sync [2022-07-12 12:37:53,363 INFO L138 BoogieDeclarations]: Found implementation of procedure cancel_work_sync [2022-07-12 12:37:53,363 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2022-07-12 12:37:53,363 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2022-07-12 12:37:53,363 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-12 12:37:53,363 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-12 12:37:53,363 INFO L130 BoogieDeclarations]: Found specification of procedure ieee80211_queue_delayed_work [2022-07-12 12:37:53,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ieee80211_queue_delayed_work [2022-07-12 12:37:53,363 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2022-07-12 12:37:53,364 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2022-07-12 12:37:53,364 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-12 12:37:53,364 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-12 12:37:53,364 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_init_map [2022-07-12 12:37:53,364 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_init_map [2022-07-12 12:37:53,364 INFO L130 BoogieDeclarations]: Found specification of procedure at76_set_mib [2022-07-12 12:37:53,364 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_set_mib [2022-07-12 12:37:53,364 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2022-07-12 12:37:53,364 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2022-07-12 12:37:53,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-12 12:37:53,365 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-12 12:37:53,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-12 12:37:53,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 12:37:53,366 INFO L130 BoogieDeclarations]: Found specification of procedure at76_set_pm_mode [2022-07-12 12:37:53,366 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_set_pm_mode [2022-07-12 12:37:53,366 INFO L130 BoogieDeclarations]: Found specification of procedure at76_set_key [2022-07-12 12:37:53,366 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_set_key [2022-07-12 12:37:53,366 INFO L130 BoogieDeclarations]: Found specification of procedure at76_is_505a [2022-07-12 12:37:53,366 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_is_505a [2022-07-12 12:37:53,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 12:37:53,366 INFO L130 BoogieDeclarations]: Found specification of procedure at76_get_hw_cfg [2022-07-12 12:37:53,367 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_get_hw_cfg [2022-07-12 12:37:53,367 INFO L130 BoogieDeclarations]: Found specification of procedure at76_config [2022-07-12 12:37:53,367 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_config [2022-07-12 12:37:53,367 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_bulk [2022-07-12 12:37:53,367 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_bulk [2022-07-12 12:37:53,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-12 12:37:53,368 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-12 12:37:53,368 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2022-07-12 12:37:53,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2022-07-12 12:37:53,368 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-12 12:37:53,369 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-12 12:37:53,369 INFO L130 BoogieDeclarations]: Found specification of procedure skb_trim [2022-07-12 12:37:53,369 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_trim [2022-07-12 12:37:53,369 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-12 12:37:53,369 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-12 12:37:53,370 INFO L130 BoogieDeclarations]: Found specification of procedure at76_get_op_mode [2022-07-12 12:37:53,370 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_get_op_mode [2022-07-12 12:37:53,370 INFO L130 BoogieDeclarations]: Found specification of procedure at76_remove_interface [2022-07-12 12:37:53,370 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_remove_interface [2022-07-12 12:37:53,370 INFO L130 BoogieDeclarations]: Found specification of procedure print_hex_dump [2022-07-12 12:37:53,370 INFO L138 BoogieDeclarations]: Found implementation of procedure print_hex_dump [2022-07-12 12:37:53,370 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-12 12:37:53,370 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-12 12:37:53,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 12:37:53,371 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 12:37:53,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 12:37:53,371 INFO L130 BoogieDeclarations]: Found specification of procedure wiphy_name [2022-07-12 12:37:53,371 INFO L138 BoogieDeclarations]: Found implementation of procedure wiphy_name [2022-07-12 12:37:53,372 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout_interruptible [2022-07-12 12:37:53,373 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout_interruptible [2022-07-12 12:37:53,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 12:37:53,374 INFO L130 BoogieDeclarations]: Found specification of procedure at76_start_monitor [2022-07-12 12:37:53,374 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_start_monitor [2022-07-12 12:37:53,374 INFO L130 BoogieDeclarations]: Found specification of procedure ieee80211_stop_queues [2022-07-12 12:37:53,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ieee80211_stop_queues [2022-07-12 12:37:53,376 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_any [2022-07-12 12:37:53,376 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_any [2022-07-12 12:37:53,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 12:37:53,376 INFO L130 BoogieDeclarations]: Found specification of procedure is_valid_ether_addr [2022-07-12 12:37:53,381 INFO L138 BoogieDeclarations]: Found implementation of procedure is_valid_ether_addr [2022-07-12 12:37:53,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 12:37:53,381 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2022-07-12 12:37:53,381 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2022-07-12 12:37:53,381 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-07-12 12:37:53,381 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-07-12 12:37:53,381 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-07-12 12:37:53,381 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-07-12 12:37:53,382 INFO L130 BoogieDeclarations]: Found specification of procedure __init_work [2022-07-12 12:37:53,382 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_work [2022-07-12 12:37:53,382 INFO L130 BoogieDeclarations]: Found specification of procedure at76_configure_filter [2022-07-12 12:37:53,382 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_configure_filter [2022-07-12 12:37:53,382 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-12 12:37:53,382 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-12 12:37:53,382 INFO L130 BoogieDeclarations]: Found specification of procedure ieee80211_queue_work [2022-07-12 12:37:53,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ieee80211_queue_work [2022-07-12 12:37:53,382 INFO L130 BoogieDeclarations]: Found specification of procedure dev_name [2022-07-12 12:37:53,383 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_name [2022-07-12 12:37:53,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 12:37:53,383 INFO L130 BoogieDeclarations]: Found specification of procedure at76_mac80211_tx [2022-07-12 12:37:53,383 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_mac80211_tx [2022-07-12 12:37:53,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 12:37:53,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 12:37:53,383 INFO L130 BoogieDeclarations]: Found specification of procedure IEEE80211_SKB_CB [2022-07-12 12:37:53,383 INFO L138 BoogieDeclarations]: Found implementation of procedure IEEE80211_SKB_CB [2022-07-12 12:37:53,945 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 12:37:53,947 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 12:37:54,137 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 12:38:01,338 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 12:38:01,350 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 12:38:01,350 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-12 12:38:01,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:38:01 BoogieIcfgContainer [2022-07-12 12:38:01,353 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 12:38:01,354 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 12:38:01,354 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 12:38:01,357 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 12:38:01,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 12:37:50" (1/3) ... [2022-07-12 12:38:01,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@530cb50f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 12:38:01, skipping insertion in model container [2022-07-12 12:38:01,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:37:52" (2/3) ... [2022-07-12 12:38:01,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@530cb50f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 12:38:01, skipping insertion in model container [2022-07-12 12:38:01,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:38:01" (3/3) ... [2022-07-12 12:38:01,359 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--at76c50x-usb.ko-entry_point.cil.out.i [2022-07-12 12:38:01,368 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 12:38:01,369 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 12:38:01,426 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 12:38:01,430 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@3206f8f2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7cb5db65 [2022-07-12 12:38:01,430 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 12:38:01,437 INFO L276 IsEmpty]: Start isEmpty. Operand has 1344 states, 979 states have (on average 1.390194075587334) internal successors, (1361), 1003 states have internal predecessors, (1361), 296 states have call successors, (296), 68 states have call predecessors, (296), 67 states have return successors, (291), 290 states have call predecessors, (291), 291 states have call successors, (291) [2022-07-12 12:38:01,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-12 12:38:01,447 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:38:01,448 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2022-07-12 12:38:01,448 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:38:01,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:38:01,452 INFO L85 PathProgramCache]: Analyzing trace with hash -576681096, now seen corresponding path program 1 times [2022-07-12 12:38:01,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:38:01,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016479615] [2022-07-12 12:38:01,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:38:01,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:38:01,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:02,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:38:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:02,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:38:02,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:02,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:38:02,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:02,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:38:02,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:02,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:38:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:02,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:38:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:02,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:38:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:02,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:38:02,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:02,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 12:38:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:02,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 12:38:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:02,123 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-07-12 12:38:02,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:38:02,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016479615] [2022-07-12 12:38:02,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016479615] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:38:02,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:38:02,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:38:02,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151490599] [2022-07-12 12:38:02,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:38:02,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:38:02,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:38:02,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:38:02,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:38:02,198 INFO L87 Difference]: Start difference. First operand has 1344 states, 979 states have (on average 1.390194075587334) internal successors, (1361), 1003 states have internal predecessors, (1361), 296 states have call successors, (296), 68 states have call predecessors, (296), 67 states have return successors, (291), 290 states have call predecessors, (291), 291 states have call successors, (291) 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, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-12 12:38:08,562 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:38:10,580 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:38:12,624 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:38:14,646 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:38:17,128 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:38:19,147 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:38:21,173 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:38:23,205 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:38:23,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:38:23,936 INFO L93 Difference]: Finished difference Result 4281 states and 6544 transitions. [2022-07-12 12:38:23,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:38:23,938 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, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 80 [2022-07-12 12:38:23,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:38:23,986 INFO L225 Difference]: With dead ends: 4281 [2022-07-12 12:38:23,986 INFO L226 Difference]: Without dead ends: 2924 [2022-07-12 12:38:24,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:38:24,008 INFO L413 NwaCegarLoop]: 2128 mSDtfsCounter, 3000 mSDsluCounter, 3261 mSDsCounter, 0 mSdLazyCounter, 2405 mSolverCounterSat, 1574 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3258 SdHoareTripleChecker+Valid, 5389 SdHoareTripleChecker+Invalid, 3987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1574 IncrementalHoareTripleChecker+Valid, 2405 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.4s IncrementalHoareTripleChecker+Time [2022-07-12 12:38:24,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3258 Valid, 5389 Invalid, 3987 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1574 Valid, 2405 Invalid, 8 Unknown, 0 Unchecked, 21.4s Time] [2022-07-12 12:38:24,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2022-07-12 12:38:24,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 2610. [2022-07-12 12:38:24,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2610 states, 1910 states have (on average 1.382198952879581) internal successors, (2640), 1944 states have internal predecessors, (2640), 567 states have call successors, (567), 133 states have call predecessors, (567), 132 states have return successors, (566), 564 states have call predecessors, (566), 566 states have call successors, (566) [2022-07-12 12:38:24,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 3773 transitions. [2022-07-12 12:38:24,181 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 3773 transitions. Word has length 80 [2022-07-12 12:38:24,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:38:24,182 INFO L495 AbstractCegarLoop]: Abstraction has 2610 states and 3773 transitions. [2022-07-12 12:38:24,182 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, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-12 12:38:24,182 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 3773 transitions. [2022-07-12 12:38:24,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-12 12:38:24,188 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:38:24,188 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2022-07-12 12:38:24,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 12:38:24,188 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:38:24,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:38:24,189 INFO L85 PathProgramCache]: Analyzing trace with hash -2085975567, now seen corresponding path program 1 times [2022-07-12 12:38:24,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:38:24,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685037679] [2022-07-12 12:38:24,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:38:24,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:38:24,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:24,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:38:24,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:24,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:38:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:24,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:38:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:24,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:38:24,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:24,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:38:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:24,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:38:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:24,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:38:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:24,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:38:24,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:24,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 12:38:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:24,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 12:38:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:24,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 12:38:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:24,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 12:38:24,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:24,608 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-12 12:38:24,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:38:24,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685037679] [2022-07-12 12:38:24,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685037679] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:38:24,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:38:24,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 12:38:24,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734405141] [2022-07-12 12:38:24,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:38:24,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 12:38:24,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:38:24,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 12:38:24,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 12:38:24,611 INFO L87 Difference]: Start difference. First operand 2610 states and 3773 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 12:38:31,800 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:38:33,828 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:38:35,864 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:38:37,894 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:38:39,967 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:38:41,985 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:38:44,020 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:38:46,048 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:38:47,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:38:47,044 INFO L93 Difference]: Finished difference Result 8399 states and 12489 transitions. [2022-07-12 12:38:47,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 12:38:47,045 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 96 [2022-07-12 12:38:47,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:38:47,070 INFO L225 Difference]: With dead ends: 8399 [2022-07-12 12:38:47,070 INFO L226 Difference]: Without dead ends: 5803 [2022-07-12 12:38:47,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-07-12 12:38:47,079 INFO L413 NwaCegarLoop]: 2106 mSDtfsCounter, 3037 mSDsluCounter, 6187 mSDsCounter, 0 mSdLazyCounter, 4139 mSolverCounterSat, 1571 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3294 SdHoareTripleChecker+Valid, 8293 SdHoareTripleChecker+Invalid, 5718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1571 IncrementalHoareTripleChecker+Valid, 4139 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.1s IncrementalHoareTripleChecker+Time [2022-07-12 12:38:47,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3294 Valid, 8293 Invalid, 5718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1571 Valid, 4139 Invalid, 8 Unknown, 0 Unchecked, 22.1s Time] [2022-07-12 12:38:47,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5803 states. [2022-07-12 12:38:47,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5803 to 5213. [2022-07-12 12:38:47,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5213 states, 3819 states have (on average 1.3833464257659074) internal successors, (5283), 3889 states have internal predecessors, (5283), 1123 states have call successors, (1123), 265 states have call predecessors, (1123), 270 states have return successors, (1143), 1122 states have call predecessors, (1143), 1122 states have call successors, (1143) [2022-07-12 12:38:47,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5213 states to 5213 states and 7549 transitions. [2022-07-12 12:38:47,242 INFO L78 Accepts]: Start accepts. Automaton has 5213 states and 7549 transitions. Word has length 96 [2022-07-12 12:38:47,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:38:47,244 INFO L495 AbstractCegarLoop]: Abstraction has 5213 states and 7549 transitions. [2022-07-12 12:38:47,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 12:38:47,244 INFO L276 IsEmpty]: Start isEmpty. Operand 5213 states and 7549 transitions. [2022-07-12 12:38:47,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-12 12:38:47,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:38:47,254 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2022-07-12 12:38:47,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 12:38:47,255 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:38:47,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:38:47,256 INFO L85 PathProgramCache]: Analyzing trace with hash -178635968, now seen corresponding path program 1 times [2022-07-12 12:38:47,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:38:47,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725938479] [2022-07-12 12:38:47,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:38:47,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:38:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:47,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:38:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:47,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:38:47,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:47,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:38:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:47,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:38:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:47,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:38:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:47,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:38:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:47,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:38:47,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:47,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:38:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:47,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 12:38:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:47,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 12:38:47,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:47,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 12:38:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:47,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 12:38:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:47,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:38:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:47,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:47,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 12:38:47,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:47,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 12:38:47,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:47,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 12:38:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:47,724 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-07-12 12:38:47,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:38:47,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725938479] [2022-07-12 12:38:47,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725938479] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:38:47,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:38:47,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 12:38:47,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397709179] [2022-07-12 12:38:47,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:38:47,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 12:38:47,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:38:47,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 12:38:47,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 12:38:47,731 INFO L87 Difference]: Start difference. First operand 5213 states and 7549 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 12:38:52,545 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:38:54,568 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:38:56,605 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:38:58,629 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:39:00,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:39:00,014 INFO L93 Difference]: Finished difference Result 13361 states and 19664 transitions. [2022-07-12 12:39:00,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 12:39:00,017 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 144 [2022-07-12 12:39:00,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:39:00,054 INFO L225 Difference]: With dead ends: 13361 [2022-07-12 12:39:00,054 INFO L226 Difference]: Without dead ends: 8172 [2022-07-12 12:39:00,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-07-12 12:39:00,070 INFO L413 NwaCegarLoop]: 1961 mSDtfsCounter, 1954 mSDsluCounter, 3140 mSDsCounter, 0 mSdLazyCounter, 2094 mSolverCounterSat, 1418 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2104 SdHoareTripleChecker+Valid, 5101 SdHoareTripleChecker+Invalid, 3516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1418 IncrementalHoareTripleChecker+Valid, 2094 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2022-07-12 12:39:00,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2104 Valid, 5101 Invalid, 3516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1418 Valid, 2094 Invalid, 4 Unknown, 0 Unchecked, 12.0s Time] [2022-07-12 12:39:00,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8172 states. [2022-07-12 12:39:00,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8172 to 7472. [2022-07-12 12:39:00,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7472 states, 5511 states have (on average 1.3796044275086192) internal successors, (7603), 5597 states have internal predecessors, (7603), 1550 states have call successors, (1550), 397 states have call predecessors, (1550), 410 states have return successors, (1586), 1549 states have call predecessors, (1586), 1549 states have call successors, (1586) [2022-07-12 12:39:00,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7472 states to 7472 states and 10739 transitions. [2022-07-12 12:39:00,345 INFO L78 Accepts]: Start accepts. Automaton has 7472 states and 10739 transitions. Word has length 144 [2022-07-12 12:39:00,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:39:00,346 INFO L495 AbstractCegarLoop]: Abstraction has 7472 states and 10739 transitions. [2022-07-12 12:39:00,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 12:39:00,347 INFO L276 IsEmpty]: Start isEmpty. Operand 7472 states and 10739 transitions. [2022-07-12 12:39:00,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-12 12:39:00,352 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:39:00,352 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:39:00,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 12:39:00,353 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:39:00,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:39:00,353 INFO L85 PathProgramCache]: Analyzing trace with hash -157674826, now seen corresponding path program 1 times [2022-07-12 12:39:00,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:39:00,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589286186] [2022-07-12 12:39:00,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:39:00,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:39:00,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:39:00,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:39:00,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:39:00,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:39:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:39:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:39:00,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:39:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:39:00,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 12:39:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 12:39:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 12:39:00,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 12:39:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 12:39:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 12:39:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:39:00,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 12:39:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 12:39:00,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,736 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-12 12:39:00,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:39:00,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589286186] [2022-07-12 12:39:00,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589286186] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:39:00,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:39:00,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 12:39:00,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736020809] [2022-07-12 12:39:00,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:39:00,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 12:39:00,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:39:00,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 12:39:00,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:39:00,739 INFO L87 Difference]: Start difference. First operand 7472 states and 10739 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (19), 7 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 12:39:08,571 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:39:10,589 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:39:12,616 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:39:14,661 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:39:16,690 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:39:18,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:39:18,849 INFO L93 Difference]: Finished difference Result 19747 states and 28972 transitions. [2022-07-12 12:39:18,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 12:39:18,849 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (19), 7 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2022-07-12 12:39:18,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:39:18,897 INFO L225 Difference]: With dead ends: 19747 [2022-07-12 12:39:18,897 INFO L226 Difference]: Without dead ends: 12310 [2022-07-12 12:39:18,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-07-12 12:39:18,914 INFO L413 NwaCegarLoop]: 2790 mSDtfsCounter, 2003 mSDsluCounter, 5669 mSDsCounter, 0 mSdLazyCounter, 5105 mSolverCounterSat, 1024 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2213 SdHoareTripleChecker+Valid, 8459 SdHoareTripleChecker+Invalid, 6134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1024 IncrementalHoareTripleChecker+Valid, 5105 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.7s IncrementalHoareTripleChecker+Time [2022-07-12 12:39:18,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2213 Valid, 8459 Invalid, 6134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1024 Valid, 5105 Invalid, 5 Unknown, 0 Unchecked, 17.7s Time] [2022-07-12 12:39:18,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12310 states. [2022-07-12 12:39:19,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12310 to 10938. [2022-07-12 12:39:19,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10938 states, 8034 states have (on average 1.3783918347025144) internal successors, (11074), 8182 states have internal predecessors, (11074), 2278 states have call successors, (2278), 606 states have call predecessors, (2278), 625 states have return successors, (2324), 2277 states have call predecessors, (2324), 2277 states have call successors, (2324) [2022-07-12 12:39:19,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10938 states to 10938 states and 15676 transitions. [2022-07-12 12:39:19,263 INFO L78 Accepts]: Start accepts. Automaton has 10938 states and 15676 transitions. Word has length 156 [2022-07-12 12:39:19,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:39:19,264 INFO L495 AbstractCegarLoop]: Abstraction has 10938 states and 15676 transitions. [2022-07-12 12:39:19,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (19), 7 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 12:39:19,264 INFO L276 IsEmpty]: Start isEmpty. Operand 10938 states and 15676 transitions. [2022-07-12 12:39:19,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-12 12:39:19,273 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:39:19,273 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 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] [2022-07-12 12:39:19,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 12:39:19,274 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:39:19,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:39:19,275 INFO L85 PathProgramCache]: Analyzing trace with hash -67194308, now seen corresponding path program 1 times [2022-07-12 12:39:19,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:39:19,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993394804] [2022-07-12 12:39:19,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:39:19,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:39:19,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:19,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:39:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:19,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:39:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:19,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:39:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:19,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:39:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:19,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:39:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:19,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:39:19,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:19,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:39:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:19,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:39:19,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:19,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 12:39:19,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:19,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 12:39:19,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:19,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 12:39:19,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:19,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 12:39:19,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:19,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 12:39:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:19,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 12:39:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:19,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 12:39:19,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:19,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 12:39:19,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:19,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:39:19,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:19,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:19,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 12:39:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:19,679 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2022-07-12 12:39:19,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:39:19,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993394804] [2022-07-12 12:39:19,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993394804] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:39:19,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:39:19,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 12:39:19,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269320936] [2022-07-12 12:39:19,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:39:19,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 12:39:19,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:39:19,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 12:39:19,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:39:19,680 INFO L87 Difference]: Start difference. First operand 10938 states and 15676 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 12:39:25,703 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:39:27,725 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:39:29,749 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:39:31,786 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:39:33,820 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:39:35,846 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:39:36,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:39:36,967 INFO L93 Difference]: Finished difference Result 17155 states and 24873 transitions. [2022-07-12 12:39:36,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 12:39:36,967 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 168 [2022-07-12 12:39:36,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:39:36,983 INFO L225 Difference]: With dead ends: 17155 [2022-07-12 12:39:36,984 INFO L226 Difference]: Without dead ends: 6244 [2022-07-12 12:39:37,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-07-12 12:39:37,002 INFO L413 NwaCegarLoop]: 1875 mSDtfsCounter, 425 mSDsluCounter, 6582 mSDsCounter, 0 mSdLazyCounter, 4024 mSolverCounterSat, 353 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 8457 SdHoareTripleChecker+Invalid, 4383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 353 IncrementalHoareTripleChecker+Valid, 4024 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.0s IncrementalHoareTripleChecker+Time [2022-07-12 12:39:37,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 8457 Invalid, 4383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [353 Valid, 4024 Invalid, 6 Unknown, 0 Unchecked, 17.0s Time] [2022-07-12 12:39:37,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6244 states. [2022-07-12 12:39:37,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6244 to 5552. [2022-07-12 12:39:37,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5552 states, 4083 states have (on average 1.3771736468283124) internal successors, (5623), 4155 states have internal predecessors, (5623), 1149 states have call successors, (1149), 310 states have call predecessors, (1149), 319 states have return successors, (1172), 1150 states have call predecessors, (1172), 1148 states have call successors, (1172) [2022-07-12 12:39:37,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5552 states to 5552 states and 7944 transitions. [2022-07-12 12:39:37,138 INFO L78 Accepts]: Start accepts. Automaton has 5552 states and 7944 transitions. Word has length 168 [2022-07-12 12:39:37,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:39:37,140 INFO L495 AbstractCegarLoop]: Abstraction has 5552 states and 7944 transitions. [2022-07-12 12:39:37,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 12:39:37,140 INFO L276 IsEmpty]: Start isEmpty. Operand 5552 states and 7944 transitions. [2022-07-12 12:39:37,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-12 12:39:37,146 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:39:37,146 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 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] [2022-07-12 12:39:37,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 12:39:37,146 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:39:37,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:39:37,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1257661886, now seen corresponding path program 1 times [2022-07-12 12:39:37,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:39:37,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671910496] [2022-07-12 12:39:37,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:39:37,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:39:37,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:37,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:39:37,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:37,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:39:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:37,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:39:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:37,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:39:37,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:37,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:39:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:37,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:39:37,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:37,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:39:37,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:37,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:39:37,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:37,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 12:39:37,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:37,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 12:39:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:37,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 12:39:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:37,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 12:39:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:37,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 12:39:37,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:37,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 12:39:37,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:37,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 12:39:37,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:37,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 12:39:37,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:37,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:39:37,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:37,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:37,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:37,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 12:39:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:37,498 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2022-07-12 12:39:37,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:39:37,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671910496] [2022-07-12 12:39:37,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671910496] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:39:37,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:39:37,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 12:39:37,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448423566] [2022-07-12 12:39:37,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:39:37,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 12:39:37,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:39:37,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 12:39:37,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 12:39:37,500 INFO L87 Difference]: Start difference. First operand 5552 states and 7944 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 12:39:43,924 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:39:45,945 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:39:47,968 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:39:50,002 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:39:52,027 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:39:54,055 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:39:54,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:39:54,989 INFO L93 Difference]: Finished difference Result 11657 states and 17017 transitions. [2022-07-12 12:39:54,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:39:54,989 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 168 [2022-07-12 12:39:54,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:39:55,009 INFO L225 Difference]: With dead ends: 11657 [2022-07-12 12:39:55,009 INFO L226 Difference]: Without dead ends: 6179 [2022-07-12 12:39:55,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:39:55,022 INFO L413 NwaCegarLoop]: 1880 mSDtfsCounter, 406 mSDsluCounter, 3847 mSDsCounter, 0 mSdLazyCounter, 2701 mSolverCounterSat, 347 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 5727 SdHoareTripleChecker+Invalid, 3054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 347 IncrementalHoareTripleChecker+Valid, 2701 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2022-07-12 12:39:55,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 5727 Invalid, 3054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [347 Valid, 2701 Invalid, 6 Unknown, 0 Unchecked, 17.3s Time] [2022-07-12 12:39:55,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6179 states. [2022-07-12 12:39:55,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6179 to 5556. [2022-07-12 12:39:55,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5556 states, 4087 states have (on average 1.3763151455835576) internal successors, (5625), 4159 states have internal predecessors, (5625), 1149 states have call successors, (1149), 310 states have call predecessors, (1149), 319 states have return successors, (1172), 1150 states have call predecessors, (1172), 1148 states have call successors, (1172) [2022-07-12 12:39:55,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5556 states to 5556 states and 7946 transitions. [2022-07-12 12:39:55,168 INFO L78 Accepts]: Start accepts. Automaton has 5556 states and 7946 transitions. Word has length 168 [2022-07-12 12:39:55,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:39:55,169 INFO L495 AbstractCegarLoop]: Abstraction has 5556 states and 7946 transitions. [2022-07-12 12:39:55,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 12:39:55,169 INFO L276 IsEmpty]: Start isEmpty. Operand 5556 states and 7946 transitions. [2022-07-12 12:39:55,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-12 12:39:55,176 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:39:55,177 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 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] [2022-07-12 12:39:55,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 12:39:55,177 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:39:55,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:39:55,177 INFO L85 PathProgramCache]: Analyzing trace with hash -128541508, now seen corresponding path program 1 times [2022-07-12 12:39:55,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:39:55,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557670026] [2022-07-12 12:39:55,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:39:55,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:39:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:55,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:39:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:55,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:39:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:55,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:39:55,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:55,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:39:55,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:55,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:39:55,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:55,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:39:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:55,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:39:55,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:55,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:39:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:55,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 12:39:55,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:55,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 12:39:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:55,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 12:39:55,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:55,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 12:39:55,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:55,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 12:39:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:55,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 12:39:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:55,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 12:39:55,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:55,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 12:39:55,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:55,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:39:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:55,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:55,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 12:39:55,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:55,674 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2022-07-12 12:39:55,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:39:55,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557670026] [2022-07-12 12:39:55,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557670026] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:39:55,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:39:55,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 12:39:55,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622195240] [2022-07-12 12:39:55,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:39:55,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 12:39:55,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:39:55,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 12:39:55,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:39:55,677 INFO L87 Difference]: Start difference. First operand 5556 states and 7946 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (20), 5 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 12:40:02,358 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:40:04,385 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:40:06,406 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:40:08,449 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:40:10,476 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:40:12,499 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:40:13,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:40:13,664 INFO L93 Difference]: Finished difference Result 11625 states and 16971 transitions. [2022-07-12 12:40:13,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 12:40:13,664 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (20), 5 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) Word has length 168 [2022-07-12 12:40:13,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:40:13,683 INFO L225 Difference]: With dead ends: 11625 [2022-07-12 12:40:13,684 INFO L226 Difference]: Without dead ends: 6143 [2022-07-12 12:40:13,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-07-12 12:40:13,696 INFO L413 NwaCegarLoop]: 1839 mSDtfsCounter, 393 mSDsluCounter, 6612 mSDsCounter, 0 mSdLazyCounter, 3827 mSolverCounterSat, 353 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 8451 SdHoareTripleChecker+Invalid, 4186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 353 IncrementalHoareTripleChecker+Valid, 3827 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.7s IncrementalHoareTripleChecker+Time [2022-07-12 12:40:13,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 8451 Invalid, 4186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [353 Valid, 3827 Invalid, 6 Unknown, 0 Unchecked, 17.7s Time] [2022-07-12 12:40:13,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6143 states. [2022-07-12 12:40:13,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6143 to 5556. [2022-07-12 12:40:13,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5556 states, 4083 states have (on average 1.3747244673034533) internal successors, (5613), 4157 states have internal predecessors, (5613), 1149 states have call successors, (1149), 310 states have call predecessors, (1149), 323 states have return successors, (1178), 1152 states have call predecessors, (1178), 1148 states have call successors, (1178) [2022-07-12 12:40:13,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5556 states to 5556 states and 7940 transitions. [2022-07-12 12:40:13,898 INFO L78 Accepts]: Start accepts. Automaton has 5556 states and 7940 transitions. Word has length 168 [2022-07-12 12:40:13,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:40:13,898 INFO L495 AbstractCegarLoop]: Abstraction has 5556 states and 7940 transitions. [2022-07-12 12:40:13,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (20), 5 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 12:40:13,898 INFO L276 IsEmpty]: Start isEmpty. Operand 5556 states and 7940 transitions. [2022-07-12 12:40:13,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-12 12:40:13,905 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:40:13,905 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 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] [2022-07-12 12:40:13,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 12:40:13,906 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:40:13,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:40:13,908 INFO L85 PathProgramCache]: Analyzing trace with hash -54204084, now seen corresponding path program 1 times [2022-07-12 12:40:13,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:40:13,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354619499] [2022-07-12 12:40:13,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:40:13,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:40:14,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:14,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:40:14,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:14,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:40:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:14,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:40:14,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:14,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:40:14,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:14,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:40:14,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:14,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:40:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:14,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:40:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:14,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:40:14,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:14,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 12:40:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:14,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 12:40:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:14,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 12:40:14,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:14,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 12:40:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:14,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 12:40:14,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:14,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 12:40:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:14,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 12:40:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:14,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 12:40:14,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:14,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:40:14,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:14,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:40:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:14,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:40:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:14,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 12:40:14,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:14,351 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2022-07-12 12:40:14,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:40:14,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354619499] [2022-07-12 12:40:14,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354619499] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:40:14,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262572836] [2022-07-12 12:40:14,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:40:14,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:40:14,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:40:14,353 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:40:14,355 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:40:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:15,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 5248 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 12:40:15,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:40:15,519 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2022-07-12 12:40:15,519 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:40:15,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262572836] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:40:15,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:40:15,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 8 [2022-07-12 12:40:15,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738165536] [2022-07-12 12:40:15,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:40:15,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 12:40:15,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:40:15,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 12:40:15,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:40:15,521 INFO L87 Difference]: Start difference. First operand 5556 states and 7940 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 3 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-12 12:40:16,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:40:16,888 INFO L93 Difference]: Finished difference Result 16519 states and 23627 transitions. [2022-07-12 12:40:16,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 12:40:16,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 3 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 175 [2022-07-12 12:40:16,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:40:16,945 INFO L225 Difference]: With dead ends: 16519 [2022-07-12 12:40:16,945 INFO L226 Difference]: Without dead ends: 16506 [2022-07-12 12:40:16,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:40:16,955 INFO L413 NwaCegarLoop]: 4077 mSDtfsCounter, 3703 mSDsluCounter, 3209 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3703 SdHoareTripleChecker+Valid, 7286 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 12:40:16,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3703 Valid, 7286 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-12 12:40:17,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16506 states. [2022-07-12 12:40:17,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16506 to 16472. [2022-07-12 12:40:17,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16472 states, 12095 states have (on average 1.3770152955766846) internal successors, (16655), 12325 states have internal predecessors, (16655), 3417 states have call successors, (3417), 918 states have call predecessors, (3417), 959 states have return successors, (3506), 3420 states have call predecessors, (3506), 3416 states have call successors, (3506) [2022-07-12 12:40:17,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16472 states to 16472 states and 23578 transitions. [2022-07-12 12:40:17,421 INFO L78 Accepts]: Start accepts. Automaton has 16472 states and 23578 transitions. Word has length 175 [2022-07-12 12:40:17,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:40:17,422 INFO L495 AbstractCegarLoop]: Abstraction has 16472 states and 23578 transitions. [2022-07-12 12:40:17,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 3 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-12 12:40:17,422 INFO L276 IsEmpty]: Start isEmpty. Operand 16472 states and 23578 transitions. [2022-07-12 12:40:17,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-12 12:40:17,436 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:40:17,436 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 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] [2022-07-12 12:40:17,468 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:40:17,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:40:17,663 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:40:17,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:40:17,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1642551986, now seen corresponding path program 1 times [2022-07-12 12:40:17,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:40:17,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730939758] [2022-07-12 12:40:17,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:40:17,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:40:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:17,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:40:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:17,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:40:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:17,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:40:17,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:17,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:40:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:17,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:40:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:17,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:40:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:17,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:40:17,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:17,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:40:17,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:17,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 12:40:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:17,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 12:40:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:17,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 12:40:17,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:17,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 12:40:17,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:17,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 12:40:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:17,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 12:40:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:17,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 12:40:17,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:18,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 12:40:18,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:18,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:40:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:18,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:40:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:18,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:40:18,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:18,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 12:40:18,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:18,045 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2022-07-12 12:40:18,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:40:18,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730939758] [2022-07-12 12:40:18,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730939758] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:40:18,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:40:18,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 12:40:18,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921111906] [2022-07-12 12:40:18,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:40:18,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 12:40:18,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:40:18,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 12:40:18,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 12:40:18,047 INFO L87 Difference]: Start difference. First operand 16472 states and 23578 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-07-12 12:40:25,031 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:40:27,056 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:40:29,098 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:40:31,133 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:40:33,227 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:40:35,250 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:40:38,077 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:40:39,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:40:39,323 INFO L93 Difference]: Finished difference Result 40517 states and 60381 transitions. [2022-07-12 12:40:39,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:40:39,323 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 175 [2022-07-12 12:40:39,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:40:39,405 INFO L225 Difference]: With dead ends: 40517 [2022-07-12 12:40:39,406 INFO L226 Difference]: Without dead ends: 24119 [2022-07-12 12:40:39,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-12 12:40:39,443 INFO L413 NwaCegarLoop]: 2503 mSDtfsCounter, 3230 mSDsluCounter, 4251 mSDsCounter, 0 mSdLazyCounter, 2306 mSolverCounterSat, 1451 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3463 SdHoareTripleChecker+Valid, 6754 SdHoareTripleChecker+Invalid, 3764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1451 IncrementalHoareTripleChecker+Valid, 2306 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.6s IncrementalHoareTripleChecker+Time [2022-07-12 12:40:39,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3463 Valid, 6754 Invalid, 3764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1451 Valid, 2306 Invalid, 7 Unknown, 0 Unchecked, 20.6s Time] [2022-07-12 12:40:39,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24119 states. [2022-07-12 12:40:40,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24119 to 16460. [2022-07-12 12:40:40,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16460 states, 12083 states have (on average 1.3763965902507656) internal successors, (16631), 12317 states have internal predecessors, (16631), 3417 states have call successors, (3417), 918 states have call predecessors, (3417), 959 states have return successors, (3506), 3416 states have call predecessors, (3506), 3416 states have call successors, (3506) [2022-07-12 12:40:40,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16460 states to 16460 states and 23554 transitions. [2022-07-12 12:40:40,210 INFO L78 Accepts]: Start accepts. Automaton has 16460 states and 23554 transitions. Word has length 175 [2022-07-12 12:40:40,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:40:40,212 INFO L495 AbstractCegarLoop]: Abstraction has 16460 states and 23554 transitions. [2022-07-12 12:40:40,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-07-12 12:40:40,212 INFO L276 IsEmpty]: Start isEmpty. Operand 16460 states and 23554 transitions. [2022-07-12 12:40:40,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-07-12 12:40:40,230 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:40:40,230 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 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] [2022-07-12 12:40:40,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 12:40:40,231 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:40:40,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:40:40,231 INFO L85 PathProgramCache]: Analyzing trace with hash 25964212, now seen corresponding path program 1 times [2022-07-12 12:40:40,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:40:40,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936594853] [2022-07-12 12:40:40,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:40:40,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:40:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:40,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:40:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:40,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:40:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:40,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:40:40,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:40,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:40:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:40,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:40:40,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:40,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:40:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:40,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:40:40,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:40,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:40:40,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:40,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 12:40:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:40,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 12:40:40,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:40,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 12:40:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:40,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 12:40:40,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:40,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 12:40:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:40,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 12:40:40,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:40,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 12:40:40,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:40,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 12:40:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:40,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 12:40:40,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:40,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 12:40:40,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:40,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:40:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:40,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:40:40,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:40,645 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-07-12 12:40:40,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:40:40,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936594853] [2022-07-12 12:40:40,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936594853] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:40:40,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:40:40,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 12:40:40,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435365229] [2022-07-12 12:40:40,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:40:40,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 12:40:40,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:40:40,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 12:40:40,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:40:40,648 INFO L87 Difference]: Start difference. First operand 16460 states and 23554 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (21), 7 states have call predecessors, (21), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-07-12 12:40:46,513 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:40:48,541 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:40:50,566 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:40:52,600 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:40:54,630 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:40:56,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:40:56,539 INFO L93 Difference]: Finished difference Result 41700 states and 60784 transitions. [2022-07-12 12:40:56,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 12:40:56,539 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (21), 7 states have call predecessors, (21), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 180 [2022-07-12 12:40:56,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:40:56,628 INFO L225 Difference]: With dead ends: 41700 [2022-07-12 12:40:56,628 INFO L226 Difference]: Without dead ends: 25314 [2022-07-12 12:40:56,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-12 12:40:56,664 INFO L413 NwaCegarLoop]: 2162 mSDtfsCounter, 3819 mSDsluCounter, 3602 mSDsCounter, 0 mSdLazyCounter, 3443 mSolverCounterSat, 2556 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4116 SdHoareTripleChecker+Valid, 5764 SdHoareTripleChecker+Invalid, 6004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2556 IncrementalHoareTripleChecker+Valid, 3443 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2022-07-12 12:40:56,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4116 Valid, 5764 Invalid, 6004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2556 Valid, 3443 Invalid, 5 Unknown, 0 Unchecked, 15.1s Time] [2022-07-12 12:40:56,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25314 states. [2022-07-12 12:40:57,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25314 to 22474. [2022-07-12 12:40:57,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22474 states, 16500 states have (on average 1.3717575757575757) internal successors, (22634), 16840 states have internal predecessors, (22634), 4606 states have call successors, (4606), 1292 states have call predecessors, (4606), 1367 states have return successors, (4762), 4626 states have call predecessors, (4762), 4605 states have call successors, (4762) [2022-07-12 12:40:57,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22474 states to 22474 states and 32002 transitions. [2022-07-12 12:40:57,427 INFO L78 Accepts]: Start accepts. Automaton has 22474 states and 32002 transitions. Word has length 180 [2022-07-12 12:40:57,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:40:57,427 INFO L495 AbstractCegarLoop]: Abstraction has 22474 states and 32002 transitions. [2022-07-12 12:40:57,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (21), 7 states have call predecessors, (21), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-07-12 12:40:57,428 INFO L276 IsEmpty]: Start isEmpty. Operand 22474 states and 32002 transitions. [2022-07-12 12:40:57,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-07-12 12:40:57,518 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:40:57,518 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:40:57,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 12:40:57,518 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:40:57,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:40:57,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1562427333, now seen corresponding path program 1 times [2022-07-12 12:40:57,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:40:57,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585589989] [2022-07-12 12:40:57,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:40:57,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:40:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:57,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:40:57,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:57,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:40:57,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:57,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:40:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:57,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:40:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:57,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:40:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:57,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:40:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:57,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:40:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:57,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:40:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:57,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 12:40:57,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:57,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 12:40:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:57,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 12:40:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:57,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 12:40:57,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:57,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 12:40:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:57,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 12:40:57,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:57,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 12:40:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:57,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 12:40:57,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:57,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:40:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:57,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:40:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:57,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:40:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:57,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 12:40:57,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:57,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-12 12:40:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:57,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-12 12:40:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:57,909 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2022-07-12 12:40:57,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:40:57,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585589989] [2022-07-12 12:40:57,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585589989] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:40:57,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:40:57,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 12:40:57,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978769642] [2022-07-12 12:40:57,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:40:57,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 12:40:57,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:40:57,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 12:40:57,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 12:40:57,912 INFO L87 Difference]: Start difference. First operand 22474 states and 32002 transitions. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2022-07-12 12:41:02,285 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:41:04,307 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:41:06,346 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:41:08,379 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:41:09,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:41:09,565 INFO L93 Difference]: Finished difference Result 47195 states and 68548 transitions. [2022-07-12 12:41:09,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:41:09,566 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 191 [2022-07-12 12:41:09,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:41:09,648 INFO L225 Difference]: With dead ends: 47195 [2022-07-12 12:41:09,649 INFO L226 Difference]: Without dead ends: 24655 [2022-07-12 12:41:09,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-07-12 12:41:09,694 INFO L413 NwaCegarLoop]: 1940 mSDtfsCounter, 2293 mSDsluCounter, 1935 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 873 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2512 SdHoareTripleChecker+Valid, 3875 SdHoareTripleChecker+Invalid, 2156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 873 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2022-07-12 12:41:09,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2512 Valid, 3875 Invalid, 2156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [873 Valid, 1279 Invalid, 4 Unknown, 0 Unchecked, 11.0s Time] [2022-07-12 12:41:09,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24655 states. [2022-07-12 12:41:10,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24655 to 22134. [2022-07-12 12:41:10,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22134 states, 16225 states have (on average 1.3691217257318953) internal successors, (22214), 16565 states have internal predecessors, (22214), 4566 states have call successors, (4566), 1267 states have call predecessors, (4566), 1342 states have return successors, (4712), 4586 states have call predecessors, (4712), 4565 states have call successors, (4712) [2022-07-12 12:41:10,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22134 states to 22134 states and 31492 transitions. [2022-07-12 12:41:10,551 INFO L78 Accepts]: Start accepts. Automaton has 22134 states and 31492 transitions. Word has length 191 [2022-07-12 12:41:10,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:41:10,552 INFO L495 AbstractCegarLoop]: Abstraction has 22134 states and 31492 transitions. [2022-07-12 12:41:10,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2022-07-12 12:41:10,552 INFO L276 IsEmpty]: Start isEmpty. Operand 22134 states and 31492 transitions. [2022-07-12 12:41:10,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-07-12 12:41:10,588 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:41:10,588 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:41:10,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 12:41:10,589 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:41:10,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:41:10,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1431758578, now seen corresponding path program 1 times [2022-07-12 12:41:10,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:41:10,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471286014] [2022-07-12 12:41:10,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:41:10,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:41:10,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:10,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:41:10,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:10,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:41:10,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:10,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:41:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:10,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:41:10,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:10,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:41:10,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:10,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:41:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:10,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:41:10,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:10,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:41:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:10,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 12:41:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:10,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 12:41:10,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:10,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 12:41:10,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:10,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 12:41:10,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:10,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 12:41:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:10,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 12:41:10,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:10,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 12:41:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:10,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 12:41:10,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:11,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:41:11,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:11,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:41:11,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:11,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:41:11,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:11,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 12:41:11,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:11,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-12 12:41:11,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:11,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-12 12:41:11,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:11,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-12 12:41:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:11,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-12 12:41:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:11,052 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2022-07-12 12:41:11,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:41:11,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471286014] [2022-07-12 12:41:11,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471286014] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:41:11,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:41:11,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 12:41:11,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337326515] [2022-07-12 12:41:11,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:41:11,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 12:41:11,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:41:11,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 12:41:11,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 12:41:11,054 INFO L87 Difference]: Start difference. First operand 22134 states and 31492 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-12 12:41:18,407 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:41:20,428 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:41:22,469 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:41:24,504 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:41:26,607 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:41:28,639 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:41:30,674 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:41:32,704 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:41:35,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:41:35,262 INFO L93 Difference]: Finished difference Result 70597 states and 103890 transitions. [2022-07-12 12:41:35,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 12:41:35,262 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 214 [2022-07-12 12:41:35,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:41:35,395 INFO L225 Difference]: With dead ends: 70597 [2022-07-12 12:41:35,396 INFO L226 Difference]: Without dead ends: 48569 [2022-07-12 12:41:35,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-07-12 12:41:35,443 INFO L413 NwaCegarLoop]: 3141 mSDtfsCounter, 2824 mSDsluCounter, 4206 mSDsCounter, 0 mSdLazyCounter, 3209 mSolverCounterSat, 1490 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3084 SdHoareTripleChecker+Valid, 7347 SdHoareTripleChecker+Invalid, 4707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1490 IncrementalHoareTripleChecker+Valid, 3209 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.6s IncrementalHoareTripleChecker+Time [2022-07-12 12:41:35,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3084 Valid, 7347 Invalid, 4707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1490 Valid, 3209 Invalid, 8 Unknown, 0 Unchecked, 22.6s Time] [2022-07-12 12:41:35,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48569 states. [2022-07-12 12:41:36,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48569 to 40160. [2022-07-12 12:41:37,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40160 states, 29370 states have (on average 1.3613891726251277) internal successors, (39984), 30009 states have internal predecessors, (39984), 8361 states have call successors, (8361), 2287 states have call predecessors, (8361), 2428 states have return successors, (8951), 8403 states have call predecessors, (8951), 8360 states have call successors, (8951) [2022-07-12 12:41:37,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40160 states to 40160 states and 57296 transitions. [2022-07-12 12:41:37,149 INFO L78 Accepts]: Start accepts. Automaton has 40160 states and 57296 transitions. Word has length 214 [2022-07-12 12:41:37,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:41:37,150 INFO L495 AbstractCegarLoop]: Abstraction has 40160 states and 57296 transitions. [2022-07-12 12:41:37,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-12 12:41:37,150 INFO L276 IsEmpty]: Start isEmpty. Operand 40160 states and 57296 transitions. [2022-07-12 12:41:37,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-07-12 12:41:37,189 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:41:37,189 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:41:37,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 12:41:37,189 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:41:37,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:41:37,190 INFO L85 PathProgramCache]: Analyzing trace with hash -434950096, now seen corresponding path program 1 times [2022-07-12 12:41:37,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:41:37,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759927223] [2022-07-12 12:41:37,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:41:37,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:41:37,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:37,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:41:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:37,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:41:37,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:37,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:41:37,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:37,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:41:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:37,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:41:37,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:37,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:41:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:37,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:41:37,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:37,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:41:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:37,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 12:41:37,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:37,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 12:41:37,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:37,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 12:41:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:37,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 12:41:37,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:37,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 12:41:37,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:37,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 12:41:37,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:37,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 12:41:37,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:37,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 12:41:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:37,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:41:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:37,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:41:37,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:37,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:41:37,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:37,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 12:41:37,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:37,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-12 12:41:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:37,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-12 12:41:37,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:37,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-12 12:41:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:37,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-12 12:41:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:37,547 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2022-07-12 12:41:37,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:41:37,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759927223] [2022-07-12 12:41:37,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759927223] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:41:37,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:41:37,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 12:41:37,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652671356] [2022-07-12 12:41:37,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:41:37,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 12:41:37,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:41:37,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 12:41:37,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 12:41:37,549 INFO L87 Difference]: Start difference. First operand 40160 states and 57296 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2022-07-12 12:41:42,832 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:41:44,857 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:41:46,898 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:41:48,928 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:41:50,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:41:50,539 INFO L93 Difference]: Finished difference Result 44568 states and 66084 transitions. [2022-07-12 12:41:50,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 12:41:50,539 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 214 [2022-07-12 12:41:50,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:41:50,657 INFO L225 Difference]: With dead ends: 44568 [2022-07-12 12:41:50,658 INFO L226 Difference]: Without dead ends: 44560 [2022-07-12 12:41:50,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-12 12:41:50,674 INFO L413 NwaCegarLoop]: 1874 mSDtfsCounter, 844 mSDsluCounter, 3159 mSDsCounter, 0 mSdLazyCounter, 1867 mSolverCounterSat, 990 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 5033 SdHoareTripleChecker+Invalid, 2861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 990 IncrementalHoareTripleChecker+Valid, 1867 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2022-07-12 12:41:50,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [890 Valid, 5033 Invalid, 2861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [990 Valid, 1867 Invalid, 4 Unknown, 0 Unchecked, 11.7s Time] [2022-07-12 12:41:50,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44560 states. [2022-07-12 12:41:52,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44560 to 40161. [2022-07-12 12:41:52,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40161 states, 29371 states have (on average 1.3613768683395187) internal successors, (39985), 30010 states have internal predecessors, (39985), 8361 states have call successors, (8361), 2287 states have call predecessors, (8361), 2428 states have return successors, (8951), 8403 states have call predecessors, (8951), 8360 states have call successors, (8951) [2022-07-12 12:41:52,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40161 states to 40161 states and 57297 transitions. [2022-07-12 12:41:52,221 INFO L78 Accepts]: Start accepts. Automaton has 40161 states and 57297 transitions. Word has length 214 [2022-07-12 12:41:52,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:41:52,221 INFO L495 AbstractCegarLoop]: Abstraction has 40161 states and 57297 transitions. [2022-07-12 12:41:52,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2022-07-12 12:41:52,222 INFO L276 IsEmpty]: Start isEmpty. Operand 40161 states and 57297 transitions. [2022-07-12 12:41:52,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2022-07-12 12:41:52,259 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:41:52,259 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:41:52,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 12:41:52,259 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:41:52,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:41:52,260 INFO L85 PathProgramCache]: Analyzing trace with hash -2125567838, now seen corresponding path program 1 times [2022-07-12 12:41:52,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:41:52,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789810251] [2022-07-12 12:41:52,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:41:52,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:41:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:52,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:41:52,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:52,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:41:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:52,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:41:52,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:52,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:41:52,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:52,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:41:52,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:52,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:41:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:52,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:41:52,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:52,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:41:52,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:52,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 12:41:52,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:52,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 12:41:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:52,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 12:41:52,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:52,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 12:41:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:52,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 12:41:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:52,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 12:41:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:52,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 12:41:52,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:52,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 12:41:52,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:52,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:41:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:52,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:41:52,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:52,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:41:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:52,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 12:41:52,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:52,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-12 12:41:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:52,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-12 12:41:52,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:52,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-12 12:41:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:52,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-12 12:41:52,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:52,588 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2022-07-12 12:41:52,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:41:52,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789810251] [2022-07-12 12:41:52,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789810251] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:41:52,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507665481] [2022-07-12 12:41:52,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:41:52,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:41:52,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:41:52,590 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:41:52,591 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:41:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:41:53,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 5387 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 12:41:53,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:41:53,501 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2022-07-12 12:41:53,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 12:41:53,594 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2022-07-12 12:41:53,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507665481] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 12:41:53,595 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 12:41:53,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2022-07-12 12:41:53,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085978283] [2022-07-12 12:41:53,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 12:41:53,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 12:41:53,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:41:53,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 12:41:53,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-12 12:41:53,596 INFO L87 Difference]: Start difference. First operand 40161 states and 57297 transitions. Second operand has 10 states, 10 states have (on average 12.6) internal successors, (126), 7 states have internal predecessors, (126), 2 states have call successors, (41), 5 states have call predecessors, (41), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2022-07-12 12:41:59,837 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:42:01,862 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:42:03,901 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 []