./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--libertas--usb8xxx.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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--libertas--usb8xxx.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 1b605371288ab675786f884c3e899aa7b22c9968bb31ac2f2bc3b55776b1682d --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 23:40:33,624 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 23:40:33,626 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 23:40:33,680 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 23:40:33,681 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 23:40:33,682 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 23:40:33,684 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 23:40:33,686 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 23:40:33,688 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 23:40:33,692 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 23:40:33,693 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 23:40:33,694 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 23:40:33,695 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 23:40:33,697 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 23:40:33,698 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 23:40:33,700 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 23:40:33,701 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 23:40:33,702 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 23:40:33,704 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 23:40:33,709 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 23:40:33,711 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 23:40:33,712 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 23:40:33,713 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 23:40:33,714 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 23:40:33,715 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 23:40:33,722 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 23:40:33,722 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 23:40:33,722 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 23:40:33,723 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 23:40:33,725 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 23:40:33,726 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 23:40:33,726 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 23:40:33,728 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 23:40:33,728 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 23:40:33,729 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 23:40:33,729 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 23:40:33,730 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 23:40:33,730 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 23:40:33,731 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 23:40:33,731 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 23:40:33,732 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 23:40:33,733 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 23:40:33,734 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-19 23:40:33,763 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 23:40:33,764 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 23:40:33,764 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 23:40:33,764 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 23:40:33,765 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 23:40:33,765 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 23:40:33,766 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 23:40:33,766 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 23:40:33,766 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 23:40:33,767 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 23:40:33,767 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 23:40:33,767 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 23:40:33,767 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 23:40:33,768 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 23:40:33,768 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 23:40:33,768 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 23:40:33,768 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 23:40:33,768 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 23:40:33,769 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 23:40:33,769 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 23:40:33,770 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 23:40:33,770 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 23:40:33,770 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 23:40:33,770 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 23:40:33,771 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 23:40:33,771 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 23:40:33,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 23:40:33,771 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 23:40:33,771 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 23:40:33,772 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 23:40:33,772 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 -> 1b605371288ab675786f884c3e899aa7b22c9968bb31ac2f2bc3b55776b1682d [2022-07-19 23:40:34,017 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 23:40:34,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 23:40:34,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 23:40:34,041 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 23:40:34,042 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 23:40:34,043 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--libertas--usb8xxx.ko-entry_point.cil.out.i [2022-07-19 23:40:34,096 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ceb9ebe2/a823872dc5044a7b9a169102f5b497cb/FLAGa07e0dcc5 [2022-07-19 23:40:34,807 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 23:40:34,808 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--libertas--usb8xxx.ko-entry_point.cil.out.i [2022-07-19 23:40:34,857 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ceb9ebe2/a823872dc5044a7b9a169102f5b497cb/FLAGa07e0dcc5 [2022-07-19 23:40:34,947 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ceb9ebe2/a823872dc5044a7b9a169102f5b497cb [2022-07-19 23:40:34,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 23:40:34,950 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 23:40:34,953 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 23:40:34,953 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 23:40:34,956 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 23:40:34,957 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:40:34" (1/1) ... [2022-07-19 23:40:34,958 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b77a23e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:40:34, skipping insertion in model container [2022-07-19 23:40:34,958 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:40:34" (1/1) ... [2022-07-19 23:40:34,964 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 23:40:35,064 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 23:40:35,775 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--libertas--usb8xxx.ko-entry_point.cil.out.i[180577,180590] [2022-07-19 23:40:36,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 23:40:36,279 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 23:40:36,416 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--libertas--usb8xxx.ko-entry_point.cil.out.i[180577,180590] [2022-07-19 23:40:36,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 23:40:36,658 INFO L208 MainTranslator]: Completed translation [2022-07-19 23:40:36,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:40:36 WrapperNode [2022-07-19 23:40:36,659 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 23:40:36,660 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 23:40:36,661 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 23:40:36,661 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 23:40:36,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:40:36" (1/1) ... [2022-07-19 23:40:36,721 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:40:36" (1/1) ... [2022-07-19 23:40:36,800 INFO L137 Inliner]: procedures = 180, calls = 1285, calls flagged for inlining = 87, calls inlined = 41, statements flattened = 1748 [2022-07-19 23:40:36,801 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 23:40:36,802 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 23:40:36,802 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 23:40:36,802 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 23:40:36,810 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:40:36" (1/1) ... [2022-07-19 23:40:36,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:40:36" (1/1) ... [2022-07-19 23:40:36,833 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:40:36" (1/1) ... [2022-07-19 23:40:36,837 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:40:36" (1/1) ... [2022-07-19 23:40:36,894 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:40:36" (1/1) ... [2022-07-19 23:40:36,915 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:40:36" (1/1) ... [2022-07-19 23:40:36,935 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:40:36" (1/1) ... [2022-07-19 23:40:36,985 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 23:40:36,986 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 23:40:36,987 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 23:40:36,987 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 23:40:36,988 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:40:36" (1/1) ... [2022-07-19 23:40:36,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 23:40:37,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:40:37,021 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-19 23:40:37,026 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-19 23:40:37,059 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_reset_device [2022-07-19 23:40:37,060 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_reset_device [2022-07-19 23:40:37,060 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_resume [2022-07-19 23:40:37,060 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_resume [2022-07-19 23:40:37,060 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2022-07-19 23:40:37,060 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2022-07-19 23:40:37,060 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2022-07-19 23:40:37,060 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2022-07-19 23:40:37,061 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2022-07-19 23:40:37,061 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2022-07-19 23:40:37,061 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-19 23:40:37,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-19 23:40:37,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 23:40:37,061 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_bulk [2022-07-19 23:40:37,061 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_bulk [2022-07-19 23:40:37,062 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2022-07-19 23:40:37,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2022-07-19 23:40:37,062 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-19 23:40:37,062 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-19 23:40:37,062 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-19 23:40:37,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-19 23:40:37,062 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-19 23:40:37,063 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-19 23:40:37,063 INFO L130 BoogieDeclarations]: Found specification of procedure activate_suitable_timer_1 [2022-07-19 23:40:37,063 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_suitable_timer_1 [2022-07-19 23:40:37,063 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_submit_rx_urb [2022-07-19 23:40:37,063 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_submit_rx_urb [2022-07-19 23:40:37,063 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-07-19 23:40:37,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-07-19 23:40:37,064 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-19 23:40:37,064 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-19 23:40:37,064 INFO L130 BoogieDeclarations]: Found specification of procedure __if_usb_submit_rx_urb [2022-07-19 23:40:37,064 INFO L138 BoogieDeclarations]: Found implementation of procedure __if_usb_submit_rx_urb [2022-07-19 23:40:37,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 23:40:37,064 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2022-07-19 23:40:37,064 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2022-07-19 23:40:37,065 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-19 23:40:37,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-19 23:40:37,065 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_free [2022-07-19 23:40:37,065 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_free [2022-07-19 23:40:37,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-19 23:40:37,066 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-19 23:40:37,066 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-19 23:40:37,066 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-19 23:40:37,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 23:40:37,066 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_disconnect [2022-07-19 23:40:37,067 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_disconnect [2022-07-19 23:40:37,067 INFO L130 BoogieDeclarations]: Found specification of procedure usb_tx_block [2022-07-19 23:40:37,067 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_tx_block [2022-07-19 23:40:37,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 23:40:37,067 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_timer_1 [2022-07-19 23:40:37,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_timer_1 [2022-07-19 23:40:37,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 23:40:37,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 23:40:37,068 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-19 23:40:37,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 23:40:37,069 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-07-19 23:40:37,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-07-19 23:40:37,069 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2022-07-19 23:40:37,070 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2022-07-19 23:40:37,070 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_num [2022-07-19 23:40:37,070 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_num [2022-07-19 23:40:37,070 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-07-19 23:40:37,070 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-07-19 23:40:37,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 23:40:37,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 23:40:37,071 INFO L130 BoogieDeclarations]: Found specification of procedure lbs_remove_card [2022-07-19 23:40:37,071 INFO L138 BoogieDeclarations]: Found implementation of procedure lbs_remove_card [2022-07-19 23:40:37,071 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-19 23:40:37,071 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-19 23:40:37,071 INFO L130 BoogieDeclarations]: Found specification of procedure dev_name [2022-07-19 23:40:37,071 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_name [2022-07-19 23:40:37,072 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-19 23:40:37,072 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-19 23:40:37,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 23:40:37,072 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2022-07-19 23:40:37,073 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2022-07-19 23:40:37,073 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2022-07-19 23:40:37,073 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2022-07-19 23:40:37,073 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-19 23:40:37,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-19 23:40:37,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 23:40:37,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 23:40:37,074 INFO L130 BoogieDeclarations]: Found specification of procedure preempt_count [2022-07-19 23:40:37,074 INFO L138 BoogieDeclarations]: Found implementation of procedure preempt_count [2022-07-19 23:40:37,488 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 23:40:37,490 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 23:40:37,824 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-19 23:40:38,771 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 23:40:38,784 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 23:40:38,784 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-19 23:40:38,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:40:38 BoogieIcfgContainer [2022-07-19 23:40:38,786 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 23:40:38,788 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 23:40:38,788 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 23:40:38,791 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 23:40:38,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 11:40:34" (1/3) ... [2022-07-19 23:40:38,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29d857f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:40:38, skipping insertion in model container [2022-07-19 23:40:38,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:40:36" (2/3) ... [2022-07-19 23:40:38,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29d857f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:40:38, skipping insertion in model container [2022-07-19 23:40:38,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:40:38" (3/3) ... [2022-07-19 23:40:38,795 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--libertas--usb8xxx.ko-entry_point.cil.out.i [2022-07-19 23:40:38,807 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 23:40:38,807 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 23:40:38,869 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 23:40:38,874 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@3439e741, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7d8642d2 [2022-07-19 23:40:38,874 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 23:40:38,880 INFO L276 IsEmpty]: Start isEmpty. Operand has 523 states, 385 states have (on average 1.361038961038961) internal successors, (524), 399 states have internal predecessors, (524), 101 states have call successors, (101), 36 states have call predecessors, (101), 35 states have return successors, (97), 94 states have call predecessors, (97), 97 states have call successors, (97) [2022-07-19 23:40:38,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-19 23:40:38,889 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:40:38,890 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 23:40:38,890 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:40:38,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:40:38,894 INFO L85 PathProgramCache]: Analyzing trace with hash 404224410, now seen corresponding path program 1 times [2022-07-19 23:40:38,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:40:38,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565762081] [2022-07-19 23:40:38,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:40:38,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:40:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:39,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:40:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:39,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:40:39,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:39,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 23:40:39,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:40:39,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565762081] [2022-07-19 23:40:39,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565762081] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:40:39,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:40:39,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 23:40:39,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915834878] [2022-07-19 23:40:39,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:40:39,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 23:40:39,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:40:39,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 23:40:39,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 23:40:39,529 INFO L87 Difference]: Start difference. First operand has 523 states, 385 states have (on average 1.361038961038961) internal successors, (524), 399 states have internal predecessors, (524), 101 states have call successors, (101), 36 states have call predecessors, (101), 35 states have return successors, (97), 94 states have call predecessors, (97), 97 states have call successors, (97) Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 23:40:41,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:40:41,431 INFO L93 Difference]: Finished difference Result 1646 states and 2326 transitions. [2022-07-19 23:40:41,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 23:40:41,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2022-07-19 23:40:41,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:40:41,461 INFO L225 Difference]: With dead ends: 1646 [2022-07-19 23:40:41,461 INFO L226 Difference]: Without dead ends: 1112 [2022-07-19 23:40:41,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-19 23:40:41,472 INFO L413 NwaCegarLoop]: 752 mSDtfsCounter, 1300 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 557 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1364 SdHoareTripleChecker+Valid, 1861 SdHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 557 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-19 23:40:41,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1364 Valid, 1861 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [557 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-19 23:40:41,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2022-07-19 23:40:41,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 995. [2022-07-19 23:40:41,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 737 states have (on average 1.3351424694708276) internal successors, (984), 753 states have internal predecessors, (984), 190 states have call successors, (190), 68 states have call predecessors, (190), 67 states have return successors, (189), 183 states have call predecessors, (189), 189 states have call successors, (189) [2022-07-19 23:40:41,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1363 transitions. [2022-07-19 23:40:41,612 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1363 transitions. Word has length 31 [2022-07-19 23:40:41,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:40:41,613 INFO L495 AbstractCegarLoop]: Abstraction has 995 states and 1363 transitions. [2022-07-19 23:40:41,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 23:40:41,613 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1363 transitions. [2022-07-19 23:40:41,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-19 23:40:41,617 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:40:41,617 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 23:40:41,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 23:40:41,618 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:40:41,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:40:41,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1978920525, now seen corresponding path program 1 times [2022-07-19 23:40:41,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:40:41,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104733514] [2022-07-19 23:40:41,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:40:41,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:40:41,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:41,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:40:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:41,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:40:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:41,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 23:40:41,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:41,824 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 23:40:41,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:40:41,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104733514] [2022-07-19 23:40:41,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104733514] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:40:41,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:40:41,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 23:40:41,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284224049] [2022-07-19 23:40:41,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:40:41,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 23:40:41,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:40:41,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 23:40:41,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 23:40:41,827 INFO L87 Difference]: Start difference. First operand 995 states and 1363 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 23:40:42,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:40:42,865 INFO L93 Difference]: Finished difference Result 1124 states and 1531 transitions. [2022-07-19 23:40:42,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 23:40:42,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2022-07-19 23:40:42,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:40:42,879 INFO L225 Difference]: With dead ends: 1124 [2022-07-19 23:40:42,880 INFO L226 Difference]: Without dead ends: 1118 [2022-07-19 23:40:42,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-19 23:40:42,882 INFO L413 NwaCegarLoop]: 658 mSDtfsCounter, 983 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-19 23:40:42,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1048 Valid, 1284 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-19 23:40:42,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2022-07-19 23:40:42,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 995. [2022-07-19 23:40:42,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 737 states have (on average 1.333785617367707) internal successors, (983), 753 states have internal predecessors, (983), 190 states have call successors, (190), 68 states have call predecessors, (190), 67 states have return successors, (189), 183 states have call predecessors, (189), 189 states have call successors, (189) [2022-07-19 23:40:42,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1362 transitions. [2022-07-19 23:40:42,959 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1362 transitions. Word has length 41 [2022-07-19 23:40:42,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:40:42,960 INFO L495 AbstractCegarLoop]: Abstraction has 995 states and 1362 transitions. [2022-07-19 23:40:42,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 23:40:42,960 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1362 transitions. [2022-07-19 23:40:42,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-19 23:40:42,968 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:40:42,969 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 23:40:42,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 23:40:42,969 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:40:42,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:40:42,970 INFO L85 PathProgramCache]: Analyzing trace with hash -203913163, now seen corresponding path program 1 times [2022-07-19 23:40:42,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:40:42,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786602158] [2022-07-19 23:40:42,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:40:42,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:40:43,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:43,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:40:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:43,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:40:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:43,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 23:40:43,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:43,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 23:40:43,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:40:43,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786602158] [2022-07-19 23:40:43,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786602158] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:40:43,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:40:43,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 23:40:43,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054955302] [2022-07-19 23:40:43,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:40:43,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 23:40:43,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:40:43,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 23:40:43,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 23:40:43,167 INFO L87 Difference]: Start difference. First operand 995 states and 1362 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 23:40:45,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:40:45,372 INFO L93 Difference]: Finished difference Result 3179 states and 4385 transitions. [2022-07-19 23:40:45,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 23:40:45,373 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2022-07-19 23:40:45,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:40:45,384 INFO L225 Difference]: With dead ends: 3179 [2022-07-19 23:40:45,385 INFO L226 Difference]: Without dead ends: 2191 [2022-07-19 23:40:45,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 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-19 23:40:45,389 INFO L413 NwaCegarLoop]: 736 mSDtfsCounter, 1293 mSDsluCounter, 2091 mSDsCounter, 0 mSdLazyCounter, 1548 mSolverCounterSat, 545 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1355 SdHoareTripleChecker+Valid, 2827 SdHoareTripleChecker+Invalid, 2093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 545 IncrementalHoareTripleChecker+Valid, 1548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-19 23:40:45,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1355 Valid, 2827 Invalid, 2093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [545 Valid, 1548 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-19 23:40:45,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2191 states. [2022-07-19 23:40:45,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2191 to 2022. [2022-07-19 23:40:45,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2022 states, 1499 states have (on average 1.3328885923949298) internal successors, (1998), 1533 states have internal predecessors, (1998), 379 states have call successors, (379), 134 states have call predecessors, (379), 143 states have return successors, (405), 374 states have call predecessors, (405), 378 states have call successors, (405) [2022-07-19 23:40:45,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 2022 states and 2782 transitions. [2022-07-19 23:40:45,477 INFO L78 Accepts]: Start accepts. Automaton has 2022 states and 2782 transitions. Word has length 41 [2022-07-19 23:40:45,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:40:45,478 INFO L495 AbstractCegarLoop]: Abstraction has 2022 states and 2782 transitions. [2022-07-19 23:40:45,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 23:40:45,478 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 2782 transitions. [2022-07-19 23:40:45,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-19 23:40:45,485 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:40:45,486 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 23:40:45,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 23:40:45,486 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:40:45,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:40:45,487 INFO L85 PathProgramCache]: Analyzing trace with hash 79979308, now seen corresponding path program 1 times [2022-07-19 23:40:45,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:40:45,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405254198] [2022-07-19 23:40:45,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:40:45,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:40:45,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:45,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:40:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:45,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:40:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:45,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 23:40:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:45,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:45,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:40:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:45,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:45,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:45,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:45,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:45,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 23:40:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:45,771 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 23:40:45,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:40:45,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405254198] [2022-07-19 23:40:45,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405254198] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:40:45,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:40:45,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 23:40:45,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233634673] [2022-07-19 23:40:45,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:40:45,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 23:40:45,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:40:45,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 23:40:45,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 23:40:45,773 INFO L87 Difference]: Start difference. First operand 2022 states and 2782 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-19 23:40:46,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:40:46,956 INFO L93 Difference]: Finished difference Result 4446 states and 6148 transitions. [2022-07-19 23:40:46,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 23:40:46,957 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 94 [2022-07-19 23:40:46,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:40:46,969 INFO L225 Difference]: With dead ends: 4446 [2022-07-19 23:40:46,970 INFO L226 Difference]: Without dead ends: 2437 [2022-07-19 23:40:46,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-19 23:40:46,980 INFO L413 NwaCegarLoop]: 662 mSDtfsCounter, 528 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 1711 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-19 23:40:46,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 1711 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-19 23:40:46,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2437 states. [2022-07-19 23:40:47,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2437 to 2255. [2022-07-19 23:40:47,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2255 states, 1689 states have (on average 1.3510953226761397) internal successors, (2282), 1741 states have internal predecessors, (2282), 404 states have call successors, (404), 148 states have call predecessors, (404), 161 states have return successors, (434), 389 states have call predecessors, (434), 403 states have call successors, (434) [2022-07-19 23:40:47,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 2255 states and 3120 transitions. [2022-07-19 23:40:47,068 INFO L78 Accepts]: Start accepts. Automaton has 2255 states and 3120 transitions. Word has length 94 [2022-07-19 23:40:47,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:40:47,070 INFO L495 AbstractCegarLoop]: Abstraction has 2255 states and 3120 transitions. [2022-07-19 23:40:47,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-19 23:40:47,070 INFO L276 IsEmpty]: Start isEmpty. Operand 2255 states and 3120 transitions. [2022-07-19 23:40:47,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-19 23:40:47,076 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:40:47,077 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 23:40:47,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 23:40:47,077 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:40:47,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:40:47,078 INFO L85 PathProgramCache]: Analyzing trace with hash 278080431, now seen corresponding path program 1 times [2022-07-19 23:40:47,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:40:47,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311110102] [2022-07-19 23:40:47,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:40:47,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:40:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:47,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:40:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:47,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:40:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:47,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 23:40:47,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:47,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 23:40:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:47,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:47,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:40:47,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:47,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:47,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:47,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:47,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:47,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:47,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:47,409 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 23:40:47,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:40:47,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311110102] [2022-07-19 23:40:47,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311110102] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:40:47,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:40:47,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 23:40:47,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804828668] [2022-07-19 23:40:47,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:40:47,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 23:40:47,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:40:47,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 23:40:47,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 23:40:47,413 INFO L87 Difference]: Start difference. First operand 2255 states and 3120 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-19 23:40:48,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:40:48,901 INFO L93 Difference]: Finished difference Result 5212 states and 7184 transitions. [2022-07-19 23:40:48,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 23:40:48,901 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 106 [2022-07-19 23:40:48,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:40:48,917 INFO L225 Difference]: With dead ends: 5212 [2022-07-19 23:40:48,917 INFO L226 Difference]: Without dead ends: 2981 [2022-07-19 23:40:48,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-19 23:40:48,925 INFO L413 NwaCegarLoop]: 755 mSDtfsCounter, 793 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 310 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-19 23:40:48,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 1695 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [310 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-19 23:40:48,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2022-07-19 23:40:49,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 2779. [2022-07-19 23:40:49,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2779 states, 2097 states have (on average 1.3471626132570338) internal successors, (2825), 2165 states have internal predecessors, (2825), 458 states have call successors, (458), 210 states have call predecessors, (458), 223 states have return successors, (487), 431 states have call predecessors, (487), 457 states have call successors, (487) [2022-07-19 23:40:49,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2779 states to 2779 states and 3770 transitions. [2022-07-19 23:40:49,061 INFO L78 Accepts]: Start accepts. Automaton has 2779 states and 3770 transitions. Word has length 106 [2022-07-19 23:40:49,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:40:49,064 INFO L495 AbstractCegarLoop]: Abstraction has 2779 states and 3770 transitions. [2022-07-19 23:40:49,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-19 23:40:49,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2779 states and 3770 transitions. [2022-07-19 23:40:49,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-19 23:40:49,070 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:40:49,070 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 23:40:49,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 23:40:49,072 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:40:49,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:40:49,074 INFO L85 PathProgramCache]: Analyzing trace with hash 954173882, now seen corresponding path program 1 times [2022-07-19 23:40:49,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:40:49,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736198008] [2022-07-19 23:40:49,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:40:49,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:40:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:49,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:40:49,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:49,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:40:49,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:49,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 23:40:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:49,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 23:40:49,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:49,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 23:40:49,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:49,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:49,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:49,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 23:40:49,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:49,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:49,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:49,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:40:49,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:49,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:49,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:49,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:49,348 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 23:40:49,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:40:49,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736198008] [2022-07-19 23:40:49,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736198008] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:40:49,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:40:49,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 23:40:49,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535982563] [2022-07-19 23:40:49,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:40:49,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 23:40:49,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:40:49,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 23:40:49,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-19 23:40:49,351 INFO L87 Difference]: Start difference. First operand 2779 states and 3770 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (13), 6 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-19 23:40:51,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:40:51,010 INFO L93 Difference]: Finished difference Result 6440 states and 8808 transitions. [2022-07-19 23:40:51,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 23:40:51,011 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (13), 6 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 132 [2022-07-19 23:40:51,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:40:51,030 INFO L225 Difference]: With dead ends: 6440 [2022-07-19 23:40:51,031 INFO L226 Difference]: Without dead ends: 3685 [2022-07-19 23:40:51,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-19 23:40:51,040 INFO L413 NwaCegarLoop]: 781 mSDtfsCounter, 820 mSDsluCounter, 1379 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 2160 SdHoareTripleChecker+Invalid, 1551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-19 23:40:51,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 2160 Invalid, 1551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-19 23:40:51,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3685 states. [2022-07-19 23:40:51,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3685 to 3329. [2022-07-19 23:40:51,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3329 states, 2519 states have (on average 1.349741961095673) internal successors, (3400), 2607 states have internal predecessors, (3400), 538 states have call successors, (538), 258 states have call predecessors, (538), 271 states have return successors, (567), 499 states have call predecessors, (567), 537 states have call successors, (567) [2022-07-19 23:40:51,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4505 transitions. [2022-07-19 23:40:51,185 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4505 transitions. Word has length 132 [2022-07-19 23:40:51,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:40:51,186 INFO L495 AbstractCegarLoop]: Abstraction has 3329 states and 4505 transitions. [2022-07-19 23:40:51,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (13), 6 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-19 23:40:51,186 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4505 transitions. [2022-07-19 23:40:51,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-07-19 23:40:51,194 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:40:51,194 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 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] [2022-07-19 23:40:51,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 23:40:51,195 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:40:51,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:40:51,195 INFO L85 PathProgramCache]: Analyzing trace with hash -984455087, now seen corresponding path program 1 times [2022-07-19 23:40:51,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:40:51,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900388749] [2022-07-19 23:40:51,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:40:51,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:40:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:51,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:40:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:51,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:40:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:51,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 23:40:51,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:51,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 23:40:51,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:51,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 23:40:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:51,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:51,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:51,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 23:40:51,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:51,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 23:40:51,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:51,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:51,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:40:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:51,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:51,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:51,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:51,987 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-19 23:40:51,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:40:51,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900388749] [2022-07-19 23:40:51,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900388749] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:40:51,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:40:51,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 23:40:51,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141301904] [2022-07-19 23:40:51,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:40:51,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 23:40:51,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:40:51,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 23:40:51,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-19 23:40:51,990 INFO L87 Difference]: Start difference. First operand 3329 states and 4505 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-19 23:40:53,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:40:53,867 INFO L93 Difference]: Finished difference Result 6957 states and 9512 transitions. [2022-07-19 23:40:53,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 23:40:53,867 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 1 states have call successors, (13) Word has length 155 [2022-07-19 23:40:53,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:40:53,888 INFO L225 Difference]: With dead ends: 6957 [2022-07-19 23:40:53,889 INFO L226 Difference]: Without dead ends: 3652 [2022-07-19 23:40:53,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-07-19 23:40:53,903 INFO L413 NwaCegarLoop]: 639 mSDtfsCounter, 734 mSDsluCounter, 1830 mSDsCounter, 0 mSdLazyCounter, 1421 mSolverCounterSat, 510 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 2469 SdHoareTripleChecker+Invalid, 1931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 510 IncrementalHoareTripleChecker+Valid, 1421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-19 23:40:53,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 2469 Invalid, 1931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [510 Valid, 1421 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-19 23:40:53,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3652 states. [2022-07-19 23:40:54,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3652 to 3329. [2022-07-19 23:40:54,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3329 states, 2515 states have (on average 1.347117296222664) internal successors, (3388), 2605 states have internal predecessors, (3388), 538 states have call successors, (538), 258 states have call predecessors, (538), 275 states have return successors, (571), 501 states have call predecessors, (571), 537 states have call successors, (571) [2022-07-19 23:40:54,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4497 transitions. [2022-07-19 23:40:54,047 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4497 transitions. Word has length 155 [2022-07-19 23:40:54,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:40:54,048 INFO L495 AbstractCegarLoop]: Abstraction has 3329 states and 4497 transitions. [2022-07-19 23:40:54,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-19 23:40:54,049 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4497 transitions. [2022-07-19 23:40:54,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-19 23:40:54,057 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:40:54,057 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 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] [2022-07-19 23:40:54,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 23:40:54,058 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:40:54,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:40:54,058 INFO L85 PathProgramCache]: Analyzing trace with hash -273480105, now seen corresponding path program 1 times [2022-07-19 23:40:54,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:40:54,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306557566] [2022-07-19 23:40:54,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:40:54,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:40:54,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:54,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:40:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:54,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:40:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:54,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 23:40:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:54,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 23:40:54,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:54,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 23:40:54,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:54,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:54,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 23:40:54,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:54,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 23:40:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:54,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:54,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:40:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:54,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:54,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:54,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:54,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:54,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:40:54,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:54,458 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-19 23:40:54,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:40:54,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306557566] [2022-07-19 23:40:54,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306557566] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:40:54,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67347634] [2022-07-19 23:40:54,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:40:54,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:40:54,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:40:54,463 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-19 23:40:54,503 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-19 23:40:54,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:54,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 2762 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 23:40:55,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:40:55,156 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-19 23:40:55,156 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 23:40:55,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67347634] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:40:55,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 23:40:55,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-07-19 23:40:55,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052817199] [2022-07-19 23:40:55,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:40:55,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 23:40:55,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:40:55,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 23:40:55,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-19 23:40:55,159 INFO L87 Difference]: Start difference. First operand 3329 states and 4497 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-19 23:40:55,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:40:55,490 INFO L93 Difference]: Finished difference Result 8063 states and 10904 transitions. [2022-07-19 23:40:55,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 23:40:55,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 162 [2022-07-19 23:40:55,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:40:55,514 INFO L225 Difference]: With dead ends: 8063 [2022-07-19 23:40:55,514 INFO L226 Difference]: Without dead ends: 4758 [2022-07-19 23:40:55,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-07-19 23:40:55,526 INFO L413 NwaCegarLoop]: 1145 mSDtfsCounter, 725 mSDsluCounter, 2553 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 3698 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 23:40:55,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 3698 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 23:40:55,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4758 states. [2022-07-19 23:40:55,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4758 to 3353. [2022-07-19 23:40:55,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3353 states, 2531 states have (on average 1.3449229553536153) internal successors, (3404), 2617 states have internal predecessors, (3404), 546 states have call successors, (546), 258 states have call predecessors, (546), 275 states have return successors, (579), 509 states have call predecessors, (579), 545 states have call successors, (579) [2022-07-19 23:40:55,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3353 states to 3353 states and 4529 transitions. [2022-07-19 23:40:55,732 INFO L78 Accepts]: Start accepts. Automaton has 3353 states and 4529 transitions. Word has length 162 [2022-07-19 23:40:55,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:40:55,732 INFO L495 AbstractCegarLoop]: Abstraction has 3353 states and 4529 transitions. [2022-07-19 23:40:55,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-19 23:40:55,734 INFO L276 IsEmpty]: Start isEmpty. Operand 3353 states and 4529 transitions. [2022-07-19 23:40:55,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2022-07-19 23:40:55,742 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:40:55,742 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 23:40:55,774 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-19 23:40:55,963 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-19 23:40:55,964 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:40:55,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:40:55,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1352328716, now seen corresponding path program 1 times [2022-07-19 23:40:55,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:40:55,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205961912] [2022-07-19 23:40:55,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:40:55,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:40:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:56,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:40:56,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:56,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:40:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:56,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 23:40:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:56,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 23:40:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:56,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 23:40:56,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:56,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:56,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 23:40:56,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:56,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:56,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:56,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 23:40:56,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:56,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:56,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:56,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 23:40:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:56,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:56,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-19 23:40:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:56,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-19 23:40:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:56,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 23:40:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:56,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-19 23:40:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:56,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-19 23:40:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:56,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:56,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:40:56,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:56,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:56,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:56,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:56,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:40:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:56,288 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-07-19 23:40:56,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:40:56,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205961912] [2022-07-19 23:40:56,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205961912] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:40:56,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:40:56,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 23:40:56,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395138186] [2022-07-19 23:40:56,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:40:56,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 23:40:56,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:40:56,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 23:40:56,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-19 23:40:56,291 INFO L87 Difference]: Start difference. First operand 3353 states and 4529 transitions. Second operand has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 3 states have internal predecessors, (144), 2 states have call successors, (22), 6 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-19 23:40:57,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:40:57,677 INFO L93 Difference]: Finished difference Result 7005 states and 9528 transitions. [2022-07-19 23:40:57,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 23:40:57,677 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 3 states have internal predecessors, (144), 2 states have call successors, (22), 6 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 231 [2022-07-19 23:40:57,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:40:57,702 INFO L225 Difference]: With dead ends: 7005 [2022-07-19 23:40:57,702 INFO L226 Difference]: Without dead ends: 3676 [2022-07-19 23:40:57,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-19 23:40:57,714 INFO L413 NwaCegarLoop]: 641 mSDtfsCounter, 410 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 1927 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-19 23:40:57,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 1927 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-19 23:40:57,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3676 states. [2022-07-19 23:40:57,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3676 to 3357. [2022-07-19 23:40:57,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3357 states, 2535 states have (on average 1.344378698224852) internal successors, (3408), 2621 states have internal predecessors, (3408), 546 states have call successors, (546), 258 states have call predecessors, (546), 275 states have return successors, (579), 509 states have call predecessors, (579), 545 states have call successors, (579) [2022-07-19 23:40:57,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3357 states to 3357 states and 4533 transitions. [2022-07-19 23:40:57,898 INFO L78 Accepts]: Start accepts. Automaton has 3357 states and 4533 transitions. Word has length 231 [2022-07-19 23:40:57,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:40:57,898 INFO L495 AbstractCegarLoop]: Abstraction has 3357 states and 4533 transitions. [2022-07-19 23:40:57,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 3 states have internal predecessors, (144), 2 states have call successors, (22), 6 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-19 23:40:57,899 INFO L276 IsEmpty]: Start isEmpty. Operand 3357 states and 4533 transitions. [2022-07-19 23:40:57,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2022-07-19 23:40:57,907 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:40:57,907 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 23:40:57,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 23:40:57,908 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:40:57,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:40:57,908 INFO L85 PathProgramCache]: Analyzing trace with hash 51540470, now seen corresponding path program 1 times [2022-07-19 23:40:57,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:40:57,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368073842] [2022-07-19 23:40:57,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:40:57,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:40:57,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:58,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:40:58,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:58,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:40:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:58,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 23:40:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:58,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 23:40:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:58,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 23:40:58,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:58,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:58,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 23:40:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:58,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:58,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:58,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 23:40:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:58,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:58,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 23:40:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:58,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:58,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-19 23:40:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:58,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-19 23:40:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:58,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 23:40:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:58,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-19 23:40:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:58,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-19 23:40:58,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:58,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:58,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:58,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:40:58,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:58,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:58,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:58,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:58,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:58,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:58,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:40:58,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:58,313 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-07-19 23:40:58,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:40:58,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368073842] [2022-07-19 23:40:58,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368073842] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:40:58,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739267852] [2022-07-19 23:40:58,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:40:58,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:40:58,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:40:58,315 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-19 23:40:58,346 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-19 23:40:59,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:59,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 3318 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 23:40:59,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:40:59,348 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-19 23:40:59,348 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 23:40:59,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739267852] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:40:59,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 23:40:59,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-07-19 23:40:59,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358958936] [2022-07-19 23:40:59,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:40:59,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 23:40:59,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:40:59,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 23:40:59,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-19 23:40:59,351 INFO L87 Difference]: Start difference. First operand 3357 states and 4533 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 4 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-19 23:40:59,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:40:59,728 INFO L93 Difference]: Finished difference Result 4833 states and 6532 transitions. [2022-07-19 23:40:59,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 23:40:59,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 4 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 231 [2022-07-19 23:40:59,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:40:59,746 INFO L225 Difference]: With dead ends: 4833 [2022-07-19 23:40:59,747 INFO L226 Difference]: Without dead ends: 4824 [2022-07-19 23:40:59,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-19 23:40:59,750 INFO L413 NwaCegarLoop]: 1170 mSDtfsCounter, 1052 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1052 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 23:40:59,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1052 Valid, 1535 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 23:40:59,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4824 states. [2022-07-19 23:40:59,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4824 to 4061. [2022-07-19 23:40:59,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4061 states, 3060 states have (on average 1.3395424836601306) internal successors, (4099), 3158 states have internal predecessors, (4099), 676 states have call successors, (676), 307 states have call predecessors, (676), 324 states have return successors, (709), 633 states have call predecessors, (709), 675 states have call successors, (709) [2022-07-19 23:40:59,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4061 states to 4061 states and 5484 transitions. [2022-07-19 23:40:59,946 INFO L78 Accepts]: Start accepts. Automaton has 4061 states and 5484 transitions. Word has length 231 [2022-07-19 23:40:59,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:40:59,947 INFO L495 AbstractCegarLoop]: Abstraction has 4061 states and 5484 transitions. [2022-07-19 23:40:59,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 4 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-19 23:40:59,947 INFO L276 IsEmpty]: Start isEmpty. Operand 4061 states and 5484 transitions. [2022-07-19 23:40:59,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-07-19 23:40:59,956 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:40:59,957 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 23:40:59,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 23:41:00,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-19 23:41:00,168 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:41:00,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:41:00,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1538441839, now seen corresponding path program 1 times [2022-07-19 23:41:00,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:41:00,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582651003] [2022-07-19 23:41:00,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:41:00,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:41:00,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:00,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:41:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:00,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:41:00,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:00,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 23:41:00,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:00,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 23:41:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:00,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 23:41:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:00,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:00,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 23:41:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:00,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:00,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:00,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 23:41:00,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:00,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:00,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:00,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 23:41:00,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:00,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:00,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:00,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-19 23:41:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:00,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-19 23:41:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:00,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 23:41:00,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:00,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-19 23:41:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:00,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-19 23:41:00,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:00,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:00,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:41:00,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:00,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:00,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:00,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:00,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:00,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:00,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:00,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:41:00,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:00,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-19 23:41:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:00,615 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 24 proven. 19 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-07-19 23:41:00,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:41:00,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582651003] [2022-07-19 23:41:00,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582651003] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:41:00,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105020479] [2022-07-19 23:41:00,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:41:00,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:41:00,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:41:00,620 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 23:41:00,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 23:41:01,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:01,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 3405 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 23:41:01,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:41:01,564 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-07-19 23:41:01,564 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 23:41:01,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105020479] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:41:01,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 23:41:01,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2022-07-19 23:41:01,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776052955] [2022-07-19 23:41:01,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:41:01,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 23:41:01,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:41:01,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 23:41:01,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-07-19 23:41:01,566 INFO L87 Difference]: Start difference. First operand 4061 states and 5484 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 3 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2022-07-19 23:41:01,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:41:01,786 INFO L93 Difference]: Finished difference Result 8098 states and 10942 transitions. [2022-07-19 23:41:01,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 23:41:01,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 3 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 241 [2022-07-19 23:41:01,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:41:01,806 INFO L225 Difference]: With dead ends: 8098 [2022-07-19 23:41:01,806 INFO L226 Difference]: Without dead ends: 3953 [2022-07-19 23:41:01,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-07-19 23:41:01,815 INFO L413 NwaCegarLoop]: 869 mSDtfsCounter, 520 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1555 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 23:41:01,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 1555 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 23:41:01,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3953 states. [2022-07-19 23:41:01,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3953 to 3953. [2022-07-19 23:41:02,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3953 states, 2970 states have (on average 1.3282828282828283) internal successors, (3945), 3060 states have internal predecessors, (3945), 664 states have call successors, (664), 301 states have call predecessors, (664), 318 states have return successors, (697), 627 states have call predecessors, (697), 663 states have call successors, (697) [2022-07-19 23:41:02,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3953 states to 3953 states and 5306 transitions. [2022-07-19 23:41:02,027 INFO L78 Accepts]: Start accepts. Automaton has 3953 states and 5306 transitions. Word has length 241 [2022-07-19 23:41:02,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:41:02,028 INFO L495 AbstractCegarLoop]: Abstraction has 3953 states and 5306 transitions. [2022-07-19 23:41:02,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 3 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2022-07-19 23:41:02,028 INFO L276 IsEmpty]: Start isEmpty. Operand 3953 states and 5306 transitions. [2022-07-19 23:41:02,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-07-19 23:41:02,038 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:41:02,038 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 23:41:02,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 23:41:02,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:41:02,264 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:41:02,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:41:02,265 INFO L85 PathProgramCache]: Analyzing trace with hash 2035606035, now seen corresponding path program 1 times [2022-07-19 23:41:02,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:41:02,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258160815] [2022-07-19 23:41:02,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:41:02,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:41:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:02,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:41:02,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:02,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:41:02,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:02,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 23:41:02,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:02,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 23:41:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:02,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 23:41:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:02,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:02,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:02,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 23:41:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:02,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:02,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:02,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 23:41:02,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:02,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:02,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 23:41:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:02,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:02,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-19 23:41:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:02,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-19 23:41:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:02,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 23:41:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:02,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-19 23:41:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:02,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-19 23:41:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:02,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:02,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:41:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:02,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:02,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:02,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:02,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:02,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:41:02,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:02,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-19 23:41:02,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:02,570 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-07-19 23:41:02,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:41:02,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258160815] [2022-07-19 23:41:02,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258160815] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:41:02,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:41:02,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 23:41:02,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703508399] [2022-07-19 23:41:02,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:41:02,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 23:41:02,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:41:02,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 23:41:02,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-19 23:41:02,573 INFO L87 Difference]: Start difference. First operand 3953 states and 5306 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 3 states have internal predecessors, (146), 2 states have call successors, (23), 6 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-19 23:41:04,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:41:04,334 INFO L93 Difference]: Finished difference Result 6097 states and 8211 transitions. [2022-07-19 23:41:04,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 23:41:04,335 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 3 states have internal predecessors, (146), 2 states have call successors, (23), 6 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 241 [2022-07-19 23:41:04,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:41:04,343 INFO L225 Difference]: With dead ends: 6097 [2022-07-19 23:41:04,343 INFO L226 Difference]: Without dead ends: 2167 [2022-07-19 23:41:04,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-19 23:41:04,354 INFO L413 NwaCegarLoop]: 641 mSDtfsCounter, 247 mSDsluCounter, 1561 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 2202 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-19 23:41:04,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 2202 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1121 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-19 23:41:04,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2167 states. [2022-07-19 23:41:04,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2167 to 1991. [2022-07-19 23:41:04,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1991 states, 1496 states have (on average 1.3241978609625669) internal successors, (1981), 1541 states have internal predecessors, (1981), 333 states have call successors, (333), 153 states have call predecessors, (333), 161 states have return successors, (349), 314 states have call predecessors, (349), 332 states have call successors, (349) [2022-07-19 23:41:04,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1991 states to 1991 states and 2663 transitions. [2022-07-19 23:41:04,451 INFO L78 Accepts]: Start accepts. Automaton has 1991 states and 2663 transitions. Word has length 241 [2022-07-19 23:41:04,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:41:04,451 INFO L495 AbstractCegarLoop]: Abstraction has 1991 states and 2663 transitions. [2022-07-19 23:41:04,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 3 states have internal predecessors, (146), 2 states have call successors, (23), 6 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-19 23:41:04,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1991 states and 2663 transitions. [2022-07-19 23:41:04,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2022-07-19 23:41:04,460 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:41:04,460 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 23:41:04,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 23:41:04,460 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:41:04,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:41:04,461 INFO L85 PathProgramCache]: Analyzing trace with hash -2082821067, now seen corresponding path program 1 times [2022-07-19 23:41:04,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:41:04,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061412921] [2022-07-19 23:41:04,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:41:04,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:41:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:04,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:41:04,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:04,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:41:04,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:04,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 23:41:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:04,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 23:41:04,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:04,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 23:41:04,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:04,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:04,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:04,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 23:41:04,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:04,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:04,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:04,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 23:41:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:04,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:04,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:04,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 23:41:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:04,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:04,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-19 23:41:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:04,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-19 23:41:04,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:04,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 23:41:04,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:04,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-19 23:41:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:04,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-19 23:41:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:04,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:04,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:04,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:41:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:04,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:04,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:04,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:04,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:04,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:41:04,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:04,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-07-19 23:41:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:04,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:04,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:04,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:41:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:04,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:41:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:04,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:41:04,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:04,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 23:41:04,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:04,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 23:41:04,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:04,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 23:41:04,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:05,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 23:41:05,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:05,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 23:41:05,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:05,020 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2022-07-19 23:41:05,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:41:05,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061412921] [2022-07-19 23:41:05,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061412921] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:41:05,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:41:05,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 23:41:05,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037094960] [2022-07-19 23:41:05,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:41:05,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 23:41:05,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:41:05,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 23:41:05,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-07-19 23:41:05,024 INFO L87 Difference]: Start difference. First operand 1991 states and 2663 transitions. Second operand has 11 states, 11 states have (on average 15.909090909090908) internal successors, (175), 5 states have internal predecessors, (175), 2 states have call successors, (32), 8 states have call predecessors, (32), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2022-07-19 23:41:07,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:41:07,826 INFO L93 Difference]: Finished difference Result 5156 states and 6960 transitions. [2022-07-19 23:41:07,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 23:41:07,827 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.909090909090908) internal successors, (175), 5 states have internal predecessors, (175), 2 states have call successors, (32), 8 states have call predecessors, (32), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 299 [2022-07-19 23:41:07,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:41:07,838 INFO L225 Difference]: With dead ends: 5156 [2022-07-19 23:41:07,838 INFO L226 Difference]: Without dead ends: 3262 [2022-07-19 23:41:07,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2022-07-19 23:41:07,845 INFO L413 NwaCegarLoop]: 1085 mSDtfsCounter, 1623 mSDsluCounter, 2902 mSDsCounter, 0 mSdLazyCounter, 2507 mSolverCounterSat, 875 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1669 SdHoareTripleChecker+Valid, 3987 SdHoareTripleChecker+Invalid, 3382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 875 IncrementalHoareTripleChecker+Valid, 2507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-19 23:41:07,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1669 Valid, 3987 Invalid, 3382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [875 Valid, 2507 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-07-19 23:41:07,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2022-07-19 23:41:07,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 2007. [2022-07-19 23:41:07,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2007 states, 1510 states have (on average 1.323841059602649) internal successors, (1999), 1555 states have internal predecessors, (1999), 335 states have call successors, (335), 153 states have call predecessors, (335), 161 states have return successors, (351), 316 states have call predecessors, (351), 334 states have call successors, (351) [2022-07-19 23:41:07,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 2685 transitions. [2022-07-19 23:41:07,961 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 2685 transitions. Word has length 299 [2022-07-19 23:41:07,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:41:07,961 INFO L495 AbstractCegarLoop]: Abstraction has 2007 states and 2685 transitions. [2022-07-19 23:41:07,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.909090909090908) internal successors, (175), 5 states have internal predecessors, (175), 2 states have call successors, (32), 8 states have call predecessors, (32), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2022-07-19 23:41:07,962 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 2685 transitions. [2022-07-19 23:41:07,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2022-07-19 23:41:07,971 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:41:07,971 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 23:41:07,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-19 23:41:07,971 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:41:07,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:41:07,972 INFO L85 PathProgramCache]: Analyzing trace with hash 461066554, now seen corresponding path program 1 times [2022-07-19 23:41:07,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:41:07,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037349061] [2022-07-19 23:41:07,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:41:07,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:41:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:08,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:41:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:08,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:41:08,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:08,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 23:41:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:08,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 23:41:08,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:08,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 23:41:08,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:08,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:08,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:08,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 23:41:08,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:08,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:08,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:08,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 23:41:08,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:08,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:08,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:08,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 23:41:08,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:08,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:08,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:08,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-19 23:41:08,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:08,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-19 23:41:08,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:08,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 23:41:08,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:08,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-19 23:41:08,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:08,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-19 23:41:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:08,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:08,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:41:08,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:08,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:08,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:08,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:08,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:08,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:41:08,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:08,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-19 23:41:08,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:08,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:08,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:41:08,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:08,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:41:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:08,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:41:08,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:08,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 23:41:08,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:08,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 23:41:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:08,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 23:41:08,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:08,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 23:41:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:08,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 23:41:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:08,696 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 35 proven. 14 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-07-19 23:41:08,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:41:08,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037349061] [2022-07-19 23:41:08,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037349061] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:41:08,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388411073] [2022-07-19 23:41:08,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:41:08,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:41:08,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:41:08,700 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 23:41:08,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 23:41:09,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:09,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 3671 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-19 23:41:09,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:41:09,491 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-07-19 23:41:09,491 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 23:41:09,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388411073] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:41:09,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 23:41:09,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 18 [2022-07-19 23:41:09,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803854202] [2022-07-19 23:41:09,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:41:09,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 23:41:09,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:41:09,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 23:41:09,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2022-07-19 23:41:09,493 INFO L87 Difference]: Start difference. First operand 2007 states and 2685 transitions. Second operand has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2022-07-19 23:41:09,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:41:09,846 INFO L93 Difference]: Finished difference Result 5435 states and 7380 transitions. [2022-07-19 23:41:09,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 23:41:09,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 301 [2022-07-19 23:41:09,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:41:09,858 INFO L225 Difference]: With dead ends: 5435 [2022-07-19 23:41:09,858 INFO L226 Difference]: Without dead ends: 3525 [2022-07-19 23:41:09,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2022-07-19 23:41:09,865 INFO L413 NwaCegarLoop]: 1327 mSDtfsCounter, 1119 mSDsluCounter, 3191 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1120 SdHoareTripleChecker+Valid, 4518 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 23:41:09,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1120 Valid, 4518 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 23:41:09,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3525 states. [2022-07-19 23:41:10,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3525 to 2007. [2022-07-19 23:41:10,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2007 states, 1510 states have (on average 1.323841059602649) internal successors, (1999), 1555 states have internal predecessors, (1999), 335 states have call successors, (335), 153 states have call predecessors, (335), 161 states have return successors, (351), 316 states have call predecessors, (351), 334 states have call successors, (351) [2022-07-19 23:41:10,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 2685 transitions. [2022-07-19 23:41:10,021 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 2685 transitions. Word has length 301 [2022-07-19 23:41:10,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:41:10,021 INFO L495 AbstractCegarLoop]: Abstraction has 2007 states and 2685 transitions. [2022-07-19 23:41:10,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2022-07-19 23:41:10,022 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 2685 transitions. [2022-07-19 23:41:10,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2022-07-19 23:41:10,030 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:41:10,030 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 23:41:10,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 23:41:10,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:41:10,244 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:41:10,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:41:10,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1773182242, now seen corresponding path program 1 times [2022-07-19 23:41:10,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:41:10,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329392135] [2022-07-19 23:41:10,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:41:10,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:41:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:10,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:41:10,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:10,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:41:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:10,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 23:41:10,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:10,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 23:41:10,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:10,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 23:41:10,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:10,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:10,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:10,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 23:41:10,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:10,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:10,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:10,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 23:41:10,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:10,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:10,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 23:41:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:10,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:10,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:10,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-19 23:41:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:10,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-19 23:41:10,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:10,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 23:41:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:10,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-19 23:41:10,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:10,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-19 23:41:10,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:10,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-19 23:41:10,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:10,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-19 23:41:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:10,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:10,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:41:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:10,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:10,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:10,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:10,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:41:10,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:10,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-19 23:41:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:10,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:10,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:10,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:41:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:10,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:41:10,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:10,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:41:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:10,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 23:41:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:10,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 23:41:10,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:10,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 23:41:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:10,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 23:41:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:10,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 23:41:10,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:10,848 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 35 proven. 14 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2022-07-19 23:41:10,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:41:10,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329392135] [2022-07-19 23:41:10,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329392135] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:41:10,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777793281] [2022-07-19 23:41:10,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:41:10,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:41:10,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:41:10,850 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 23:41:10,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 23:41:11,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:11,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 3705 conjuncts, 381 conjunts are in the unsatisfiable core [2022-07-19 23:41:11,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:41:12,311 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-07-19 23:41:12,311 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 23:41:12,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777793281] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:41:12,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 23:41:12,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [15] total 32 [2022-07-19 23:41:12,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632821401] [2022-07-19 23:41:12,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:41:12,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-19 23:41:12,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:41:12,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-19 23:41:12,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=879, Unknown=0, NotChecked=0, Total=992 [2022-07-19 23:41:12,314 INFO L87 Difference]: Start difference. First operand 2007 states and 2685 transitions. Second operand has 19 states, 19 states have (on average 10.105263157894736) internal successors, (192), 14 states have internal predecessors, (192), 5 states have call successors, (35), 3 states have call predecessors, (35), 7 states have return successors, (34), 7 states have call predecessors, (34), 5 states have call successors, (34) [2022-07-19 23:41:15,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:41:15,519 INFO L93 Difference]: Finished difference Result 6897 states and 9442 transitions. [2022-07-19 23:41:15,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-19 23:41:15,519 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 10.105263157894736) internal successors, (192), 14 states have internal predecessors, (192), 5 states have call successors, (35), 3 states have call predecessors, (35), 7 states have return successors, (34), 7 states have call predecessors, (34), 5 states have call successors, (34) Word has length 311 [2022-07-19 23:41:15,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:41:15,536 INFO L225 Difference]: With dead ends: 6897 [2022-07-19 23:41:15,536 INFO L226 Difference]: Without dead ends: 4987 [2022-07-19 23:41:15,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=179, Invalid=1381, Unknown=0, NotChecked=0, Total=1560 [2022-07-19 23:41:15,544 INFO L413 NwaCegarLoop]: 802 mSDtfsCounter, 3304 mSDsluCounter, 7861 mSDsCounter, 0 mSdLazyCounter, 4447 mSolverCounterSat, 510 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3364 SdHoareTripleChecker+Valid, 8663 SdHoareTripleChecker+Invalid, 4957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 510 IncrementalHoareTripleChecker+Valid, 4447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-19 23:41:15,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3364 Valid, 8663 Invalid, 4957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [510 Valid, 4447 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-19 23:41:15,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4987 states. [2022-07-19 23:41:15,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4987 to 3983. [2022-07-19 23:41:15,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3983 states, 2996 states have (on average 1.3227636849132176) internal successors, (3963), 3087 states have internal predecessors, (3963), 664 states have call successors, (664), 297 states have call predecessors, (664), 322 states have return successors, (718), 634 states have call predecessors, (718), 663 states have call successors, (718) [2022-07-19 23:41:15,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3983 states to 3983 states and 5345 transitions. [2022-07-19 23:41:15,839 INFO L78 Accepts]: Start accepts. Automaton has 3983 states and 5345 transitions. Word has length 311 [2022-07-19 23:41:15,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:41:15,840 INFO L495 AbstractCegarLoop]: Abstraction has 3983 states and 5345 transitions. [2022-07-19 23:41:15,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.105263157894736) internal successors, (192), 14 states have internal predecessors, (192), 5 states have call successors, (35), 3 states have call predecessors, (35), 7 states have return successors, (34), 7 states have call predecessors, (34), 5 states have call successors, (34) [2022-07-19 23:41:15,840 INFO L276 IsEmpty]: Start isEmpty. Operand 3983 states and 5345 transitions. [2022-07-19 23:41:15,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2022-07-19 23:41:15,853 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:41:15,853 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 23:41:15,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-19 23:41:16,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-19 23:41:16,068 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:41:16,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:41:16,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1153675596, now seen corresponding path program 1 times [2022-07-19 23:41:16,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:41:16,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404964360] [2022-07-19 23:41:16,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:41:16,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:41:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:41:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:41:16,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 23:41:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 23:41:16,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 23:41:16,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:16,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:41:16,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 23:41:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-19 23:41:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 23:41:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:41:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-19 23:41:16,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-19 23:41:16,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-19 23:41:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-19 23:41:16,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-19 23:41:16,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-19 23:41:16,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-19 23:41:16,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:16,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:41:16,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:16,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:41:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-19 23:41:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:16,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:41:16,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:41:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:41:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 23:41:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 23:41:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 23:41:16,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 23:41:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 23:41:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,572 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 37 proven. 11 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2022-07-19 23:41:16,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:41:16,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404964360] [2022-07-19 23:41:16,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404964360] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:41:16,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319309608] [2022-07-19 23:41:16,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:41:16,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:41:16,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:41:16,575 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 23:41:16,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-19 23:41:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:17,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 3757 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-19 23:41:17,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:41:17,464 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-07-19 23:41:17,464 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 23:41:17,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319309608] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:41:17,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 23:41:17,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2022-07-19 23:41:17,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081547041] [2022-07-19 23:41:17,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:41:17,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 23:41:17,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:41:17,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 23:41:17,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-07-19 23:41:17,466 INFO L87 Difference]: Start difference. First operand 3983 states and 5345 transitions. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-07-19 23:41:17,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:41:17,660 INFO L93 Difference]: Finished difference Result 7928 states and 10656 transitions. [2022-07-19 23:41:17,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 23:41:17,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 323 [2022-07-19 23:41:17,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:41:17,674 INFO L225 Difference]: With dead ends: 7928 [2022-07-19 23:41:17,674 INFO L226 Difference]: Without dead ends: 4090 [2022-07-19 23:41:17,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-07-19 23:41:17,685 INFO L413 NwaCegarLoop]: 772 mSDtfsCounter, 231 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 23:41:17,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 1265 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 23:41:17,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4090 states. [2022-07-19 23:41:17,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4090 to 3983. [2022-07-19 23:41:17,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3983 states, 2996 states have (on average 1.3207610146862483) internal successors, (3957), 3081 states have internal predecessors, (3957), 664 states have call successors, (664), 297 states have call predecessors, (664), 322 states have return successors, (718), 634 states have call predecessors, (718), 663 states have call successors, (718) [2022-07-19 23:41:17,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3983 states to 3983 states and 5339 transitions. [2022-07-19 23:41:17,896 INFO L78 Accepts]: Start accepts. Automaton has 3983 states and 5339 transitions. Word has length 323 [2022-07-19 23:41:17,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:41:17,896 INFO L495 AbstractCegarLoop]: Abstraction has 3983 states and 5339 transitions. [2022-07-19 23:41:17,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-07-19 23:41:17,897 INFO L276 IsEmpty]: Start isEmpty. Operand 3983 states and 5339 transitions. [2022-07-19 23:41:17,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2022-07-19 23:41:17,910 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:41:17,910 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 23:41:17,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-19 23:41:18,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-19 23:41:18,124 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:41:18,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:41:18,124 INFO L85 PathProgramCache]: Analyzing trace with hash -287103134, now seen corresponding path program 1 times [2022-07-19 23:41:18,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:41:18,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559378933] [2022-07-19 23:41:18,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:41:18,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:41:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:18,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:41:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:18,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:41:18,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:18,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 23:41:18,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:18,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 23:41:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:18,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 23:41:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:18,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:18,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:41:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:18,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 23:41:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:18,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 23:41:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:18,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:18,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:18,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-19 23:41:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:18,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:18,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 23:41:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:18,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:18,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:18,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-19 23:41:18,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:18,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-19 23:41:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:18,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-19 23:41:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:18,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-19 23:41:18,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:18,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-19 23:41:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:18,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-19 23:41:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:18,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-19 23:41:18,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:18,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:18,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:18,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:41:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:18,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:18,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:18,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:18,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:18,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:41:18,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:18,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-07-19 23:41:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:18,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:18,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:18,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:41:18,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:18,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:41:18,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:18,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:41:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:18,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 23:41:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:18,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 23:41:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:18,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 23:41:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:18,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 23:41:18,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:18,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 23:41:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:18,757 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 37 proven. 11 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-07-19 23:41:18,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:41:18,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559378933] [2022-07-19 23:41:18,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559378933] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:41:18,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603497140] [2022-07-19 23:41:18,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:41:18,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:41:18,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:41:18,759 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 23:41:18,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-19 23:41:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:19,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 3825 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-19 23:41:19,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:41:19,654 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-07-19 23:41:19,654 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 23:41:19,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603497140] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:41:19,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 23:41:19,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 18 [2022-07-19 23:41:19,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572378778] [2022-07-19 23:41:19,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:41:19,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 23:41:19,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:41:19,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 23:41:19,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2022-07-19 23:41:19,657 INFO L87 Difference]: Start difference. First operand 3983 states and 5339 transitions. Second operand has 7 states, 7 states have (on average 27.857142857142858) internal successors, (195), 6 states have internal predecessors, (195), 2 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (35), 3 states have call predecessors, (35), 2 states have call successors, (35) [2022-07-19 23:41:20,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:41:20,189 INFO L93 Difference]: Finished difference Result 9217 states and 12606 transitions. [2022-07-19 23:41:20,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 23:41:20,192 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 27.857142857142858) internal successors, (195), 6 states have internal predecessors, (195), 2 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (35), 3 states have call predecessors, (35), 2 states have call successors, (35) Word has length 325 [2022-07-19 23:41:20,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:41:20,209 INFO L225 Difference]: With dead ends: 9217 [2022-07-19 23:41:20,209 INFO L226 Difference]: Without dead ends: 5379 [2022-07-19 23:41:20,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 390 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2022-07-19 23:41:20,221 INFO L413 NwaCegarLoop]: 1022 mSDtfsCounter, 554 mSDsluCounter, 4376 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 5398 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 23:41:20,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 5398 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 23:41:20,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5379 states. [2022-07-19 23:41:20,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5379 to 4007. [2022-07-19 23:41:20,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4007 states, 3017 states have (on average 1.31852833941001) internal successors, (3978), 3099 states have internal predecessors, (3978), 664 states have call successors, (664), 297 states have call predecessors, (664), 325 states have return successors, (730), 640 states have call predecessors, (730), 663 states have call successors, (730) [2022-07-19 23:41:20,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4007 states to 4007 states and 5372 transitions. [2022-07-19 23:41:20,617 INFO L78 Accepts]: Start accepts. Automaton has 4007 states and 5372 transitions. Word has length 325 [2022-07-19 23:41:20,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:41:20,618 INFO L495 AbstractCegarLoop]: Abstraction has 4007 states and 5372 transitions. [2022-07-19 23:41:20,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.857142857142858) internal successors, (195), 6 states have internal predecessors, (195), 2 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (35), 3 states have call predecessors, (35), 2 states have call successors, (35) [2022-07-19 23:41:20,619 INFO L276 IsEmpty]: Start isEmpty. Operand 4007 states and 5372 transitions. [2022-07-19 23:41:20,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2022-07-19 23:41:20,632 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:41:20,632 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 23:41:20,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-19 23:41:20,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:41:20,848 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:41:20,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:41:20,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1541062795, now seen corresponding path program 1 times [2022-07-19 23:41:20,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:41:20,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673275203] [2022-07-19 23:41:20,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:41:20,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:41:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:21,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:41:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:21,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:41:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:21,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 23:41:21,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:21,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 23:41:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:21,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 23:41:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:21,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:21,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:21,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:41:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:21,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 23:41:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:21,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 23:41:21,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:21,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:21,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:21,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-19 23:41:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:21,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:21,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 23:41:21,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:21,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:21,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-19 23:41:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:21,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:41:21,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:21,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-19 23:41:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:21,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-19 23:41:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:21,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-19 23:41:21,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:21,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-19 23:41:21,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:21,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-19 23:41:21,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:21,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-19 23:41:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:21,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:21,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:21,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:41:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:21,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:21,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:21,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:21,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:41:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:21,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-07-19 23:41:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:21,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:21,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:41:21,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:21,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:41:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:21,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:41:21,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:21,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 23:41:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:21,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 23:41:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:21,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 23:41:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:21,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 23:41:21,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:21,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 23:41:21,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:21,387 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 37 proven. 11 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2022-07-19 23:41:21,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:41:21,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673275203] [2022-07-19 23:41:21,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673275203] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:41:21,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619560046] [2022-07-19 23:41:21,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:41:21,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:41:21,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:41:21,389 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 23:41:21,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-19 23:41:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:22,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 3845 conjuncts, 307 conjunts are in the unsatisfiable core [2022-07-19 23:41:22,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:41:22,234 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 23:41:22,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-19 23:41:22,547 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 23:41:22,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-19 23:41:22,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-19 23:41:23,167 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 23:41:23,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 25 [2022-07-19 23:41:24,495 INFO L356 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2022-07-19 23:41:24,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-19 23:41:24,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 69 [2022-07-19 23:41:24,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 65 [2022-07-19 23:41:24,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 23:41:24,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 23 [2022-07-19 23:41:24,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 62 [2022-07-19 23:41:24,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 23:41:24,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-19 23:41:27,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 23:41:27,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 23:41:27,654 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 23:41:27,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2022-07-19 23:41:27,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-07-19 23:41:27,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 23:41:27,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2022-07-19 23:41:27,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 23:41:27,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2022-07-19 23:41:27,708 INFO L356 Elim1Store]: treesize reduction 21, result has 4.5 percent of original size [2022-07-19 23:41:27,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 84 [2022-07-19 23:41:29,318 INFO L356 Elim1Store]: treesize reduction 21, result has 4.5 percent of original size [2022-07-19 23:41:29,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 52 [2022-07-19 23:41:29,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-07-19 23:41:30,032 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-19 23:41:30,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 157 treesize of output 131 [2022-07-19 23:41:30,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 134 [2022-07-19 23:41:30,471 INFO L356 Elim1Store]: treesize reduction 21, result has 4.5 percent of original size [2022-07-19 23:41:30,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 52 [2022-07-19 23:41:30,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-07-19 23:41:30,982 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 24 proven. 133 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-19 23:41:30,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 23:41:31,758 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 23:41:31,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 45 [2022-07-19 23:41:31,774 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 23:41:31,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2022-07-19 23:41:32,411 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3257 (Array Int Int))) (not (<= (mod (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_~#set_impl~0.base| v_ArrVal_3256)) (.cse3 (store |c_#memory_$Pointer$.base| |c_~#set_impl~0.base| v_ArrVal_3257)) (.cse4 (+ c_~if_usb_driver_group1~0.offset 533))) (let ((.cse1 (select (select .cse3 c_~if_usb_driver_group1~0.base) .cse4)) (.cse2 (+ (select (select .cse0 c_~if_usb_driver_group1~0.base) .cse4) 28))) (+ (select (select .cse0 .cse1) .cse2) (select (select .cse3 .cse1) .cse2)))) 18446744073709551616) 0))) is different from false [2022-07-19 23:41:32,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619560046] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:41:32,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 23:41:32,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 52] total 65 [2022-07-19 23:41:32,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993624247] [2022-07-19 23:41:32,413 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 23:41:32,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-07-19 23:41:32,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:41:32,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-07-19 23:41:32,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=4920, Unknown=7, NotChecked=142, Total=5402 [2022-07-19 23:41:32,417 INFO L87 Difference]: Start difference. First operand 4007 states and 5372 transitions. Second operand has 65 states, 61 states have (on average 6.540983606557377) internal successors, (399), 46 states have internal predecessors, (399), 19 states have call successors, (72), 24 states have call predecessors, (72), 23 states have return successors, (73), 25 states have call predecessors, (73), 19 states have call successors, (73) [2022-07-19 23:42:05,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:42:05,246 INFO L93 Difference]: Finished difference Result 13517 states and 18454 transitions. [2022-07-19 23:42:05,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-07-19 23:42:05,247 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 61 states have (on average 6.540983606557377) internal successors, (399), 46 states have internal predecessors, (399), 19 states have call successors, (72), 24 states have call predecessors, (72), 23 states have return successors, (73), 25 states have call predecessors, (73), 19 states have call successors, (73) Word has length 328 [2022-07-19 23:42:05,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:42:05,275 INFO L225 Difference]: With dead ends: 13517 [2022-07-19 23:42:05,275 INFO L226 Difference]: Without dead ends: 9655 [2022-07-19 23:42:05,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 620 GetRequests, 449 SyntacticMatches, 2 SemanticMatches, 169 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8165 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=2428, Invalid=26260, Unknown=46, NotChecked=336, Total=29070 [2022-07-19 23:42:05,291 INFO L413 NwaCegarLoop]: 1050 mSDtfsCounter, 6694 mSDsluCounter, 22214 mSDsCounter, 0 mSdLazyCounter, 38182 mSolverCounterSat, 3794 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6886 SdHoareTripleChecker+Valid, 23264 SdHoareTripleChecker+Invalid, 48490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3794 IncrementalHoareTripleChecker+Valid, 38182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6514 IncrementalHoareTripleChecker+Unchecked, 25.7s IncrementalHoareTripleChecker+Time [2022-07-19 23:42:05,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6886 Valid, 23264 Invalid, 48490 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3794 Valid, 38182 Invalid, 0 Unknown, 6514 Unchecked, 25.7s Time] [2022-07-19 23:42:05,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9655 states. [2022-07-19 23:42:05,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9655 to 8140. [2022-07-19 23:42:05,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8140 states, 6113 states have (on average 1.3127760510387698) internal successors, (8025), 6257 states have internal predecessors, (8025), 1373 states have call successors, (1373), 580 states have call predecessors, (1373), 653 states have return successors, (1574), 1357 states have call predecessors, (1574), 1372 states have call successors, (1574) [2022-07-19 23:42:05,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8140 states to 8140 states and 10972 transitions. [2022-07-19 23:42:05,999 INFO L78 Accepts]: Start accepts. Automaton has 8140 states and 10972 transitions. Word has length 328 [2022-07-19 23:42:06,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:42:06,000 INFO L495 AbstractCegarLoop]: Abstraction has 8140 states and 10972 transitions. [2022-07-19 23:42:06,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 61 states have (on average 6.540983606557377) internal successors, (399), 46 states have internal predecessors, (399), 19 states have call successors, (72), 24 states have call predecessors, (72), 23 states have return successors, (73), 25 states have call predecessors, (73), 19 states have call successors, (73) [2022-07-19 23:42:06,000 INFO L276 IsEmpty]: Start isEmpty. Operand 8140 states and 10972 transitions. [2022-07-19 23:42:06,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2022-07-19 23:42:06,019 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:42:06,020 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 23:42:06,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-19 23:42:06,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-19 23:42:06,232 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:42:06,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:42:06,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1229348098, now seen corresponding path program 2 times [2022-07-19 23:42:06,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:42:06,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194431658] [2022-07-19 23:42:06,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:42:06,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:42:06,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:06,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:42:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:06,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:42:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:06,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 23:42:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:06,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 23:42:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:06,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 23:42:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:06,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:42:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:06,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:42:06,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:06,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 23:42:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:06,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 23:42:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:06,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:42:06,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:06,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:42:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:06,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 23:42:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:06,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:42:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:06,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-19 23:42:06,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:06,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:42:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:06,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-19 23:42:06,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:06,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:42:06,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:06,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-19 23:42:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:06,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-19 23:42:06,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:06,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-19 23:42:06,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:06,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-19 23:42:06,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:06,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-19 23:42:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:06,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-19 23:42:06,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:06,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:42:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:06,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:42:06,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:06,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:42:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:06,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:42:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:06,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:42:06,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:06,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:42:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:06,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2022-07-19 23:42:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:06,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:42:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:06,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:42:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:06,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:42:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:06,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:42:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:06,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 23:42:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:06,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 23:42:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:06,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 23:42:06,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:06,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 23:42:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:06,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 23:42:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:06,710 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2022-07-19 23:42:06,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:42:06,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194431658] [2022-07-19 23:42:06,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194431658] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:42:06,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293105478] [2022-07-19 23:42:06,711 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 23:42:06,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:42:06,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:42:06,713 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 23:42:06,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-19 23:42:07,402 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-19 23:42:07,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 23:42:07,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 2106 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-19 23:42:07,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:42:07,697 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-07-19 23:42:07,697 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 23:42:07,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293105478] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:42:07,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 23:42:07,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [14] total 26 [2022-07-19 23:42:07,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684338004] [2022-07-19 23:42:07,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:42:07,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 23:42:07,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:42:07,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 23:42:07,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2022-07-19 23:42:07,702 INFO L87 Difference]: Start difference. First operand 8140 states and 10972 transitions. Second operand has 14 states, 13 states have (on average 15.307692307692308) internal successors, (199), 11 states have internal predecessors, (199), 3 states have call successors, (36), 2 states have call predecessors, (36), 5 states have return successors, (35), 5 states have call predecessors, (35), 3 states have call successors, (35) [2022-07-19 23:42:08,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:42:08,479 INFO L93 Difference]: Finished difference Result 14160 states and 19131 transitions. [2022-07-19 23:42:08,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 23:42:08,480 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 15.307692307692308) internal successors, (199), 11 states have internal predecessors, (199), 3 states have call successors, (36), 2 states have call predecessors, (36), 5 states have return successors, (35), 5 states have call predecessors, (35), 3 states have call successors, (35) Word has length 337 [2022-07-19 23:42:08,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:42:08,504 INFO L225 Difference]: With dead ends: 14160 [2022-07-19 23:42:08,504 INFO L226 Difference]: Without dead ends: 7109 [2022-07-19 23:42:08,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=901, Unknown=0, NotChecked=0, Total=992 [2022-07-19 23:42:08,522 INFO L413 NwaCegarLoop]: 717 mSDtfsCounter, 49 mSDsluCounter, 8514 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 9231 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 23:42:08,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 9231 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 23:42:08,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7109 states. [2022-07-19 23:42:09,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7109 to 7005. [2022-07-19 23:42:09,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7005 states, 5263 states have (on average 1.3119893596807903) internal successors, (6905), 5389 states have internal predecessors, (6905), 1179 states have call successors, (1179), 505 states have call predecessors, (1179), 562 states have return successors, (1329), 1157 states have call predecessors, (1329), 1178 states have call successors, (1329) [2022-07-19 23:42:09,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7005 states to 7005 states and 9413 transitions. [2022-07-19 23:42:09,084 INFO L78 Accepts]: Start accepts. Automaton has 7005 states and 9413 transitions. Word has length 337 [2022-07-19 23:42:09,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:42:09,084 INFO L495 AbstractCegarLoop]: Abstraction has 7005 states and 9413 transitions. [2022-07-19 23:42:09,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 15.307692307692308) internal successors, (199), 11 states have internal predecessors, (199), 3 states have call successors, (36), 2 states have call predecessors, (36), 5 states have return successors, (35), 5 states have call predecessors, (35), 3 states have call successors, (35) [2022-07-19 23:42:09,085 INFO L276 IsEmpty]: Start isEmpty. Operand 7005 states and 9413 transitions. [2022-07-19 23:42:09,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2022-07-19 23:42:09,101 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:42:09,101 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 23:42:09,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-19 23:42:09,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:42:09,316 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:42:09,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:42:09,316 INFO L85 PathProgramCache]: Analyzing trace with hash -2038548864, now seen corresponding path program 1 times [2022-07-19 23:42:09,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:42:09,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049010152] [2022-07-19 23:42:09,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:42:09,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:42:09,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:09,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:42:09,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:09,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:42:09,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:09,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 23:42:09,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:09,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 23:42:09,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:09,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 23:42:09,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:09,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:42:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:09,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:42:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:09,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 23:42:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:09,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 23:42:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:09,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:42:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:09,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:42:09,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:09,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 23:42:09,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:09,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:42:09,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:09,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-19 23:42:09,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:09,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:42:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:09,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-19 23:42:09,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:09,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:42:09,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:09,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-19 23:42:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:09,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-19 23:42:09,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:09,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-19 23:42:09,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:09,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-19 23:42:09,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:09,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-19 23:42:09,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:09,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-19 23:42:09,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:09,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:42:09,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:09,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:42:09,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:09,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:42:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:09,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:42:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:09,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:42:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:09,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:42:09,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:09,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:42:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:09,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 23:42:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:09,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 23:42:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:09,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-19 23:42:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:09,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:42:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:09,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:42:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:09,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:42:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:09,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:42:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:09,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 23:42:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:09,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 23:42:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:09,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 23:42:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:09,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 23:42:09,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:09,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 23:42:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:09,958 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2022-07-19 23:42:09,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:42:09,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049010152] [2022-07-19 23:42:09,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049010152] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:42:09,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578935106] [2022-07-19 23:42:09,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:42:09,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:42:09,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:42:09,961 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 23:42:09,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-19 23:42:10,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:11,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 4082 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-19 23:42:11,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:42:11,050 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2022-07-19 23:42:11,050 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 23:42:11,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578935106] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:42:11,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 23:42:11,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [14] total 16 [2022-07-19 23:42:11,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857412504] [2022-07-19 23:42:11,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:42:11,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 23:42:11,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:42:11,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 23:42:11,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-07-19 23:42:11,053 INFO L87 Difference]: Start difference. First operand 7005 states and 9413 transitions. Second operand has 4 states, 4 states have (on average 47.25) internal successors, (189), 4 states have internal predecessors, (189), 2 states have call successors, (39), 2 states have call predecessors, (39), 3 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2022-07-19 23:42:11,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:42:11,437 INFO L93 Difference]: Finished difference Result 13985 states and 18800 transitions. [2022-07-19 23:42:11,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 23:42:11,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 4 states have internal predecessors, (189), 2 states have call successors, (39), 2 states have call predecessors, (39), 3 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 353 [2022-07-19 23:42:11,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:42:11,458 INFO L225 Difference]: With dead ends: 13985 [2022-07-19 23:42:11,459 INFO L226 Difference]: Without dead ends: 7006 [2022-07-19 23:42:11,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 429 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2022-07-19 23:42:11,475 INFO L413 NwaCegarLoop]: 693 mSDtfsCounter, 2 mSDsluCounter, 1384 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2077 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 23:42:11,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2077 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 23:42:11,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7006 states. [2022-07-19 23:42:12,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7006 to 7006. [2022-07-19 23:42:12,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7006 states, 5264 states have (on average 1.3119300911854104) internal successors, (6906), 5390 states have internal predecessors, (6906), 1179 states have call successors, (1179), 505 states have call predecessors, (1179), 562 states have return successors, (1329), 1157 states have call predecessors, (1329), 1178 states have call successors, (1329) [2022-07-19 23:42:12,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7006 states to 7006 states and 9414 transitions. [2022-07-19 23:42:12,104 INFO L78 Accepts]: Start accepts. Automaton has 7006 states and 9414 transitions. Word has length 353 [2022-07-19 23:42:12,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:42:12,105 INFO L495 AbstractCegarLoop]: Abstraction has 7006 states and 9414 transitions. [2022-07-19 23:42:12,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 4 states have internal predecessors, (189), 2 states have call successors, (39), 2 states have call predecessors, (39), 3 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2022-07-19 23:42:12,105 INFO L276 IsEmpty]: Start isEmpty. Operand 7006 states and 9414 transitions. [2022-07-19 23:42:12,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2022-07-19 23:42:12,120 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:42:12,120 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 23:42:12,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-19 23:42:12,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:42:12,332 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:42:12,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:42:12,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1269638489, now seen corresponding path program 1 times [2022-07-19 23:42:12,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:42:12,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389334270] [2022-07-19 23:42:12,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:42:12,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:42:12,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:12,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:42:12,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:12,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:42:12,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:12,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:42:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:12,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 23:42:12,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:12,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 23:42:12,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:12,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:42:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:12,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:42:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:12,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 23:42:12,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:12,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 23:42:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:12,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:42:12,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:12,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:42:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:12,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 23:42:12,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:12,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:42:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:12,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:42:12,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:12,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-19 23:42:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:12,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:42:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:12,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-19 23:42:12,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:12,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:42:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:12,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-19 23:42:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:12,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-19 23:42:12,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:12,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-19 23:42:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:12,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-19 23:42:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:12,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-19 23:42:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:12,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-19 23:42:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:12,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:42:12,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:12,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:42:12,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:12,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:42:12,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:12,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:42:12,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:12,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:42:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:12,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:42:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:12,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:42:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:12,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 23:42:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:12,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 23:42:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:12,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2022-07-19 23:42:12,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:12,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:42:12,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:12,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:42:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:12,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:42:12,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:12,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:42:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:12,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 23:42:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:12,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 23:42:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:12,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 23:42:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:12,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 23:42:12,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:12,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 23:42:12,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:13,000 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 45 proven. 4 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-07-19 23:42:13,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:42:13,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389334270] [2022-07-19 23:42:13,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389334270] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:42:13,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714652425] [2022-07-19 23:42:13,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:42:13,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:42:13,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:42:13,004 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 23:42:13,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-19 23:42:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:14,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 4117 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-19 23:42:14,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:42:14,131 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-07-19 23:42:14,132 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 23:42:14,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714652425] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:42:14,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 23:42:14,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 15 [2022-07-19 23:42:14,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574952821] [2022-07-19 23:42:14,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:42:14,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 23:42:14,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:42:14,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 23:42:14,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-07-19 23:42:14,134 INFO L87 Difference]: Start difference. First operand 7006 states and 9414 transitions. Second operand has 8 states, 8 states have (on average 26.125) internal successors, (209), 6 states have internal predecessors, (209), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (40), 4 states have call predecessors, (40), 2 states have call successors, (40) [2022-07-19 23:42:14,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:42:14,605 INFO L93 Difference]: Finished difference Result 13312 states and 17835 transitions. [2022-07-19 23:42:14,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 23:42:14,606 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 26.125) internal successors, (209), 6 states have internal predecessors, (209), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (40), 4 states have call predecessors, (40), 2 states have call successors, (40) Word has length 357 [2022-07-19 23:42:14,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:42:14,621 INFO L225 Difference]: With dead ends: 13312 [2022-07-19 23:42:14,622 INFO L226 Difference]: Without dead ends: 7058 [2022-07-19 23:42:14,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 435 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-07-19 23:42:14,634 INFO L413 NwaCegarLoop]: 694 mSDtfsCounter, 2 mSDsluCounter, 4147 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4841 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 23:42:14,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4841 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 23:42:14,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7058 states. [2022-07-19 23:42:15,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7058 to 7058. [2022-07-19 23:42:15,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7058 states, 5309 states have (on average 1.309286117912978) internal successors, (6951), 5423 states have internal predecessors, (6951), 1179 states have call successors, (1179), 505 states have call predecessors, (1179), 569 states have return successors, (1343), 1176 states have call predecessors, (1343), 1178 states have call successors, (1343) [2022-07-19 23:42:15,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7058 states to 7058 states and 9473 transitions. [2022-07-19 23:42:15,142 INFO L78 Accepts]: Start accepts. Automaton has 7058 states and 9473 transitions. Word has length 357 [2022-07-19 23:42:15,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:42:15,143 INFO L495 AbstractCegarLoop]: Abstraction has 7058 states and 9473 transitions. [2022-07-19 23:42:15,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.125) internal successors, (209), 6 states have internal predecessors, (209), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (40), 4 states have call predecessors, (40), 2 states have call successors, (40) [2022-07-19 23:42:15,143 INFO L276 IsEmpty]: Start isEmpty. Operand 7058 states and 9473 transitions. [2022-07-19 23:42:15,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2022-07-19 23:42:15,155 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:42:15,155 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 23:42:15,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-19 23:42:15,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-19 23:42:15,356 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:42:15,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:42:15,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1085436110, now seen corresponding path program 2 times [2022-07-19 23:42:15,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:42:15,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082990767] [2022-07-19 23:42:15,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:42:15,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:42:15,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:42:16,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:42:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:42:16,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 23:42:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 23:42:16,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:42:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:42:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 23:42:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 23:42:16,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:42:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:42:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 23:42:16,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:42:16,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:42:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-19 23:42:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:42:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:42:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-19 23:42:16,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:42:16,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-19 23:42:16,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-19 23:42:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-19 23:42:16,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-19 23:42:16,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-19 23:42:16,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-19 23:42:16,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:42:16,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:42:16,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:42:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:42:16,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:42:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:42:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:42:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 23:42:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 23:42:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2022-07-19 23:42:16,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:42:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:42:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:42:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:42:16,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 23:42:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 23:42:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 23:42:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 23:42:16,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 23:42:16,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:42:16,601 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2022-07-19 23:42:16,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:42:16,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082990767] [2022-07-19 23:42:16,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082990767] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:42:16,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817459622] [2022-07-19 23:42:16,602 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 23:42:16,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:42:16,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:42:16,603 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 23:42:16,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-19 23:42:18,758 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 23:42:18,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 23:42:18,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 4143 conjuncts, 454 conjunts are in the unsatisfiable core [2022-07-19 23:42:18,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:42:18,831 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 23:42:18,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-19 23:42:19,222 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 23:42:19,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-19 23:42:19,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-19 23:42:19,685 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 23:42:19,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 25 [2022-07-19 23:42:20,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-19 23:42:20,644 INFO L356 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2022-07-19 23:42:20,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 45 [2022-07-19 23:42:20,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-19 23:42:20,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2022-07-19 23:42:41,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-19 23:43:02,440 INFO L356 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2022-07-19 23:43:02,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 56 [2022-07-19 23:43:06,615 INFO L356 Elim1Store]: treesize reduction 66, result has 30.5 percent of original size [2022-07-19 23:43:06,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 76 [2022-07-19 23:43:06,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2022-07-19 23:43:39,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9