./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 35987657 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-?-3598765 [2022-07-21 11:11:48,776 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 11:11:48,777 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 11:11:48,801 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 11:11:48,802 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 11:11:48,803 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 11:11:48,804 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 11:11:48,805 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 11:11:48,806 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 11:11:48,806 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 11:11:48,807 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 11:11:48,808 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 11:11:48,808 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 11:11:48,809 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 11:11:48,809 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 11:11:48,810 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 11:11:48,811 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 11:11:48,811 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 11:11:48,812 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 11:11:48,814 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 11:11:48,815 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 11:11:48,824 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 11:11:48,825 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 11:11:48,827 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 11:11:48,827 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 11:11:48,829 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 11:11:48,834 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 11:11:48,835 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 11:11:48,835 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 11:11:48,836 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 11:11:48,836 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 11:11:48,837 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 11:11:48,837 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 11:11:48,838 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 11:11:48,839 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 11:11:48,840 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 11:11:48,840 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 11:11:48,841 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 11:11:48,841 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 11:11:48,841 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 11:11:48,842 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 11:11:48,843 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 11:11:48,845 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-21 11:11:48,865 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 11:11:48,866 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 11:11:48,866 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 11:11:48,866 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 11:11:48,867 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 11:11:48,867 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 11:11:48,867 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 11:11:48,867 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 11:11:48,868 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 11:11:48,868 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 11:11:48,868 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 11:11:48,869 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 11:11:48,869 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 11:11:48,869 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 11:11:48,869 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 11:11:48,869 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 11:11:48,869 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 11:11:48,869 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 11:11:48,870 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 11:11:48,870 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 11:11:48,870 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 11:11:48,870 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 11:11:48,870 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 11:11:48,870 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 11:11:48,870 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 11:11:48,871 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 11:11:48,871 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 11:11:48,871 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 11:11:48,871 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 11:11:48,871 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 11:11:48,871 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-21 11:11:49,124 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 11:11:49,145 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 11:11:49,147 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 11:11:49,147 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 11:11:49,148 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 11:11:49,149 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-21 11:11:49,206 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9d55e653/1cb7d96cc6ed4b48bc0607c8d0dbd0b5/FLAG8694f8973 [2022-07-21 11:11:49,801 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 11:11:49,802 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-21 11:11:49,834 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9d55e653/1cb7d96cc6ed4b48bc0607c8d0dbd0b5/FLAG8694f8973 [2022-07-21 11:11:50,193 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9d55e653/1cb7d96cc6ed4b48bc0607c8d0dbd0b5 [2022-07-21 11:11:50,195 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 11:11:50,197 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 11:11:50,198 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 11:11:50,199 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 11:11:50,201 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 11:11:50,201 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:11:50" (1/1) ... [2022-07-21 11:11:50,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8a88107 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:11:50, skipping insertion in model container [2022-07-21 11:11:50,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:11:50" (1/1) ... [2022-07-21 11:11:50,206 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 11:11:50,301 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 11:11:50,897 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-21 11:11:51,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 11:11:51,379 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 11:11:51,497 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-21 11:11:51,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 11:11:51,746 INFO L208 MainTranslator]: Completed translation [2022-07-21 11:11:51,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:11:51 WrapperNode [2022-07-21 11:11:51,748 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 11:11:51,749 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 11:11:51,749 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 11:11:51,749 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 11:11:51,754 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:11:51" (1/1) ... [2022-07-21 11:11:51,799 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:11:51" (1/1) ... [2022-07-21 11:11:51,873 INFO L137 Inliner]: procedures = 180, calls = 1285, calls flagged for inlining = 87, calls inlined = 41, statements flattened = 1748 [2022-07-21 11:11:51,874 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 11:11:51,874 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 11:11:51,875 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 11:11:51,875 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 11:11:51,882 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:11:51" (1/1) ... [2022-07-21 11:11:51,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:11:51" (1/1) ... [2022-07-21 11:11:51,895 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:11:51" (1/1) ... [2022-07-21 11:11:51,896 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:11:51" (1/1) ... [2022-07-21 11:11:51,939 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:11:51" (1/1) ... [2022-07-21 11:11:51,948 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:11:51" (1/1) ... [2022-07-21 11:11:51,970 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:11:51" (1/1) ... [2022-07-21 11:11:51,982 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 11:11:51,983 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 11:11:51,983 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 11:11:51,983 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 11:11:51,983 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:11:51" (1/1) ... [2022-07-21 11:11:51,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 11:11:52,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:11:52,016 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-21 11:11:52,039 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-21 11:11:52,063 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_reset_device [2022-07-21 11:11:52,063 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_reset_device [2022-07-21 11:11:52,064 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_resume [2022-07-21 11:11:52,064 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_resume [2022-07-21 11:11:52,064 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2022-07-21 11:11:52,064 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2022-07-21 11:11:52,064 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2022-07-21 11:11:52,064 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2022-07-21 11:11:52,064 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2022-07-21 11:11:52,064 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2022-07-21 11:11:52,065 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-21 11:11:52,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-21 11:11:52,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 11:11:52,065 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_bulk [2022-07-21 11:11:52,065 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_bulk [2022-07-21 11:11:52,065 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2022-07-21 11:11:52,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2022-07-21 11:11:52,066 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-21 11:11:52,066 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-21 11:11:52,066 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-21 11:11:52,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-21 11:11:52,066 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-21 11:11:52,066 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-21 11:11:52,066 INFO L130 BoogieDeclarations]: Found specification of procedure activate_suitable_timer_1 [2022-07-21 11:11:52,067 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_suitable_timer_1 [2022-07-21 11:11:52,067 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_submit_rx_urb [2022-07-21 11:11:52,067 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_submit_rx_urb [2022-07-21 11:11:52,067 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-07-21 11:11:52,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-07-21 11:11:52,067 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-21 11:11:52,067 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-21 11:11:52,068 INFO L130 BoogieDeclarations]: Found specification of procedure __if_usb_submit_rx_urb [2022-07-21 11:11:52,068 INFO L138 BoogieDeclarations]: Found implementation of procedure __if_usb_submit_rx_urb [2022-07-21 11:11:52,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 11:11:52,068 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2022-07-21 11:11:52,068 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2022-07-21 11:11:52,069 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-21 11:11:52,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-21 11:11:52,069 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_free [2022-07-21 11:11:52,069 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_free [2022-07-21 11:11:52,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-21 11:11:52,069 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-21 11:11:52,069 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-21 11:11:52,070 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-21 11:11:52,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 11:11:52,070 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_disconnect [2022-07-21 11:11:52,070 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_disconnect [2022-07-21 11:11:52,070 INFO L130 BoogieDeclarations]: Found specification of procedure usb_tx_block [2022-07-21 11:11:52,070 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_tx_block [2022-07-21 11:11:52,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 11:11:52,071 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_timer_1 [2022-07-21 11:11:52,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_timer_1 [2022-07-21 11:11:52,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 11:11:52,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 11:11:52,072 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-21 11:11:52,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 11:11:52,072 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-07-21 11:11:52,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-07-21 11:11:52,073 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2022-07-21 11:11:52,073 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2022-07-21 11:11:52,074 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_num [2022-07-21 11:11:52,074 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_num [2022-07-21 11:11:52,074 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-07-21 11:11:52,074 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-07-21 11:11:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 11:11:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 11:11:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure lbs_remove_card [2022-07-21 11:11:52,075 INFO L138 BoogieDeclarations]: Found implementation of procedure lbs_remove_card [2022-07-21 11:11:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-21 11:11:52,075 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-21 11:11:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure dev_name [2022-07-21 11:11:52,076 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_name [2022-07-21 11:11:52,076 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-21 11:11:52,088 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-21 11:11:52,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 11:11:52,088 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2022-07-21 11:11:52,088 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2022-07-21 11:11:52,089 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2022-07-21 11:11:52,089 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2022-07-21 11:11:52,089 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-21 11:11:52,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-21 11:11:52,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 11:11:52,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 11:11:52,089 INFO L130 BoogieDeclarations]: Found specification of procedure preempt_count [2022-07-21 11:11:52,089 INFO L138 BoogieDeclarations]: Found implementation of procedure preempt_count [2022-07-21 11:11:52,440 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 11:11:52,442 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 11:11:52,781 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-21 11:11:53,546 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 11:11:53,569 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 11:11:53,570 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-21 11:11:53,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:11:53 BoogieIcfgContainer [2022-07-21 11:11:53,573 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 11:11:53,575 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 11:11:53,576 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 11:11:53,578 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 11:11:53,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 11:11:50" (1/3) ... [2022-07-21 11:11:53,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44595a1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:11:53, skipping insertion in model container [2022-07-21 11:11:53,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:11:51" (2/3) ... [2022-07-21 11:11:53,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44595a1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:11:53, skipping insertion in model container [2022-07-21 11:11:53,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:11:53" (3/3) ... [2022-07-21 11:11:53,581 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-21 11:11:53,590 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 11:11:53,590 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 11:11:53,634 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 11:11:53,638 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@7f8fac2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@10953931 [2022-07-21 11:11:53,639 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 11:11:53,643 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-21 11:11:53,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-21 11:11:53,650 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:11:53,650 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-21 11:11:53,650 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:11:53,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:11:53,654 INFO L85 PathProgramCache]: Analyzing trace with hash 404224410, now seen corresponding path program 1 times [2022-07-21 11:11:53,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:11:53,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347308196] [2022-07-21 11:11:53,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:11:53,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:11:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:11:54,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:11:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:11:54,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 11:11:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:11:54,088 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-21 11:11:54,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:11:54,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347308196] [2022-07-21 11:11:54,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347308196] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:11:54,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:11:54,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 11:11:54,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119790482] [2022-07-21 11:11:54,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:11:54,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 11:11:54,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:11:54,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 11:11:54,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 11:11:54,118 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-21 11:11:55,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:11:55,779 INFO L93 Difference]: Finished difference Result 1646 states and 2326 transitions. [2022-07-21 11:11:55,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 11:11:55,781 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-21 11:11:55,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:11:55,795 INFO L225 Difference]: With dead ends: 1646 [2022-07-21 11:11:55,795 INFO L226 Difference]: Without dead ends: 1112 [2022-07-21 11:11:55,801 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-21 11:11:55,803 INFO L413 NwaCegarLoop]: 751 mSDtfsCounter, 1300 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 557 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1365 SdHoareTripleChecker+Valid, 1860 SdHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 557 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-21 11:11:55,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1365 Valid, 1860 Invalid, 1390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [557 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-21 11:11:55,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2022-07-21 11:11:55,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 995. [2022-07-21 11:11:55,926 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-21 11:11:55,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1363 transitions. [2022-07-21 11:11:55,933 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1363 transitions. Word has length 31 [2022-07-21 11:11:55,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:11:55,934 INFO L495 AbstractCegarLoop]: Abstraction has 995 states and 1363 transitions. [2022-07-21 11:11:55,934 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-21 11:11:55,934 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1363 transitions. [2022-07-21 11:11:55,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-21 11:11:55,937 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:11:55,937 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-21 11:11:55,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 11:11:55,938 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:11:55,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:11:55,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1978920525, now seen corresponding path program 1 times [2022-07-21 11:11:55,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:11:55,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940584478] [2022-07-21 11:11:55,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:11:55,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:11:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:11:56,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:11:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:11:56,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 11:11:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:11:56,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 11:11:56,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:11:56,128 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-21 11:11:56,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:11:56,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940584478] [2022-07-21 11:11:56,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940584478] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:11:56,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:11:56,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 11:11:56,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061502449] [2022-07-21 11:11:56,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:11:56,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 11:11:56,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:11:56,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 11:11:56,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 11:11:56,139 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-21 11:11:57,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:11:57,004 INFO L93 Difference]: Finished difference Result 1124 states and 1531 transitions. [2022-07-21 11:11:57,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 11:11:57,007 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-21 11:11:57,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:11:57,012 INFO L225 Difference]: With dead ends: 1124 [2022-07-21 11:11:57,013 INFO L226 Difference]: Without dead ends: 1118 [2022-07-21 11:11:57,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-21 11:11:57,014 INFO L413 NwaCegarLoop]: 657 mSDtfsCounter, 983 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1049 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 11:11:57,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1049 Valid, 1283 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-21 11:11:57,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2022-07-21 11:11:57,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 995. [2022-07-21 11:11:57,056 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-21 11:11:57,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1362 transitions. [2022-07-21 11:11:57,060 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1362 transitions. Word has length 41 [2022-07-21 11:11:57,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:11:57,060 INFO L495 AbstractCegarLoop]: Abstraction has 995 states and 1362 transitions. [2022-07-21 11:11:57,061 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-21 11:11:57,061 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1362 transitions. [2022-07-21 11:11:57,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-21 11:11:57,066 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:11:57,066 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-21 11:11:57,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 11:11:57,066 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:11:57,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:11:57,067 INFO L85 PathProgramCache]: Analyzing trace with hash -203913163, now seen corresponding path program 1 times [2022-07-21 11:11:57,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:11:57,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731069237] [2022-07-21 11:11:57,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:11:57,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:11:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:11:57,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:11:57,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:11:57,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 11:11:57,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:11:57,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 11:11:57,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:11:57,222 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-21 11:11:57,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:11:57,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731069237] [2022-07-21 11:11:57,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731069237] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:11:57,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:11:57,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 11:11:57,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106694701] [2022-07-21 11:11:57,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:11:57,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 11:11:57,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:11:57,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 11:11:57,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 11:11:57,225 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-21 11:11:59,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:11:59,023 INFO L93 Difference]: Finished difference Result 3179 states and 4385 transitions. [2022-07-21 11:11:59,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 11:11:59,024 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-21 11:11:59,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:11:59,033 INFO L225 Difference]: With dead ends: 3179 [2022-07-21 11:11:59,033 INFO L226 Difference]: Without dead ends: 2191 [2022-07-21 11:11:59,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-07-21 11:11:59,037 INFO L413 NwaCegarLoop]: 738 mSDtfsCounter, 1293 mSDsluCounter, 2091 mSDsCounter, 0 mSdLazyCounter, 1556 mSolverCounterSat, 545 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1353 SdHoareTripleChecker+Valid, 2829 SdHoareTripleChecker+Invalid, 2101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 545 IncrementalHoareTripleChecker+Valid, 1556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-21 11:11:59,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1353 Valid, 2829 Invalid, 2101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [545 Valid, 1556 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-21 11:11:59,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2191 states. [2022-07-21 11:11:59,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2191 to 2022. [2022-07-21 11:11:59,094 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-21 11:11:59,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 2022 states and 2782 transitions. [2022-07-21 11:11:59,102 INFO L78 Accepts]: Start accepts. Automaton has 2022 states and 2782 transitions. Word has length 41 [2022-07-21 11:11:59,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:11:59,102 INFO L495 AbstractCegarLoop]: Abstraction has 2022 states and 2782 transitions. [2022-07-21 11:11:59,103 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-21 11:11:59,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 2782 transitions. [2022-07-21 11:11:59,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-21 11:11:59,106 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:11:59,107 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-21 11:11:59,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 11:11:59,107 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:11:59,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:11:59,108 INFO L85 PathProgramCache]: Analyzing trace with hash 79979308, now seen corresponding path program 1 times [2022-07-21 11:11:59,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:11:59,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744744375] [2022-07-21 11:11:59,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:11:59,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:11:59,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:11:59,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:11:59,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:11:59,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 11:11:59,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:11:59,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 11:11:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:11:59,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:11:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:11:59,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:11:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:11:59,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:11:59,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:11:59,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:11:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:11:59,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:11:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:11:59,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 11:11:59,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:11:59,372 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-21 11:11:59,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:11:59,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744744375] [2022-07-21 11:11:59,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744744375] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:11:59,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:11:59,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 11:11:59,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345710573] [2022-07-21 11:11:59,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:11:59,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 11:11:59,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:11:59,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 11:11:59,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 11:11:59,374 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-21 11:12:00,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:12:00,378 INFO L93 Difference]: Finished difference Result 4446 states and 6148 transitions. [2022-07-21 11:12:00,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 11:12:00,378 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-21 11:12:00,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:12:00,387 INFO L225 Difference]: With dead ends: 4446 [2022-07-21 11:12:00,388 INFO L226 Difference]: Without dead ends: 2437 [2022-07-21 11:12:00,393 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-21 11:12:00,395 INFO L413 NwaCegarLoop]: 663 mSDtfsCounter, 528 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 1712 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-21 11:12:00,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 1712 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-21 11:12:00,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2437 states. [2022-07-21 11:12:00,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2437 to 2255. [2022-07-21 11:12:00,450 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-21 11:12:00,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 2255 states and 3120 transitions. [2022-07-21 11:12:00,457 INFO L78 Accepts]: Start accepts. Automaton has 2255 states and 3120 transitions. Word has length 94 [2022-07-21 11:12:00,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:12:00,458 INFO L495 AbstractCegarLoop]: Abstraction has 2255 states and 3120 transitions. [2022-07-21 11:12:00,458 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-21 11:12:00,459 INFO L276 IsEmpty]: Start isEmpty. Operand 2255 states and 3120 transitions. [2022-07-21 11:12:00,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-21 11:12:00,462 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:12:00,463 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-21 11:12:00,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 11:12:00,463 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:12:00,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:12:00,463 INFO L85 PathProgramCache]: Analyzing trace with hash 278080431, now seen corresponding path program 1 times [2022-07-21 11:12:00,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:12:00,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784504017] [2022-07-21 11:12:00,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:12:00,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:12:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:00,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:12:00,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:00,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 11:12:00,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:00,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 11:12:00,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:00,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 11:12:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:00,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:00,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:12:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:00,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:00,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:00,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:00,716 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-21 11:12:00,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:12:00,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784504017] [2022-07-21 11:12:00,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784504017] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:12:00,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:12:00,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 11:12:00,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700122464] [2022-07-21 11:12:00,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:12:00,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 11:12:00,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:12:00,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 11:12:00,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 11:12:00,719 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-21 11:12:01,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:12:01,809 INFO L93 Difference]: Finished difference Result 5212 states and 7184 transitions. [2022-07-21 11:12:01,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 11:12:01,809 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-21 11:12:01,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:12:01,819 INFO L225 Difference]: With dead ends: 5212 [2022-07-21 11:12:01,820 INFO L226 Difference]: Without dead ends: 2981 [2022-07-21 11:12:01,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-21 11:12:01,826 INFO L413 NwaCegarLoop]: 755 mSDtfsCounter, 793 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.0s IncrementalHoareTripleChecker+Time [2022-07-21 11:12:01,826 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.0s Time] [2022-07-21 11:12:01,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2022-07-21 11:12:01,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 2779. [2022-07-21 11:12:01,913 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-21 11:12:01,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2779 states to 2779 states and 3770 transitions. [2022-07-21 11:12:01,926 INFO L78 Accepts]: Start accepts. Automaton has 2779 states and 3770 transitions. Word has length 106 [2022-07-21 11:12:01,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:12:01,928 INFO L495 AbstractCegarLoop]: Abstraction has 2779 states and 3770 transitions. [2022-07-21 11:12:01,929 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-21 11:12:01,929 INFO L276 IsEmpty]: Start isEmpty. Operand 2779 states and 3770 transitions. [2022-07-21 11:12:01,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-21 11:12:01,936 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:12:01,936 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-21 11:12:01,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 11:12:01,938 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:12:01,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:12:01,939 INFO L85 PathProgramCache]: Analyzing trace with hash 954173882, now seen corresponding path program 1 times [2022-07-21 11:12:01,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:12:01,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499662461] [2022-07-21 11:12:01,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:12:01,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:12:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:02,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:12:02,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:02,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 11:12:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:02,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 11:12:02,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:02,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 11:12:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:02,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 11:12:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:02,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:02,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 11:12:02,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:02,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:02,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:02,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:12:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:02,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:02,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:02,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:02,136 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-21 11:12:02,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:12:02,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499662461] [2022-07-21 11:12:02,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499662461] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:12:02,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:12:02,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 11:12:02,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555042113] [2022-07-21 11:12:02,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:12:02,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 11:12:02,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:12:02,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 11:12:02,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 11:12:02,138 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-21 11:12:03,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:12:03,413 INFO L93 Difference]: Finished difference Result 6440 states and 8808 transitions. [2022-07-21 11:12:03,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 11:12:03,413 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-21 11:12:03,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:12:03,427 INFO L225 Difference]: With dead ends: 6440 [2022-07-21 11:12:03,427 INFO L226 Difference]: Without dead ends: 3685 [2022-07-21 11:12:03,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-21 11:12:03,436 INFO L413 NwaCegarLoop]: 782 mSDtfsCounter, 820 mSDsluCounter, 1381 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 2163 SdHoareTripleChecker+Invalid, 1553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-21 11:12:03,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 2163 Invalid, 1553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 1087 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-21 11:12:03,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3685 states. [2022-07-21 11:12:03,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3685 to 3329. [2022-07-21 11:12:03,519 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-21 11:12:03,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4505 transitions. [2022-07-21 11:12:03,529 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4505 transitions. Word has length 132 [2022-07-21 11:12:03,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:12:03,530 INFO L495 AbstractCegarLoop]: Abstraction has 3329 states and 4505 transitions. [2022-07-21 11:12:03,530 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-21 11:12:03,530 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4505 transitions. [2022-07-21 11:12:03,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-07-21 11:12:03,552 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:12:03,553 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-21 11:12:03,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 11:12:03,553 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:12:03,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:12:03,554 INFO L85 PathProgramCache]: Analyzing trace with hash -984455087, now seen corresponding path program 1 times [2022-07-21 11:12:03,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:12:03,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166329980] [2022-07-21 11:12:03,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:12:03,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:12:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:03,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:12:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:03,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 11:12:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:03,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 11:12:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:03,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 11:12:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:03,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 11:12:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:03,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:03,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 11:12:03,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:03,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 11:12:03,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:03,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:03,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:03,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:12:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:03,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:03,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:03,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:03,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:03,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:03,881 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-21 11:12:03,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:12:03,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166329980] [2022-07-21 11:12:03,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166329980] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:12:03,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:12:03,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 11:12:03,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624239664] [2022-07-21 11:12:03,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:12:03,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 11:12:03,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:12:03,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 11:12:03,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-21 11:12:03,883 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-21 11:12:05,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:12:05,309 INFO L93 Difference]: Finished difference Result 6957 states and 9512 transitions. [2022-07-21 11:12:05,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 11:12:05,309 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-21 11:12:05,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:12:05,322 INFO L225 Difference]: With dead ends: 6957 [2022-07-21 11:12:05,322 INFO L226 Difference]: Without dead ends: 3652 [2022-07-21 11:12:05,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-07-21 11:12:05,331 INFO L413 NwaCegarLoop]: 639 mSDtfsCounter, 734 mSDsluCounter, 1830 mSDsCounter, 0 mSdLazyCounter, 1421 mSolverCounterSat, 510 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.3s IncrementalHoareTripleChecker+Time [2022-07-21 11:12:05,331 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.3s Time] [2022-07-21 11:12:05,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3652 states. [2022-07-21 11:12:05,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3652 to 3329. [2022-07-21 11:12:05,414 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-21 11:12:05,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4497 transitions. [2022-07-21 11:12:05,425 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4497 transitions. Word has length 155 [2022-07-21 11:12:05,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:12:05,426 INFO L495 AbstractCegarLoop]: Abstraction has 3329 states and 4497 transitions. [2022-07-21 11:12:05,427 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-21 11:12:05,427 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4497 transitions. [2022-07-21 11:12:05,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-21 11:12:05,432 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:12:05,432 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-21 11:12:05,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 11:12:05,432 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:12:05,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:12:05,433 INFO L85 PathProgramCache]: Analyzing trace with hash -273480105, now seen corresponding path program 1 times [2022-07-21 11:12:05,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:12:05,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519701928] [2022-07-21 11:12:05,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:12:05,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:12:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:05,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:12:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:05,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 11:12:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:05,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 11:12:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:05,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 11:12:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:05,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 11:12:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:05,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:05,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:05,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 11:12:05,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:05,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 11:12:05,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:05,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:05,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:12:05,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:05,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:05,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:05,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:05,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:05,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:05,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:12:05,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:05,716 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-21 11:12:05,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:12:05,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519701928] [2022-07-21 11:12:05,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519701928] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:12:05,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432791443] [2022-07-21 11:12:05,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:12:05,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:12:05,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:12:05,718 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-21 11:12:05,719 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-21 11:12:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:06,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 2762 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 11:12:06,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:12:06,269 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-21 11:12:06,269 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:12:06,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432791443] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:12:06,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 11:12:06,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-07-21 11:12:06,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535872991] [2022-07-21 11:12:06,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:12:06,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 11:12:06,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:12:06,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 11:12:06,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-21 11:12:06,272 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-21 11:12:06,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:12:06,587 INFO L93 Difference]: Finished difference Result 8063 states and 10904 transitions. [2022-07-21 11:12:06,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 11:12:06,588 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-21 11:12:06,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:12:06,604 INFO L225 Difference]: With dead ends: 8063 [2022-07-21 11:12:06,604 INFO L226 Difference]: Without dead ends: 4758 [2022-07-21 11:12:06,611 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-21 11:12:06,611 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.1s IncrementalHoareTripleChecker+Time [2022-07-21 11:12:06,612 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.1s Time] [2022-07-21 11:12:06,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4758 states. [2022-07-21 11:12:06,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4758 to 3353. [2022-07-21 11:12:06,723 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-21 11:12:06,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3353 states to 3353 states and 4529 transitions. [2022-07-21 11:12:06,731 INFO L78 Accepts]: Start accepts. Automaton has 3353 states and 4529 transitions. Word has length 162 [2022-07-21 11:12:06,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:12:06,731 INFO L495 AbstractCegarLoop]: Abstraction has 3353 states and 4529 transitions. [2022-07-21 11:12:06,732 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-21 11:12:06,732 INFO L276 IsEmpty]: Start isEmpty. Operand 3353 states and 4529 transitions. [2022-07-21 11:12:06,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2022-07-21 11:12:06,738 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:12:06,738 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-21 11:12:06,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-21 11:12:06,951 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-21 11:12:06,952 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:12:06,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:12:06,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1352328716, now seen corresponding path program 1 times [2022-07-21 11:12:06,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:12:06,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247699923] [2022-07-21 11:12:06,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:12:06,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:12:07,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:07,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:12:07,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:07,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 11:12:07,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:07,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 11:12:07,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:07,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 11:12:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:07,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 11:12:07,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:07,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:07,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:07,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 11:12:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:07,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:07,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 11:12:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:07,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:07,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 11:12:07,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:07,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:07,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:07,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 11:12:07,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:07,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 11:12:07,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:07,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 11:12:07,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:07,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 11:12:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:07,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-21 11:12:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:07,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:07,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:07,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:12:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:07,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:07,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:07,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:07,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:07,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:12:07,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:07,251 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-21 11:12:07,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:12:07,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247699923] [2022-07-21 11:12:07,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247699923] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:12:07,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:12:07,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 11:12:07,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974332547] [2022-07-21 11:12:07,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:12:07,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 11:12:07,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:12:07,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 11:12:07,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 11:12:07,254 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-21 11:12:08,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:12:08,411 INFO L93 Difference]: Finished difference Result 7005 states and 9528 transitions. [2022-07-21 11:12:08,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 11:12:08,412 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-21 11:12:08,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:12:08,427 INFO L225 Difference]: With dead ends: 7005 [2022-07-21 11:12:08,428 INFO L226 Difference]: Without dead ends: 3676 [2022-07-21 11:12:08,435 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-21 11:12:08,436 INFO L413 NwaCegarLoop]: 640 mSDtfsCounter, 410 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 1928 SdHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-21 11:12:08,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 1928 Invalid, 1165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-21 11:12:08,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3676 states. [2022-07-21 11:12:08,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3676 to 3357. [2022-07-21 11:12:08,578 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-21 11:12:08,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3357 states to 3357 states and 4533 transitions. [2022-07-21 11:12:08,587 INFO L78 Accepts]: Start accepts. Automaton has 3357 states and 4533 transitions. Word has length 231 [2022-07-21 11:12:08,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:12:08,587 INFO L495 AbstractCegarLoop]: Abstraction has 3357 states and 4533 transitions. [2022-07-21 11:12:08,588 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-21 11:12:08,588 INFO L276 IsEmpty]: Start isEmpty. Operand 3357 states and 4533 transitions. [2022-07-21 11:12:08,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2022-07-21 11:12:08,595 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:12:08,595 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-21 11:12:08,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 11:12:08,595 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:12:08,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:12:08,596 INFO L85 PathProgramCache]: Analyzing trace with hash 51540470, now seen corresponding path program 1 times [2022-07-21 11:12:08,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:12:08,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800519776] [2022-07-21 11:12:08,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:12:08,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:12:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:08,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:12:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:08,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 11:12:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:08,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 11:12:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:08,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 11:12:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:08,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 11:12:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:08,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:08,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 11:12:08,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:08,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:08,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:08,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 11:12:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:08,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:08,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:08,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 11:12:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:08,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:08,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:08,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 11:12:08,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:08,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 11:12:08,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:08,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 11:12:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:08,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 11:12:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:08,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-21 11:12:08,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:08,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:08,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:12:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:08,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:08,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:08,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:08,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:08,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:08,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:12:08,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:08,992 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-21 11:12:08,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:12:08,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800519776] [2022-07-21 11:12:08,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800519776] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:12:08,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163079918] [2022-07-21 11:12:08,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:12:08,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:12:08,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:12:08,994 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-21 11:12:09,015 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-21 11:12:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:09,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 3318 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 11:12:09,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:12:09,786 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-21 11:12:09,786 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:12:09,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163079918] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:12:09,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 11:12:09,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-07-21 11:12:09,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683043100] [2022-07-21 11:12:09,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:12:09,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 11:12:09,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:12:09,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 11:12:09,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-21 11:12:09,788 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-21 11:12:10,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:12:10,117 INFO L93 Difference]: Finished difference Result 4833 states and 6532 transitions. [2022-07-21 11:12:10,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 11:12:10,117 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-21 11:12:10,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:12:10,130 INFO L225 Difference]: With dead ends: 4833 [2022-07-21 11:12:10,130 INFO L226 Difference]: Without dead ends: 4824 [2022-07-21 11:12:10,132 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-21 11:12:10,132 INFO L413 NwaCegarLoop]: 1170 mSDtfsCounter, 1052 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-21 11:12:10,133 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-21 11:12:10,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4824 states. [2022-07-21 11:12:10,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4824 to 4061. [2022-07-21 11:12:10,284 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-21 11:12:10,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4061 states to 4061 states and 5484 transitions. [2022-07-21 11:12:10,295 INFO L78 Accepts]: Start accepts. Automaton has 4061 states and 5484 transitions. Word has length 231 [2022-07-21 11:12:10,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:12:10,295 INFO L495 AbstractCegarLoop]: Abstraction has 4061 states and 5484 transitions. [2022-07-21 11:12:10,295 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-21 11:12:10,296 INFO L276 IsEmpty]: Start isEmpty. Operand 4061 states and 5484 transitions. [2022-07-21 11:12:10,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-07-21 11:12:10,305 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:12:10,305 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-21 11:12:10,329 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-21 11:12:10,519 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-21 11:12:10,520 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:12:10,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:12:10,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1538441839, now seen corresponding path program 1 times [2022-07-21 11:12:10,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:12:10,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634670346] [2022-07-21 11:12:10,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:12:10,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:12:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:10,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:12:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:10,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 11:12:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:10,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 11:12:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:10,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 11:12:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:10,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 11:12:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:10,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:10,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 11:12:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:10,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:10,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 11:12:10,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:10,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:10,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:10,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 11:12:10,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:10,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:10,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 11:12:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:10,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 11:12:10,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:10,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 11:12:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:10,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 11:12:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:10,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-21 11:12:10,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:10,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:10,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:12:10,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:10,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:10,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:10,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:10,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:10,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:10,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:12:10,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:10,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-21 11:12:10,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:10,901 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-21 11:12:10,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:12:10,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634670346] [2022-07-21 11:12:10,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634670346] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:12:10,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665267141] [2022-07-21 11:12:10,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:12:10,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:12:10,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:12:10,903 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-21 11:12:10,904 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-21 11:12:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:11,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 3405 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 11:12:11,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:12:11,668 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-21 11:12:11,669 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:12:11,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665267141] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:12:11,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 11:12:11,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2022-07-21 11:12:11,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868439617] [2022-07-21 11:12:11,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:12:11,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 11:12:11,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:12:11,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 11:12:11,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-07-21 11:12:11,671 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-21 11:12:11,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:12:11,797 INFO L93 Difference]: Finished difference Result 8098 states and 10942 transitions. [2022-07-21 11:12:11,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 11:12:11,798 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-21 11:12:11,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:12:11,810 INFO L225 Difference]: With dead ends: 8098 [2022-07-21 11:12:11,810 INFO L226 Difference]: Without dead ends: 3953 [2022-07-21 11:12:11,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-07-21 11:12:11,820 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-21 11:12:11,820 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-21 11:12:11,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3953 states. [2022-07-21 11:12:11,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3953 to 3953. [2022-07-21 11:12:11,949 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-21 11:12:11,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3953 states to 3953 states and 5306 transitions. [2022-07-21 11:12:11,957 INFO L78 Accepts]: Start accepts. Automaton has 3953 states and 5306 transitions. Word has length 241 [2022-07-21 11:12:11,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:12:11,958 INFO L495 AbstractCegarLoop]: Abstraction has 3953 states and 5306 transitions. [2022-07-21 11:12:11,958 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-21 11:12:11,958 INFO L276 IsEmpty]: Start isEmpty. Operand 3953 states and 5306 transitions. [2022-07-21 11:12:11,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-07-21 11:12:11,964 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:12:11,964 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-21 11:12:11,988 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-21 11:12:12,179 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-21 11:12:12,179 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:12:12,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:12:12,180 INFO L85 PathProgramCache]: Analyzing trace with hash 2035606035, now seen corresponding path program 1 times [2022-07-21 11:12:12,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:12:12,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521237539] [2022-07-21 11:12:12,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:12:12,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:12:12,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:12,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:12:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:12,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 11:12:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:12,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 11:12:12,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:12,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 11:12:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:12,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 11:12:12,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:12,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:12,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:12,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 11:12:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:12,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:12,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 11:12:12,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:12,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:12,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:12,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 11:12:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:12,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:12,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 11:12:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:12,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 11:12:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:12,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 11:12:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:12,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 11:12:12,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:12,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-21 11:12:12,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:12,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:12,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:12,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:12:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:12,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:12,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:12,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:12,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:12,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:12:12,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:12,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-21 11:12:12,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:12,390 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-21 11:12:12,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:12:12,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521237539] [2022-07-21 11:12:12,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521237539] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:12:12,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:12:12,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 11:12:12,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481743677] [2022-07-21 11:12:12,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:12:12,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 11:12:12,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:12:12,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 11:12:12,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 11:12:12,392 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-21 11:12:13,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:12:13,580 INFO L93 Difference]: Finished difference Result 6097 states and 8211 transitions. [2022-07-21 11:12:13,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 11:12:13,581 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-21 11:12:13,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:12:13,587 INFO L225 Difference]: With dead ends: 6097 [2022-07-21 11:12:13,587 INFO L226 Difference]: Without dead ends: 2167 [2022-07-21 11:12:13,594 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-21 11:12:13,594 INFO L413 NwaCegarLoop]: 640 mSDtfsCounter, 247 mSDsluCounter, 1556 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 2196 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.1s IncrementalHoareTripleChecker+Time [2022-07-21 11:12:13,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 2196 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1121 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-21 11:12:13,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2167 states. [2022-07-21 11:12:13,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2167 to 1991. [2022-07-21 11:12:13,650 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-21 11:12:13,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1991 states to 1991 states and 2663 transitions. [2022-07-21 11:12:13,656 INFO L78 Accepts]: Start accepts. Automaton has 1991 states and 2663 transitions. Word has length 241 [2022-07-21 11:12:13,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:12:13,656 INFO L495 AbstractCegarLoop]: Abstraction has 1991 states and 2663 transitions. [2022-07-21 11:12:13,656 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-21 11:12:13,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1991 states and 2663 transitions. [2022-07-21 11:12:13,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2022-07-21 11:12:13,661 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:12:13,661 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-21 11:12:13,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 11:12:13,662 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:12:13,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:12:13,662 INFO L85 PathProgramCache]: Analyzing trace with hash -2082821067, now seen corresponding path program 1 times [2022-07-21 11:12:13,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:12:13,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923031705] [2022-07-21 11:12:13,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:12:13,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:12:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:13,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:12:13,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:13,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 11:12:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:13,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 11:12:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:13,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 11:12:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:13,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 11:12:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:13,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:13,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:13,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 11:12:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:13,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:13,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 11:12:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:13,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:13,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 11:12:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:13,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:13,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:13,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 11:12:13,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:13,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 11:12:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:13,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 11:12:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:13,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 11:12:13,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:13,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-21 11:12:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:13,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:13,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:12:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:13,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:13,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:13,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:13,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:12:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:13,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-07-21 11:12:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:14,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:14,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 11:12:14,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:14,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:12:14,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:14,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:12:14,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:14,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 11:12:14,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:14,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 11:12:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:14,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 11:12:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:14,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 11:12:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:14,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 11:12:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:14,055 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-21 11:12:14,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:12:14,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923031705] [2022-07-21 11:12:14,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923031705] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:12:14,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:12:14,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 11:12:14,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560686150] [2022-07-21 11:12:14,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:12:14,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 11:12:14,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:12:14,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 11:12:14,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-07-21 11:12:14,059 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-21 11:12:16,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:12:16,373 INFO L93 Difference]: Finished difference Result 5156 states and 6960 transitions. [2022-07-21 11:12:16,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 11:12:16,374 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-21 11:12:16,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:12:16,382 INFO L225 Difference]: With dead ends: 5156 [2022-07-21 11:12:16,382 INFO L226 Difference]: Without dead ends: 3262 [2022-07-21 11:12:16,386 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-21 11:12:16,387 INFO L413 NwaCegarLoop]: 1084 mSDtfsCounter, 1623 mSDsluCounter, 2898 mSDsCounter, 0 mSdLazyCounter, 2505 mSolverCounterSat, 875 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1669 SdHoareTripleChecker+Valid, 3982 SdHoareTripleChecker+Invalid, 3380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 875 IncrementalHoareTripleChecker+Valid, 2505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-21 11:12:16,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1669 Valid, 3982 Invalid, 3380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [875 Valid, 2505 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-21 11:12:16,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2022-07-21 11:12:16,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 2007. [2022-07-21 11:12:16,479 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-21 11:12:16,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 2685 transitions. [2022-07-21 11:12:16,482 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 2685 transitions. Word has length 299 [2022-07-21 11:12:16,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:12:16,482 INFO L495 AbstractCegarLoop]: Abstraction has 2007 states and 2685 transitions. [2022-07-21 11:12:16,483 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-21 11:12:16,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 2685 transitions. [2022-07-21 11:12:16,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2022-07-21 11:12:16,488 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:12:16,488 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-21 11:12:16,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 11:12:16,488 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:12:16,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:12:16,489 INFO L85 PathProgramCache]: Analyzing trace with hash 461066554, now seen corresponding path program 1 times [2022-07-21 11:12:16,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:12:16,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045673610] [2022-07-21 11:12:16,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:12:16,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:12:16,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:16,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:12:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:16,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 11:12:16,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:16,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 11:12:16,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:16,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 11:12:16,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:16,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 11:12:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:16,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:16,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 11:12:16,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:16,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:16,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 11:12:16,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:16,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:16,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:16,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 11:12:16,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:16,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:16,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:16,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 11:12:16,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:16,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 11:12:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:16,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 11:12:16,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:16,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 11:12:16,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:16,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-21 11:12:16,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:16,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:16,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:16,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:12:16,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:16,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:16,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:16,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:16,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:16,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:16,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:16,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:12:16,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:16,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-21 11:12:16,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:16,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:16,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:16,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 11:12:16,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:16,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:12:16,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:16,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:12:16,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:16,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 11:12:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:16,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 11:12:16,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:16,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 11:12:16,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:16,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 11:12:16,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:16,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 11:12:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:16,988 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-21 11:12:16,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:12:16,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045673610] [2022-07-21 11:12:16,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045673610] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:12:16,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738382993] [2022-07-21 11:12:16,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:12:16,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:12:16,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:12:17,000 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-21 11:12:17,001 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-21 11:12:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:17,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 3671 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 11:12:17,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:12:17,644 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-21 11:12:17,659 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:12:17,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738382993] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:12:17,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 11:12:17,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 18 [2022-07-21 11:12:17,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910646689] [2022-07-21 11:12:17,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:12:17,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 11:12:17,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:12:17,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 11:12:17,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2022-07-21 11:12:17,661 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-21 11:12:17,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:12:17,917 INFO L93 Difference]: Finished difference Result 5435 states and 7380 transitions. [2022-07-21 11:12:17,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 11:12:17,918 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-21 11:12:17,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:12:17,926 INFO L225 Difference]: With dead ends: 5435 [2022-07-21 11:12:17,926 INFO L226 Difference]: Without dead ends: 3525 [2022-07-21 11:12:17,930 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-21 11:12:17,931 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-21 11:12:17,931 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-21 11:12:17,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3525 states. [2022-07-21 11:12:18,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3525 to 2007. [2022-07-21 11:12:18,024 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-21 11:12:18,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 2685 transitions. [2022-07-21 11:12:18,028 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 2685 transitions. Word has length 301 [2022-07-21 11:12:18,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:12:18,028 INFO L495 AbstractCegarLoop]: Abstraction has 2007 states and 2685 transitions. [2022-07-21 11:12:18,029 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-21 11:12:18,029 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 2685 transitions. [2022-07-21 11:12:18,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2022-07-21 11:12:18,033 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:12:18,033 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-21 11:12:18,061 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-21 11:12:18,259 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-21 11:12:18,260 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:12:18,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:12:18,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1773182242, now seen corresponding path program 1 times [2022-07-21 11:12:18,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:12:18,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871860924] [2022-07-21 11:12:18,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:12:18,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:12:18,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:18,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:12:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:18,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 11:12:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:18,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 11:12:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:18,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 11:12:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:18,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 11:12:18,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:18,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:18,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 11:12:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:18,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:18,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 11:12:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:18,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:18,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 11:12:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:18,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:18,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 11:12:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:18,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 11:12:18,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:18,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 11:12:18,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:18,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 11:12:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:18,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 11:12:18,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:18,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-21 11:12:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:18,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-21 11:12:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:18,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:18,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:18,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:12:18,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:18,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:18,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:18,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:18,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:18,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:18,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:12:18,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:18,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-21 11:12:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:18,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:18,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:18,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 11:12:18,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:18,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:12:18,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:18,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:12:18,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:18,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 11:12:18,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:18,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 11:12:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:18,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 11:12:18,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:18,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 11:12:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:18,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 11:12:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:18,726 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-21 11:12:18,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:12:18,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871860924] [2022-07-21 11:12:18,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871860924] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:12:18,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587019926] [2022-07-21 11:12:18,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:12:18,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:12:18,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:12:18,728 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-21 11:12:18,729 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-21 11:12:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:19,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 3705 conjuncts, 381 conjunts are in the unsatisfiable core [2022-07-21 11:12:19,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:12:20,014 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-21 11:12:20,014 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:12:20,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587019926] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:12:20,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 11:12:20,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [15] total 32 [2022-07-21 11:12:20,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232294435] [2022-07-21 11:12:20,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:12:20,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-21 11:12:20,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:12:20,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-21 11:12:20,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=879, Unknown=0, NotChecked=0, Total=992 [2022-07-21 11:12:20,016 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-21 11:12:22,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:12:22,860 INFO L93 Difference]: Finished difference Result 6897 states and 9442 transitions. [2022-07-21 11:12:22,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-21 11:12:22,861 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-21 11:12:22,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:12:22,870 INFO L225 Difference]: With dead ends: 6897 [2022-07-21 11:12:22,870 INFO L226 Difference]: Without dead ends: 4987 [2022-07-21 11:12:22,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=179, Invalid=1381, Unknown=0, NotChecked=0, Total=1560 [2022-07-21 11:12:22,878 INFO L413 NwaCegarLoop]: 802 mSDtfsCounter, 3304 mSDsluCounter, 7861 mSDsCounter, 0 mSdLazyCounter, 4434 mSolverCounterSat, 515 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3364 SdHoareTripleChecker+Valid, 8663 SdHoareTripleChecker+Invalid, 4949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 515 IncrementalHoareTripleChecker+Valid, 4434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-21 11:12:22,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3364 Valid, 8663 Invalid, 4949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [515 Valid, 4434 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-21 11:12:22,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4987 states. [2022-07-21 11:12:23,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4987 to 3983. [2022-07-21 11:12:23,057 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-21 11:12:23,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3983 states to 3983 states and 5345 transitions. [2022-07-21 11:12:23,065 INFO L78 Accepts]: Start accepts. Automaton has 3983 states and 5345 transitions. Word has length 311 [2022-07-21 11:12:23,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:12:23,066 INFO L495 AbstractCegarLoop]: Abstraction has 3983 states and 5345 transitions. [2022-07-21 11:12:23,066 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-21 11:12:23,066 INFO L276 IsEmpty]: Start isEmpty. Operand 3983 states and 5345 transitions. [2022-07-21 11:12:23,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2022-07-21 11:12:23,074 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:12:23,074 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-21 11:12:23,097 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-21 11:12:23,297 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-21 11:12:23,298 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:12:23,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:12:23,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1153675596, now seen corresponding path program 1 times [2022-07-21 11:12:23,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:12:23,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732153758] [2022-07-21 11:12:23,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:12:23,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:12:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:23,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:12:23,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:23,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 11:12:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:23,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 11:12:23,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:23,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 11:12:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:23,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 11:12:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:23,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:23,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:23,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:12:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:23,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 11:12:23,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:23,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:23,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 11:12:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:23,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:23,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:23,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 11:12:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:23,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:23,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:12:23,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:23,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-21 11:12:23,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:23,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-21 11:12:23,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:23,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-21 11:12:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:23,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-21 11:12:23,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:23,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-21 11:12:23,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:23,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-21 11:12:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:23,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-21 11:12:23,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:23,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:23,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:23,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:12:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:23,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:23,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:23,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:23,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:23,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:12:23,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:23,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-21 11:12:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:23,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:23,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 11:12:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:23,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:12:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:23,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:12:23,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:23,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 11:12:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:23,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 11:12:23,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:23,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 11:12:23,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:23,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 11:12:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:23,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 11:12:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:23,734 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-21 11:12:23,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:12:23,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732153758] [2022-07-21 11:12:23,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732153758] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:12:23,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668247081] [2022-07-21 11:12:23,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:12:23,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:12:23,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:12:23,736 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-21 11:12:23,802 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-21 11:12:24,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:24,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 3757 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-21 11:12:24,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:12:24,505 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-21 11:12:24,505 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:12:24,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668247081] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:12:24,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 11:12:24,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2022-07-21 11:12:24,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724456460] [2022-07-21 11:12:24,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:12:24,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 11:12:24,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:12:24,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 11:12:24,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-07-21 11:12:24,508 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-21 11:12:24,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:12:24,644 INFO L93 Difference]: Finished difference Result 7928 states and 10656 transitions. [2022-07-21 11:12:24,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 11:12:24,644 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-21 11:12:24,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:12:24,654 INFO L225 Difference]: With dead ends: 7928 [2022-07-21 11:12:24,654 INFO L226 Difference]: Without dead ends: 4090 [2022-07-21 11:12:24,662 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-21 11:12:24,662 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-21 11:12:24,663 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-21 11:12:24,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4090 states. [2022-07-21 11:12:24,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4090 to 3983. [2022-07-21 11:12:24,858 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-21 11:12:24,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3983 states to 3983 states and 5339 transitions. [2022-07-21 11:12:24,866 INFO L78 Accepts]: Start accepts. Automaton has 3983 states and 5339 transitions. Word has length 323 [2022-07-21 11:12:24,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:12:24,867 INFO L495 AbstractCegarLoop]: Abstraction has 3983 states and 5339 transitions. [2022-07-21 11:12:24,867 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-21 11:12:24,867 INFO L276 IsEmpty]: Start isEmpty. Operand 3983 states and 5339 transitions. [2022-07-21 11:12:24,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2022-07-21 11:12:24,876 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:12:24,876 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-21 11:12:24,904 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-21 11:12:25,099 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-21 11:12:25,100 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:12:25,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:12:25,100 INFO L85 PathProgramCache]: Analyzing trace with hash -287103134, now seen corresponding path program 1 times [2022-07-21 11:12:25,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:12:25,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974160161] [2022-07-21 11:12:25,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:12:25,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:12:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:25,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:12:25,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:25,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 11:12:25,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:25,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 11:12:25,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:25,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 11:12:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:25,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 11:12:25,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:25,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:25,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:25,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:12:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:25,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 11:12:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:25,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 11:12:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:25,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:25,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 11:12:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:25,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:25,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 11:12:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:25,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:25,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-21 11:12:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:25,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 11:12:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:25,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 11:12:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:25,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 11:12:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:25,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-21 11:12:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:25,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-21 11:12:25,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:25,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-21 11:12:25,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:25,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:25,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:25,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:12:25,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:25,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:25,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:25,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:25,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:12:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:25,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-07-21 11:12:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:25,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:25,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 11:12:25,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:25,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:12:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:25,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:12:25,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:25,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 11:12:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:25,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 11:12:25,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:25,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 11:12:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:25,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 11:12:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:25,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 11:12:25,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:25,583 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-21 11:12:25,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:12:25,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974160161] [2022-07-21 11:12:25,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974160161] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:12:25,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889990628] [2022-07-21 11:12:25,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:12:25,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:12:25,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:12:25,585 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-21 11:12:25,586 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-21 11:12:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:26,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 3825 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-21 11:12:26,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:12:26,350 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-21 11:12:26,350 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:12:26,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889990628] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:12:26,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 11:12:26,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 18 [2022-07-21 11:12:26,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722806181] [2022-07-21 11:12:26,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:12:26,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 11:12:26,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:12:26,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 11:12:26,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2022-07-21 11:12:26,355 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-21 11:12:26,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:12:26,811 INFO L93 Difference]: Finished difference Result 9217 states and 12606 transitions. [2022-07-21 11:12:26,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 11:12:26,812 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-21 11:12:26,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:12:26,825 INFO L225 Difference]: With dead ends: 9217 [2022-07-21 11:12:26,825 INFO L226 Difference]: Without dead ends: 5379 [2022-07-21 11:12:26,832 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-21 11:12:26,833 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.1s IncrementalHoareTripleChecker+Time [2022-07-21 11:12:26,833 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.1s Time] [2022-07-21 11:12:26,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5379 states. [2022-07-21 11:12:27,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5379 to 4007. [2022-07-21 11:12:27,029 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-21 11:12:27,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4007 states to 4007 states and 5372 transitions. [2022-07-21 11:12:27,037 INFO L78 Accepts]: Start accepts. Automaton has 4007 states and 5372 transitions. Word has length 325 [2022-07-21 11:12:27,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:12:27,037 INFO L495 AbstractCegarLoop]: Abstraction has 4007 states and 5372 transitions. [2022-07-21 11:12:27,038 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-21 11:12:27,038 INFO L276 IsEmpty]: Start isEmpty. Operand 4007 states and 5372 transitions. [2022-07-21 11:12:27,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2022-07-21 11:12:27,046 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:12:27,047 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 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, 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-21 11:12:27,070 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-21 11:12:27,260 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-21 11:12:27,261 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:12:27,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:12:27,261 INFO L85 PathProgramCache]: Analyzing trace with hash -631798227, now seen corresponding path program 2 times [2022-07-21 11:12:27,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:12:27,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355227359] [2022-07-21 11:12:27,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:12:27,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:12:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:27,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:12:27,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:27,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 11:12:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:27,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 11:12:27,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:27,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 11:12:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:27,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 11:12:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:27,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:27,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:27,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:12:27,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:27,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 11:12:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:27,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 11:12:27,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:27,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:27,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:27,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 11:12:27,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:27,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:27,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 11:12:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:27,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:27,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:27,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-21 11:12:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:27,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:12:27,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:27,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-21 11:12:27,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:27,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 11:12:27,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:27,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-21 11:12:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:27,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-21 11:12:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:27,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-21 11:12:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:27,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-21 11:12:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:27,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:27,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:12:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:27,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:27,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:27,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:27,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:27,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:27,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:12:27,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:27,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2022-07-21 11:12:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:27,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:27,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:27,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 11:12:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:27,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:12:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:27,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:12:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:27,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 11:12:27,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:27,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 11:12:27,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:27,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 11:12:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:27,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 11:12:27,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:27,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 11:12:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:27,689 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 37 proven. 11 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2022-07-21 11:12:27,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:12:27,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355227359] [2022-07-21 11:12:27,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355227359] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:12:27,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933224861] [2022-07-21 11:12:27,690 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 11:12:27,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:12:27,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:12:27,691 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-21 11:12:27,692 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-21 11:12:28,206 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-21 11:12:28,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 11:12:28,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 2106 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-21 11:12:28,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:12:28,454 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2022-07-21 11:12:28,454 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:12:28,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933224861] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:12:28,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 11:12:28,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [14] total 26 [2022-07-21 11:12:28,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070687035] [2022-07-21 11:12:28,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:12:28,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 11:12:28,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:12:28,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 11:12:28,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2022-07-21 11:12:28,456 INFO L87 Difference]: Start difference. First operand 4007 states and 5372 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-21 11:12:28,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:12:28,872 INFO L93 Difference]: Finished difference Result 7955 states and 10708 transitions. [2022-07-21 11:12:28,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 11:12:28,873 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 331 [2022-07-21 11:12:28,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:12:28,883 INFO L225 Difference]: With dead ends: 7955 [2022-07-21 11:12:28,883 INFO L226 Difference]: Without dead ends: 4093 [2022-07-21 11:12:28,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 390 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-21 11:12:28,890 INFO L413 NwaCegarLoop]: 717 mSDtfsCounter, 51 mSDsluCounter, 7800 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 8517 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 11:12:28,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 8517 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 11:12:28,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4093 states. [2022-07-21 11:12:29,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4093 to 4013. [2022-07-21 11:12:29,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4013 states, 3023 states have (on average 1.3159113463446908) internal successors, (3978), 3103 states have internal predecessors, (3978), 664 states have call successors, (664), 297 states have call predecessors, (664), 325 states have return successors, (730), 642 states have call predecessors, (730), 663 states have call successors, (730) [2022-07-21 11:12:29,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4013 states to 4013 states and 5372 transitions. [2022-07-21 11:12:29,102 INFO L78 Accepts]: Start accepts. Automaton has 4013 states and 5372 transitions. Word has length 331 [2022-07-21 11:12:29,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:12:29,103 INFO L495 AbstractCegarLoop]: Abstraction has 4013 states and 5372 transitions. [2022-07-21 11:12:29,103 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-21 11:12:29,103 INFO L276 IsEmpty]: Start isEmpty. Operand 4013 states and 5372 transitions. [2022-07-21 11:12:29,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2022-07-21 11:12:29,111 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:12:29,112 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:12:29,149 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-21 11:12:29,331 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-21 11:12:29,332 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:12:29,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:12:29,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1126314739, now seen corresponding path program 1 times [2022-07-21 11:12:29,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:12:29,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898676520] [2022-07-21 11:12:29,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:12:29,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:12:29,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:29,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:12:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:29,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 11:12:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:29,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 11:12:29,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:29,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 11:12:29,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:29,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 11:12:29,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:29,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:29,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:29,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:12:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:29,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 11:12:29,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:29,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 11:12:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:29,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:29,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 11:12:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:29,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:29,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 11:12:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:29,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:29,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:29,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-21 11:12:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:29,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:12:29,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:29,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-21 11:12:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:29,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 11:12:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:29,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-21 11:12:29,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:29,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-21 11:12:29,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:29,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-21 11:12:29,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:29,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-21 11:12:29,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:29,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:29,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:29,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:12:29,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:29,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:29,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:29,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:29,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:29,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:29,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:29,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:12:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:29,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 11:12:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:29,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 11:12:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:29,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 11:12:29,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:29,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2022-07-21 11:12:29,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:29,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:29,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 11:12:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:29,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:12:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:29,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:12:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:29,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 11:12:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:29,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 11:12:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:29,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 11:12:29,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:29,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 11:12:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:29,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 11:12:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:29,859 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-21 11:12:29,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:12:29,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898676520] [2022-07-21 11:12:29,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898676520] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:12:29,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679611921] [2022-07-21 11:12:29,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:12:29,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:12:29,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:12:29,861 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-21 11:12:29,862 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-21 11:12:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:30,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 4050 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-21 11:12:30,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:12:30,728 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-21 11:12:30,728 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:12:30,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679611921] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:12:30,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 11:12:30,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 15 [2022-07-21 11:12:30,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524719750] [2022-07-21 11:12:30,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:12:30,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 11:12:30,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:12:30,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 11:12:30,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-07-21 11:12:30,735 INFO L87 Difference]: Start difference. First operand 4013 states and 5372 transitions. Second operand has 8 states, 8 states have (on average 26.5) internal successors, (212), 6 states have internal predecessors, (212), 2 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (41), 4 states have call predecessors, (41), 2 states have call successors, (41) [2022-07-21 11:12:30,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:12:30,976 INFO L93 Difference]: Finished difference Result 8349 states and 11253 transitions. [2022-07-21 11:12:30,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 11:12:30,976 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 26.5) internal successors, (212), 6 states have internal predecessors, (212), 2 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (41), 4 states have call predecessors, (41), 2 states have call successors, (41) Word has length 344 [2022-07-21 11:12:30,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:12:30,987 INFO L225 Difference]: With dead ends: 8349 [2022-07-21 11:12:30,987 INFO L226 Difference]: Without dead ends: 4481 [2022-07-21 11:12:30,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 418 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2022-07-21 11:12:30,994 INFO L413 NwaCegarLoop]: 851 mSDtfsCounter, 314 mSDsluCounter, 4664 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 5515 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 11:12:30,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 5515 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 11:12:30,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4481 states. [2022-07-21 11:12:31,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4481 to 4043. [2022-07-21 11:12:31,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4043 states, 3047 states have (on average 1.313423039054808) internal successors, (4002), 3121 states have internal predecessors, (4002), 664 states have call successors, (664), 297 states have call predecessors, (664), 331 states have return successors, (742), 654 states have call predecessors, (742), 663 states have call successors, (742) [2022-07-21 11:12:31,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4043 states to 4043 states and 5408 transitions. [2022-07-21 11:12:31,192 INFO L78 Accepts]: Start accepts. Automaton has 4043 states and 5408 transitions. Word has length 344 [2022-07-21 11:12:31,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:12:31,192 INFO L495 AbstractCegarLoop]: Abstraction has 4043 states and 5408 transitions. [2022-07-21 11:12:31,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.5) internal successors, (212), 6 states have internal predecessors, (212), 2 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (41), 4 states have call predecessors, (41), 2 states have call successors, (41) [2022-07-21 11:12:31,192 INFO L276 IsEmpty]: Start isEmpty. Operand 4043 states and 5408 transitions. [2022-07-21 11:12:31,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2022-07-21 11:12:31,201 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:12:31,201 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] [2022-07-21 11:12:31,227 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-21 11:12:31,419 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-21 11:12:31,420 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:12:31,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:12:31,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1157911828, now seen corresponding path program 2 times [2022-07-21 11:12:31,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:12:31,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924390890] [2022-07-21 11:12:31,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:12:31,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:12:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:12:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 11:12:32,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 11:12:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 11:12:32,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 11:12:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:12:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 11:12:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 11:12:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:32,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:12:32,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 11:12:32,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:12:32,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 11:12:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:12:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-21 11:12:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:12:32,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-21 11:12:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-21 11:12:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-21 11:12:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-21 11:12:32,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-21 11:12:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-21 11:12:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:12:32,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:32,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:32,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:32,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:12:32,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 11:12:32,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 11:12:32,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 11:12:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2022-07-21 11:12:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:32,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 11:12:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:12:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:12:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 11:12:32,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 11:12:32,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 11:12:32,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 11:12:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 11:12:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:32,410 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2022-07-21 11:12:32,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:12:32,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924390890] [2022-07-21 11:12:32,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924390890] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:12:32,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:12:32,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 11:12:32,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340119964] [2022-07-21 11:12:32,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:12:32,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 11:12:32,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:12:32,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 11:12:32,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-21 11:12:32,412 INFO L87 Difference]: Start difference. First operand 4043 states and 5408 transitions. Second operand has 11 states, 11 states have (on average 16.818181818181817) internal successors, (185), 4 states have internal predecessors, (185), 2 states have call successors, (39), 9 states have call predecessors, (39), 2 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2022-07-21 11:12:34,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:12:34,428 INFO L93 Difference]: Finished difference Result 8343 states and 11221 transitions. [2022-07-21 11:12:34,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 11:12:34,428 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 16.818181818181817) internal successors, (185), 4 states have internal predecessors, (185), 2 states have call successors, (39), 9 states have call predecessors, (39), 2 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 362 [2022-07-21 11:12:34,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:12:34,438 INFO L225 Difference]: With dead ends: 8343 [2022-07-21 11:12:34,439 INFO L226 Difference]: Without dead ends: 4326 [2022-07-21 11:12:34,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2022-07-21 11:12:34,446 INFO L413 NwaCegarLoop]: 633 mSDtfsCounter, 740 mSDsluCounter, 2111 mSDsCounter, 0 mSdLazyCounter, 1642 mSolverCounterSat, 531 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 2744 SdHoareTripleChecker+Invalid, 2173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 531 IncrementalHoareTripleChecker+Valid, 1642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-21 11:12:34,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 2744 Invalid, 2173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [531 Valid, 1642 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-21 11:12:34,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4326 states. [2022-07-21 11:12:34,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4326 to 4044. [2022-07-21 11:12:34,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4044 states, 3048 states have (on average 1.3133202099737533) internal successors, (4003), 3122 states have internal predecessors, (4003), 664 states have call successors, (664), 297 states have call predecessors, (664), 331 states have return successors, (742), 654 states have call predecessors, (742), 663 states have call successors, (742) [2022-07-21 11:12:34,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4044 states to 4044 states and 5409 transitions. [2022-07-21 11:12:34,656 INFO L78 Accepts]: Start accepts. Automaton has 4044 states and 5409 transitions. Word has length 362 [2022-07-21 11:12:34,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:12:34,656 INFO L495 AbstractCegarLoop]: Abstraction has 4044 states and 5409 transitions. [2022-07-21 11:12:34,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.818181818181817) internal successors, (185), 4 states have internal predecessors, (185), 2 states have call successors, (39), 9 states have call predecessors, (39), 2 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2022-07-21 11:12:34,656 INFO L276 IsEmpty]: Start isEmpty. Operand 4044 states and 5409 transitions. [2022-07-21 11:12:34,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2022-07-21 11:12:34,663 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:12:34,663 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, 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-21 11:12:34,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-21 11:12:34,664 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:12:34,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:12:34,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1691241993, now seen corresponding path program 1 times [2022-07-21 11:12:34,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:12:34,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573724737] [2022-07-21 11:12:34,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:12:34,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:12:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:34,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:12:34,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:34,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 11:12:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:34,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 11:12:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:34,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 11:12:34,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:34,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 11:12:34,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:34,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:34,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:34,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:12:34,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:34,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 11:12:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:34,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 11:12:34,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:34,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:34,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:34,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:12:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:34,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 11:12:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:34,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:34,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:34,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 11:12:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:34,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:34,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:34,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:12:34,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:34,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-21 11:12:34,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:34,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:12:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:34,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-21 11:12:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:34,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-21 11:12:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:35,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-21 11:12:35,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:35,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-21 11:12:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:35,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-21 11:12:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:35,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-07-21 11:12:35,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:35,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:35,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:35,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:12:35,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:35,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:35,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:35,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:35,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:35,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:35,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:35,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:12:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:35,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 11:12:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:35,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 11:12:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:35,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 11:12:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:35,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2022-07-21 11:12:35,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:35,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:35,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:35,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 11:12:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:35,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:12:35,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:35,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:12:35,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:35,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 11:12:35,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:35,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 11:12:35,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:35,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 11:12:35,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:35,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 11:12:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:35,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 11:12:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:35,155 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2022-07-21 11:12:35,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:12:35,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573724737] [2022-07-21 11:12:35,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573724737] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:12:35,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599647308] [2022-07-21 11:12:35,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:12:35,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:12:35,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:12:35,157 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-21 11:12:35,179 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-21 11:12:36,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:36,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 4123 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-21 11:12:36,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:12:36,737 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-07-21 11:12:36,737 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:12:36,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599647308] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:12:36,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 11:12:36,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 15 [2022-07-21 11:12:36,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574072105] [2022-07-21 11:12:36,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:12:36,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 11:12:36,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:12:36,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 11:12:36,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-07-21 11:12:36,739 INFO L87 Difference]: Start difference. First operand 4044 states and 5409 transitions. Second operand has 8 states, 8 states have (on average 26.625) internal successors, (213), 6 states have internal predecessors, (213), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (41), 4 states have call predecessors, (41), 2 states have call successors, (41) [2022-07-21 11:12:37,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:12:37,011 INFO L93 Difference]: Finished difference Result 8392 states and 11302 transitions. [2022-07-21 11:12:37,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 11:12:37,012 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 26.625) internal successors, (213), 6 states have internal predecessors, (213), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (41), 4 states have call predecessors, (41), 2 states have call successors, (41) Word has length 360 [2022-07-21 11:12:37,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:12:37,023 INFO L225 Difference]: With dead ends: 8392 [2022-07-21 11:12:37,024 INFO L226 Difference]: Without dead ends: 4494 [2022-07-21 11:12:37,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 438 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2022-07-21 11:12:37,031 INFO L413 NwaCegarLoop]: 860 mSDtfsCounter, 307 mSDsluCounter, 4700 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 5560 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 11:12:37,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 5560 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 11:12:37,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4494 states. [2022-07-21 11:12:37,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4494 to 4056. [2022-07-21 11:12:37,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4056 states, 3060 states have (on average 1.3120915032679739) internal successors, (4015), 3128 states have internal predecessors, (4015), 664 states have call successors, (664), 297 states have call predecessors, (664), 331 states have return successors, (742), 660 states have call predecessors, (742), 663 states have call successors, (742) [2022-07-21 11:12:37,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4056 states to 4056 states and 5421 transitions. [2022-07-21 11:12:37,316 INFO L78 Accepts]: Start accepts. Automaton has 4056 states and 5421 transitions. Word has length 360 [2022-07-21 11:12:37,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:12:37,316 INFO L495 AbstractCegarLoop]: Abstraction has 4056 states and 5421 transitions. [2022-07-21 11:12:37,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.625) internal successors, (213), 6 states have internal predecessors, (213), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (41), 4 states have call predecessors, (41), 2 states have call successors, (41) [2022-07-21 11:12:37,316 INFO L276 IsEmpty]: Start isEmpty. Operand 4056 states and 5421 transitions. [2022-07-21 11:12:37,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2022-07-21 11:12:37,323 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:12:37,324 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, 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-21 11:12:37,353 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-21 11:12:37,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-21 11:12:37,536 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:12:37,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:12:37,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1351184652, now seen corresponding path program 2 times [2022-07-21 11:12:37,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:12:37,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173762332] [2022-07-21 11:12:37,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:12:37,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:12:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:37,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:12:37,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:37,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 11:12:37,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:37,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 11:12:37,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:37,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 11:12:37,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:37,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 11:12:37,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:37,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:37,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:12:37,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:37,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 11:12:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:37,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 11:12:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:37,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:37,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:37,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:12:37,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:37,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 11:12:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:37,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:37,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:12:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:37,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-21 11:12:37,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:37,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:37,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:12:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:37,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-21 11:12:37,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:38,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:12:38,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:38,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-21 11:12:38,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:38,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-21 11:12:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:38,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-21 11:12:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:38,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-21 11:12:38,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:38,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-21 11:12:38,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:38,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-07-21 11:12:38,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:38,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:38,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:12:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:38,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:38,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:38,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:38,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:38,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:38,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:38,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:12:38,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:38,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 11:12:38,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:38,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 11:12:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:38,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 11:12:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:38,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2022-07-21 11:12:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:38,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:12:38,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:38,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 11:12:38,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:38,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:12:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:38,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:12:38,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:38,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 11:12:38,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:38,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 11:12:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:38,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 11:12:38,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:38,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 11:12:38,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:38,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 11:12:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:12:38,182 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-21 11:12:38,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:12:38,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173762332] [2022-07-21 11:12:38,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173762332] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:12:38,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066242457] [2022-07-21 11:12:38,182 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 11:12:38,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:12:38,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:12:38,183 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-21 11:12:38,185 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-21 11:12:43,304 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 11:12:43,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 11:12:43,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 4149 conjuncts, 459 conjunts are in the unsatisfiable core [2022-07-21 11:12:43,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:12:43,398 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 11:12:43,398 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-21 11:12:43,837 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 11:12:43,837 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-21 11:12:44,024 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-21 11:12:44,382 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 11:12:44,382 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-21 11:12:45,170 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-21 11:12:45,458 INFO L356 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2022-07-21 11:12:45,459 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-21 11:12:45,557 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-21 11:12:45,682 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 24 treesize of output 20 [2022-07-21 11:13:04,134 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-21 11:13:18,723 INFO L356 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2022-07-21 11:13:18,723 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-21 11:13:18,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:13:18,854 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 54 treesize of output 41 [2022-07-21 11:13:18,931 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 24 treesize of output 20 [2022-07-21 11:13:29,317 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-21 11:13:30,107 INFO L356 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2022-07-21 11:13:30,107 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-21 11:13:30,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:13:30,200 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 54 treesize of output 41 [2022-07-21 11:13:30,263 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 24 treesize of output 20 [2022-07-21 11:13:34,842 INFO L356 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2022-07-21 11:13:34,843 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 31 treesize of output 37 [2022-07-21 11:13:35,258 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-21 11:13:35,269 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 88 treesize of output 106 [2022-07-21 11:13:35,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:13:35,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 19 [2022-07-21 11:13:35,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:13:35,296 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 98 [2022-07-21 11:13:35,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:13:35,307 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 15 treesize of output 19 [2022-07-21 11:13:41,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:13:41,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:13:41,632 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 11:13:41,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-07-21 11:13:41,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2022-07-21 11:13:41,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 94 treesize of output 103 [2022-07-21 11:13:41,664 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-07-21 11:13:41,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2022-07-21 11:13:41,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 70 treesize of output 67 [2022-07-21 11:13:44,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:13:44,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:13:44,548 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 11:13:44,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 160 treesize of output 57 [2022-07-21 11:13:44,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-07-21 11:13:45,605 INFO L356 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2022-07-21 11:13:45,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 78 [2022-07-21 11:13:45,627 INFO L356 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2022-07-21 11:13:45,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 78 [2022-07-21 11:13:45,634 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-21 11:13:45,640 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-21 11:13:45,655 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 16 treesize of output 15 [2022-07-21 11:13:45,672 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 16 treesize of output 15 [2022-07-21 11:13:45,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 46 [2022-07-21 11:13:45,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 29 [2022-07-21 11:13:46,496 INFO L356 Elim1Store]: treesize reduction 755, result has 25.3 percent of original size [2022-07-21 11:13:46,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 138 treesize of output 565 [2022-07-21 11:13:46,912 INFO L356 Elim1Store]: treesize reduction 310, result has 37.1 percent of original size [2022-07-21 11:13:46,914 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-21 11:13:46,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-21 11:13:47,114 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,SelfDestructingSolverStorable21 [2022-07-21 11:13:47,115 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_old(#memory_$Pointer$.base)_BEFORE_CALL_8| input size 246 context size 246 output size 246 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:764) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:725) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:643) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:335) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-21 11:13:47,118 INFO L158 Benchmark]: Toolchain (without parser) took 116921.27ms. Allocated memory was 58.7MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 26.9MB in the beginning and 895.0MB in the end (delta: -868.1MB). Peak memory consumption was 234.8MB. Max. memory is 16.1GB. [2022-07-21 11:13:47,118 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 58.7MB. Free memory was 40.9MB in the beginning and 40.9MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 11:13:47,118 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1549.82ms. Allocated memory was 58.7MB in the beginning and 96.5MB in the end (delta: 37.7MB). Free memory was 26.8MB in the beginning and 35.7MB in the end (delta: -8.9MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. [2022-07-21 11:13:47,119 INFO L158 Benchmark]: Boogie Procedure Inliner took 125.09ms. Allocated memory was 96.5MB in the beginning and 119.5MB in the end (delta: 23.1MB). Free memory was 35.7MB in the beginning and 61.0MB in the end (delta: -25.3MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2022-07-21 11:13:47,119 INFO L158 Benchmark]: Boogie Preprocessor took 107.63ms. Allocated memory is still 119.5MB. Free memory was 61.0MB in the beginning and 49.9MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-21 11:13:47,119 INFO L158 Benchmark]: RCFGBuilder took 1590.77ms. Allocated memory was 119.5MB in the beginning and 169.9MB in the end (delta: 50.3MB). Free memory was 49.9MB in the beginning and 117.7MB in the end (delta: -67.7MB). Peak memory consumption was 61.5MB. Max. memory is 16.1GB. [2022-07-21 11:13:47,120 INFO L158 Benchmark]: TraceAbstraction took 113542.27ms. Allocated memory was 169.9MB in the beginning and 1.2GB in the end (delta: 992.0MB). Free memory was 116.6MB in the beginning and 895.0MB in the end (delta: -778.4MB). Peak memory consumption was 214.6MB. Max. memory is 16.1GB. [2022-07-21 11:13:47,125 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 58.7MB. Free memory was 40.9MB in the beginning and 40.9MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1549.82ms. Allocated memory was 58.7MB in the beginning and 96.5MB in the end (delta: 37.7MB). Free memory was 26.8MB in the beginning and 35.7MB in the end (delta: -8.9MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 125.09ms. Allocated memory was 96.5MB in the beginning and 119.5MB in the end (delta: 23.1MB). Free memory was 35.7MB in the beginning and 61.0MB in the end (delta: -25.3MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 107.63ms. Allocated memory is still 119.5MB. Free memory was 61.0MB in the beginning and 49.9MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1590.77ms. Allocated memory was 119.5MB in the beginning and 169.9MB in the end (delta: 50.3MB). Free memory was 49.9MB in the beginning and 117.7MB in the end (delta: -67.7MB). Peak memory consumption was 61.5MB. Max. memory is 16.1GB. * TraceAbstraction took 113542.27ms. Allocated memory was 169.9MB in the beginning and 1.2GB in the end (delta: 992.0MB). Free memory was 116.6MB in the beginning and 895.0MB in the end (delta: -778.4MB). Peak memory consumption was 214.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_old(#memory_$Pointer$.base)_BEFORE_CALL_8| input size 246 context size 246 output size 246 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_old(#memory_$Pointer$.base)_BEFORE_CALL_8| input size 246 context size 246 output size 246: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-21 11:13:47,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_Bitvector.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-?-3598765 [2022-07-21 11:13:48,879 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 11:13:48,881 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 11:13:48,915 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 11:13:48,916 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 11:13:48,917 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 11:13:48,922 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 11:13:48,924 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 11:13:48,926 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 11:13:48,926 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 11:13:48,927 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 11:13:48,928 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 11:13:48,928 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 11:13:48,929 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 11:13:48,929 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 11:13:48,931 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 11:13:48,932 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 11:13:48,934 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 11:13:48,937 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 11:13:48,938 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 11:13:48,942 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 11:13:48,942 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 11:13:48,943 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 11:13:48,943 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 11:13:48,944 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 11:13:48,956 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 11:13:48,959 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 11:13:48,960 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 11:13:48,960 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 11:13:48,961 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 11:13:48,961 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 11:13:48,961 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 11:13:48,962 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 11:13:48,963 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 11:13:48,964 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 11:13:48,965 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 11:13:48,965 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 11:13:48,965 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 11:13:48,966 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 11:13:48,966 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 11:13:48,966 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 11:13:48,967 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 11:13:48,968 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-07-21 11:13:48,987 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 11:13:48,988 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 11:13:48,988 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 11:13:48,988 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 11:13:48,989 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 11:13:48,989 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 11:13:48,989 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 11:13:48,990 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 11:13:48,990 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 11:13:48,990 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 11:13:48,991 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 11:13:48,991 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 11:13:48,991 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 11:13:48,991 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 11:13:48,991 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 11:13:48,991 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-21 11:13:48,991 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-21 11:13:48,992 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 11:13:48,992 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 11:13:48,992 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 11:13:48,992 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 11:13:48,992 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 11:13:48,992 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 11:13:48,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 11:13:48,993 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 11:13:48,993 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 11:13:48,993 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 11:13:48,993 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-21 11:13:48,993 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-21 11:13:48,993 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 11:13:48,994 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 11:13:48,994 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 11:13:48,994 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-21 11:13:48,994 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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-21 11:13:49,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 11:13:49,252 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 11:13:49,254 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 11:13:49,254 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 11:13:49,255 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 11:13:49,256 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-21 11:13:49,300 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b1faade7/cf4d59f61a0b495b8b23f75dfd9a759c/FLAGd73175141 [2022-07-21 11:13:49,874 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 11:13:49,875 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-21 11:13:49,907 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b1faade7/cf4d59f61a0b495b8b23f75dfd9a759c/FLAGd73175141 [2022-07-21 11:13:50,030 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b1faade7/cf4d59f61a0b495b8b23f75dfd9a759c [2022-07-21 11:13:50,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 11:13:50,033 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 11:13:50,035 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 11:13:50,035 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 11:13:50,037 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 11:13:50,037 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:13:50" (1/1) ... [2022-07-21 11:13:50,038 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ea3f4b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:13:50, skipping insertion in model container [2022-07-21 11:13:50,038 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:13:50" (1/1) ... [2022-07-21 11:13:50,042 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 11:13:50,119 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 11:13:50,678 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-21 11:13:51,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 11:13:51,140 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-21 11:13:51,208 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 11:13:51,345 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-21 11:13:51,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 11:13:51,475 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 11:13:51,591 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-21 11:13:51,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 11:13:51,715 INFO L208 MainTranslator]: Completed translation [2022-07-21 11:13:51,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:13:51 WrapperNode [2022-07-21 11:13:51,716 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 11:13:51,717 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 11:13:51,717 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 11:13:51,717 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 11:13:51,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:13:51" (1/1) ... [2022-07-21 11:13:51,764 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:13:51" (1/1) ... [2022-07-21 11:13:51,832 INFO L137 Inliner]: procedures = 195, calls = 1285, calls flagged for inlining = 87, calls inlined = 41, statements flattened = 1694 [2022-07-21 11:13:51,846 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 11:13:51,847 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 11:13:51,847 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 11:13:51,847 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 11:13:51,852 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:13:51" (1/1) ... [2022-07-21 11:13:51,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:13:51" (1/1) ... [2022-07-21 11:13:51,860 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:13:51" (1/1) ... [2022-07-21 11:13:51,860 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:13:51" (1/1) ... [2022-07-21 11:13:51,890 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:13:51" (1/1) ... [2022-07-21 11:13:51,896 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:13:51" (1/1) ... [2022-07-21 11:13:51,910 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:13:51" (1/1) ... [2022-07-21 11:13:51,921 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 11:13:51,922 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 11:13:51,922 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 11:13:51,922 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 11:13:51,922 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:13:51" (1/1) ... [2022-07-21 11:13:51,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 11:13:51,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:13:51,956 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-21 11:13:51,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-21 11:13:51,981 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_resume [2022-07-21 11:13:51,981 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_resume [2022-07-21 11:13:51,981 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2022-07-21 11:13:51,981 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2022-07-21 11:13:51,981 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2022-07-21 11:13:51,981 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2022-07-21 11:13:51,981 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2022-07-21 11:13:51,981 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2022-07-21 11:13:51,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-07-21 11:13:51,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-21 11:13:51,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2022-07-21 11:13:51,982 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-21 11:13:51,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-21 11:13:51,982 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-21 11:13:51,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-21 11:13:51,982 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_submit_rx_urb [2022-07-21 11:13:51,982 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_submit_rx_urb [2022-07-21 11:13:51,983 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-07-21 11:13:51,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-07-21 11:13:51,983 INFO L130 BoogieDeclarations]: Found specification of procedure __if_usb_submit_rx_urb [2022-07-21 11:13:51,961 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-21 11:13:51,983 INFO L138 BoogieDeclarations]: Found implementation of procedure __if_usb_submit_rx_urb [2022-07-21 11:13:51,983 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2022-07-21 11:13:51,984 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2022-07-21 11:13:51,984 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-21 11:13:51,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-21 11:13:51,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-21 11:13:51,984 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-21 11:13:51,984 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-21 11:13:51,984 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-21 11:13:51,985 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_disconnect [2022-07-21 11:13:51,985 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_disconnect [2022-07-21 11:13:51,985 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_timer_1 [2022-07-21 11:13:51,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_timer_1 [2022-07-21 11:13:51,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 11:13:51,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 11:13:51,985 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-07-21 11:13:51,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-07-21 11:13:51,985 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_num [2022-07-21 11:13:51,986 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_num [2022-07-21 11:13:51,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-07-21 11:13:51,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-07-21 11:13:51,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2022-07-21 11:13:51,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 11:13:51,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-21 11:13:51,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 11:13:51,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2022-07-21 11:13:51,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-21 11:13:51,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-07-21 11:13:51,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2022-07-21 11:13:51,988 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-21 11:13:51,988 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-21 11:13:51,989 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-21 11:13:51,989 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-21 11:13:51,989 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2022-07-21 11:13:51,989 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2022-07-21 11:13:51,989 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-21 11:13:51,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-21 11:13:51,990 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_reset_device [2022-07-21 11:13:51,990 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_reset_device [2022-07-21 11:13:51,990 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_bulk [2022-07-21 11:13:51,990 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_bulk [2022-07-21 11:13:51,990 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2022-07-21 11:13:51,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2022-07-21 11:13:51,991 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-21 11:13:51,991 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-21 11:13:51,991 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-21 11:13:51,991 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-21 11:13:51,991 INFO L130 BoogieDeclarations]: Found specification of procedure activate_suitable_timer_1 [2022-07-21 11:13:51,992 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_suitable_timer_1 [2022-07-21 11:13:51,992 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-21 11:13:51,992 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-21 11:13:51,992 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_free [2022-07-21 11:13:51,992 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_free [2022-07-21 11:13:51,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 11:13:51,992 INFO L130 BoogieDeclarations]: Found specification of procedure usb_tx_block [2022-07-21 11:13:51,993 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_tx_block [2022-07-21 11:13:51,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 11:13:51,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 11:13:51,993 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-21 11:13:51,993 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2022-07-21 11:13:51,993 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2022-07-21 11:13:51,993 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-07-21 11:13:51,993 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-07-21 11:13:51,994 INFO L130 BoogieDeclarations]: Found specification of procedure lbs_remove_card [2022-07-21 11:13:51,994 INFO L138 BoogieDeclarations]: Found implementation of procedure lbs_remove_card [2022-07-21 11:13:51,994 INFO L130 BoogieDeclarations]: Found specification of procedure dev_name [2022-07-21 11:13:51,994 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_name [2022-07-21 11:13:51,994 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2022-07-21 11:13:51,995 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2022-07-21 11:13:51,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 11:13:51,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 11:13:51,995 INFO L130 BoogieDeclarations]: Found specification of procedure preempt_count [2022-07-21 11:13:51,996 INFO L138 BoogieDeclarations]: Found implementation of procedure preempt_count [2022-07-21 11:13:52,308 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 11:13:52,310 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 11:13:54,323 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-21 11:13:58,192 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 11:13:58,207 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 11:13:58,207 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-21 11:13:58,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:13:58 BoogieIcfgContainer [2022-07-21 11:13:58,210 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 11:13:58,211 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 11:13:58,211 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 11:13:58,213 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 11:13:58,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 11:13:50" (1/3) ... [2022-07-21 11:13:58,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53742437 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:13:58, skipping insertion in model container [2022-07-21 11:13:58,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:13:51" (2/3) ... [2022-07-21 11:13:58,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53742437 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:13:58, skipping insertion in model container [2022-07-21 11:13:58,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:13:58" (3/3) ... [2022-07-21 11:13:58,216 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-21 11:13:58,226 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 11:13:58,228 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 11:13:58,277 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 11:13:58,284 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@31346e0e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@315610a6 [2022-07-21 11:13:58,284 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 11:13:58,290 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-21 11:13:58,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-21 11:13:58,299 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:13:58,300 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-21 11:13:58,300 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:13:58,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:13:58,308 INFO L85 PathProgramCache]: Analyzing trace with hash -59264917, now seen corresponding path program 1 times [2022-07-21 11:13:58,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 11:13:58,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1177802627] [2022-07-21 11:13:58,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:13:58,318 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 11:13:58,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 11:13:58,320 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 11:13:58,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-21 11:13:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:13:58,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 1100 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 11:13:58,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:13:58,814 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-21 11:13:58,814 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:13:58,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 11:13:58,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1177802627] [2022-07-21 11:13:58,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1177802627] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:13:58,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:13:58,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 11:13:58,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771843192] [2022-07-21 11:13:58,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:13:58,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 11:13:58,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 11:13:58,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 11:13:58,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 11:13:58,859 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 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 11:13:59,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:13:59,004 INFO L93 Difference]: Finished difference Result 1044 states and 1463 transitions. [2022-07-21 11:13:59,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 11:13:59,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2022-07-21 11:13:59,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:13:59,029 INFO L225 Difference]: With dead ends: 1044 [2022-07-21 11:13:59,030 INFO L226 Difference]: Without dead ends: 513 [2022-07-21 11:13:59,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 11:13:59,036 INFO L413 NwaCegarLoop]: 710 mSDtfsCounter, 2 mSDsluCounter, 1418 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2128 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-21 11:13:59,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2128 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 11:13:59,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2022-07-21 11:13:59,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2022-07-21 11:13:59,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 381 states have (on average 1.330708661417323) internal successors, (507), 389 states have internal predecessors, (507), 97 states have call successors, (97), 35 states have call predecessors, (97), 34 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2022-07-21 11:13:59,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 700 transitions. [2022-07-21 11:13:59,091 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 700 transitions. Word has length 31 [2022-07-21 11:13:59,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:13:59,092 INFO L495 AbstractCegarLoop]: Abstraction has 513 states and 700 transitions. [2022-07-21 11:13:59,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 11:13:59,092 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 700 transitions. [2022-07-21 11:13:59,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-21 11:13:59,094 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:13:59,094 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, 1] [2022-07-21 11:13:59,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-21 11:13:59,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 11:13:59,310 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:13:59,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:13:59,310 INFO L85 PathProgramCache]: Analyzing trace with hash 212317188, now seen corresponding path program 1 times [2022-07-21 11:13:59,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 11:13:59,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1301853096] [2022-07-21 11:13:59,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:13:59,312 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 11:13:59,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 11:13:59,313 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 11:13:59,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-21 11:13:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:13:59,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 1111 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 11:13:59,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:13:59,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 11:13:59,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 11:13:59,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 11:13:59,878 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 11:13:59,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1301853096] [2022-07-21 11:13:59,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1301853096] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 11:13:59,878 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 11:13:59,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-21 11:13:59,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332011338] [2022-07-21 11:13:59,878 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 11:13:59,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 11:13:59,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 11:13:59,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 11:13:59,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-21 11:13:59,880 INFO L87 Difference]: Start difference. First operand 513 states and 700 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 11:14:00,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:14:00,037 INFO L93 Difference]: Finished difference Result 1021 states and 1396 transitions. [2022-07-21 11:14:00,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 11:14:00,037 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-07-21 11:14:00,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:14:00,042 INFO L225 Difference]: With dead ends: 1021 [2022-07-21 11:14:00,042 INFO L226 Difference]: Without dead ends: 516 [2022-07-21 11:14:00,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-07-21 11:14:00,045 INFO L413 NwaCegarLoop]: 697 mSDtfsCounter, 7 mSDsluCounter, 3479 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 4176 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 11:14:00,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 4176 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 11:14:00,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2022-07-21 11:14:00,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2022-07-21 11:14:00,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 384 states have (on average 1.328125) internal successors, (510), 392 states have internal predecessors, (510), 97 states have call successors, (97), 35 states have call predecessors, (97), 34 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2022-07-21 11:14:00,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 703 transitions. [2022-07-21 11:14:00,081 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 703 transitions. Word has length 32 [2022-07-21 11:14:00,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:14:00,081 INFO L495 AbstractCegarLoop]: Abstraction has 516 states and 703 transitions. [2022-07-21 11:14:00,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 11:14:00,082 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 703 transitions. [2022-07-21 11:14:00,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-21 11:14:00,087 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:14:00,087 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 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-21 11:14:00,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-21 11:14:00,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 11:14:00,300 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:14:00,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:14:00,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1977069909, now seen corresponding path program 2 times [2022-07-21 11:14:00,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 11:14:00,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1301263984] [2022-07-21 11:14:00,307 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 11:14:00,307 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 11:14:00,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 11:14:00,308 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 11:14:00,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-21 11:14:00,667 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-21 11:14:00,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 11:14:00,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 1100 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 11:14:00,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:14:00,710 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-21 11:14:00,710 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:14:00,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 11:14:00,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1301263984] [2022-07-21 11:14:00,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1301263984] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:14:00,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:14:00,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 11:14:00,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376310397] [2022-07-21 11:14:00,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:14:00,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 11:14:00,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 11:14:00,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 11:14:00,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 11:14:00,712 INFO L87 Difference]: Start difference. First operand 516 states and 703 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 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-21 11:14:00,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:14:00,818 INFO L93 Difference]: Finished difference Result 1498 states and 2054 transitions. [2022-07-21 11:14:00,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 11:14:00,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 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 35 [2022-07-21 11:14:00,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:14:00,823 INFO L225 Difference]: With dead ends: 1498 [2022-07-21 11:14:00,823 INFO L226 Difference]: Without dead ends: 999 [2022-07-21 11:14:00,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 11:14:00,825 INFO L413 NwaCegarLoop]: 801 mSDtfsCounter, 666 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 1481 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 11:14:00,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 1481 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 11:14:00,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2022-07-21 11:14:00,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 999. [2022-07-21 11:14:00,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 741 states have (on average 1.3333333333333333) internal successors, (988), 757 states have internal predecessors, (988), 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-21 11:14:00,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1367 transitions. [2022-07-21 11:14:00,871 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1367 transitions. Word has length 35 [2022-07-21 11:14:00,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:14:00,872 INFO L495 AbstractCegarLoop]: Abstraction has 999 states and 1367 transitions. [2022-07-21 11:14:00,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 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-21 11:14:00,872 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1367 transitions. [2022-07-21 11:14:00,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-21 11:14:00,875 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:14:00,875 INFO L195 NwaCegarLoop]: trace histogram [4, 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-21 11:14:00,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-21 11:14:01,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 11:14:01,088 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:14:01,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:14:01,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1253480148, now seen corresponding path program 1 times [2022-07-21 11:14:01,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 11:14:01,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [588926308] [2022-07-21 11:14:01,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:14:01,090 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 11:14:01,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 11:14:01,091 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 11:14:01,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-21 11:14:01,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:14:01,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 1189 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 11:14:01,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:14:01,527 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-21 11:14:01,527 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:14:01,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 11:14:01,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [588926308] [2022-07-21 11:14:01,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [588926308] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:14:01,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:14:01,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 11:14:01,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993672742] [2022-07-21 11:14:01,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:14:01,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 11:14:01,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 11:14:01,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 11:14:01,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 11:14:01,528 INFO L87 Difference]: Start difference. First operand 999 states and 1367 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (4), 2 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-21 11:14:01,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:14:01,619 INFO L93 Difference]: Finished difference Result 1011 states and 1377 transitions. [2022-07-21 11:14:01,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 11:14:01,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (4), 2 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 45 [2022-07-21 11:14:01,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:14:01,624 INFO L225 Difference]: With dead ends: 1011 [2022-07-21 11:14:01,624 INFO L226 Difference]: Without dead ends: 1005 [2022-07-21 11:14:01,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 11:14:01,626 INFO L413 NwaCegarLoop]: 703 mSDtfsCounter, 694 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 11:14:01,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 708 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 11:14:01,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2022-07-21 11:14:01,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 999. [2022-07-21 11:14:01,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 741 states have (on average 1.3319838056680162) internal successors, (987), 757 states have internal predecessors, (987), 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-21 11:14:01,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1366 transitions. [2022-07-21 11:14:01,662 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1366 transitions. Word has length 45 [2022-07-21 11:14:01,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:14:01,662 INFO L495 AbstractCegarLoop]: Abstraction has 999 states and 1366 transitions. [2022-07-21 11:14:01,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (4), 2 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-21 11:14:01,663 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1366 transitions. [2022-07-21 11:14:01,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-21 11:14:01,664 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:14:01,664 INFO L195 NwaCegarLoop]: trace histogram [4, 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-21 11:14:01,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-21 11:14:01,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 11:14:01,881 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:14:01,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:14:01,881 INFO L85 PathProgramCache]: Analyzing trace with hash 521527214, now seen corresponding path program 1 times [2022-07-21 11:14:01,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 11:14:01,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1608887408] [2022-07-21 11:14:01,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:14:01,882 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 11:14:01,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 11:14:01,883 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 11:14:01,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-21 11:14:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:14:02,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 1188 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 11:14:02,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:14:02,388 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-21 11:14:02,388 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:14:02,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 11:14:02,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1608887408] [2022-07-21 11:14:02,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1608887408] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:14:02,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:14:02,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 11:14:02,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414248094] [2022-07-21 11:14:02,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:14:02,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 11:14:02,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 11:14:02,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 11:14:02,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 11:14:02,389 INFO L87 Difference]: Start difference. First operand 999 states and 1366 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 11:14:02,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:14:02,573 INFO L93 Difference]: Finished difference Result 2960 states and 4082 transitions. [2022-07-21 11:14:02,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 11:14:02,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 45 [2022-07-21 11:14:02,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:14:02,582 INFO L225 Difference]: With dead ends: 2960 [2022-07-21 11:14:02,582 INFO L226 Difference]: Without dead ends: 1972 [2022-07-21 11:14:02,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-21 11:14:02,586 INFO L413 NwaCegarLoop]: 794 mSDtfsCounter, 663 mSDsluCounter, 2268 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 3062 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 11:14:02,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 3062 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 11:14:02,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1972 states. [2022-07-21 11:14:02,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1972 to 1964. [2022-07-21 11:14:02,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1964 states, 1453 states have (on average 1.333792154163799) internal successors, (1938), 1485 states have internal predecessors, (1938), 377 states have call successors, (377), 134 states have call predecessors, (377), 133 states have return successors, (390), 364 states have call predecessors, (390), 376 states have call successors, (390) [2022-07-21 11:14:02,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 2705 transitions. [2022-07-21 11:14:02,646 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 2705 transitions. Word has length 45 [2022-07-21 11:14:02,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:14:02,646 INFO L495 AbstractCegarLoop]: Abstraction has 1964 states and 2705 transitions. [2022-07-21 11:14:02,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 11:14:02,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 2705 transitions. [2022-07-21 11:14:02,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-21 11:14:02,650 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:14:02,650 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2022-07-21 11:14:02,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-21 11:14:02,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 11:14:02,864 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:14:02,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:14:02,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1063315531, now seen corresponding path program 1 times [2022-07-21 11:14:02,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 11:14:02,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2000879386] [2022-07-21 11:14:02,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:14:02,865 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 11:14:02,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 11:14:02,867 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 11:14:02,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-21 11:14:03,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:14:03,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 1376 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 11:14:03,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:14:03,363 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-21 11:14:03,363 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:14:03,363 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 11:14:03,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2000879386] [2022-07-21 11:14:03,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2000879386] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:14:03,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:14:03,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 11:14:03,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217222801] [2022-07-21 11:14:03,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:14:03,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 11:14:03,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 11:14:03,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 11:14:03,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 11:14:03,365 INFO L87 Difference]: Start difference. First operand 1964 states and 2705 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-21 11:14:03,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:14:03,506 INFO L93 Difference]: Finished difference Result 4147 states and 5735 transitions. [2022-07-21 11:14:03,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 11:14:03,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 101 [2022-07-21 11:14:03,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:14:03,515 INFO L225 Difference]: With dead ends: 4147 [2022-07-21 11:14:03,515 INFO L226 Difference]: Without dead ends: 2200 [2022-07-21 11:14:03,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 11:14:03,520 INFO L413 NwaCegarLoop]: 709 mSDtfsCounter, 109 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1369 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 11:14:03,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1369 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 11:14:03,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2200 states. [2022-07-21 11:14:03,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2200 to 2189. [2022-07-21 11:14:03,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2189 states, 1639 states have (on average 1.3532641854789507) internal successors, (2218), 1687 states have internal predecessors, (2218), 402 states have call successors, (402), 148 states have call predecessors, (402), 147 states have return successors, (415), 377 states have call predecessors, (415), 401 states have call successors, (415) [2022-07-21 11:14:03,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2189 states to 2189 states and 3035 transitions. [2022-07-21 11:14:03,572 INFO L78 Accepts]: Start accepts. Automaton has 2189 states and 3035 transitions. Word has length 101 [2022-07-21 11:14:03,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:14:03,572 INFO L495 AbstractCegarLoop]: Abstraction has 2189 states and 3035 transitions. [2022-07-21 11:14:03,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-21 11:14:03,572 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 3035 transitions. [2022-07-21 11:14:03,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-21 11:14:03,576 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:14:03,576 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2022-07-21 11:14:03,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-21 11:14:03,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 11:14:03,792 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:14:03,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:14:03,792 INFO L85 PathProgramCache]: Analyzing trace with hash 821283156, now seen corresponding path program 1 times [2022-07-21 11:14:03,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 11:14:03,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1603379117] [2022-07-21 11:14:03,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:14:03,793 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 11:14:03,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 11:14:03,795 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 11:14:03,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-21 11:14:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:14:04,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 1391 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 11:14:04,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:14:04,293 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-21 11:14:04,296 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:14:04,296 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 11:14:04,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1603379117] [2022-07-21 11:14:04,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1603379117] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:14:04,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:14:04,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 11:14:04,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132233328] [2022-07-21 11:14:04,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:14:04,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 11:14:04,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 11:14:04,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 11:14:04,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 11:14:04,298 INFO L87 Difference]: Start difference. First operand 2189 states and 3035 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-21 11:14:04,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:14:04,471 INFO L93 Difference]: Finished difference Result 4885 states and 6729 transitions. [2022-07-21 11:14:04,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 11:14:04,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 107 [2022-07-21 11:14:04,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:14:04,483 INFO L225 Difference]: With dead ends: 4885 [2022-07-21 11:14:04,483 INFO L226 Difference]: Without dead ends: 2724 [2022-07-21 11:14:04,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 11:14:04,490 INFO L413 NwaCegarLoop]: 807 mSDtfsCounter, 464 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 11:14:04,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 1174 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 11:14:04,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2724 states. [2022-07-21 11:14:04,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2724 to 2713. [2022-07-21 11:14:04,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2713 states, 2047 states have (on average 1.3488031265266243) internal successors, (2761), 2111 states have internal predecessors, (2761), 456 states have call successors, (456), 210 states have call predecessors, (456), 209 states have return successors, (469), 419 states have call predecessors, (469), 455 states have call successors, (469) [2022-07-21 11:14:04,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2713 states to 2713 states and 3686 transitions. [2022-07-21 11:14:04,550 INFO L78 Accepts]: Start accepts. Automaton has 2713 states and 3686 transitions. Word has length 107 [2022-07-21 11:14:04,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:14:04,552 INFO L495 AbstractCegarLoop]: Abstraction has 2713 states and 3686 transitions. [2022-07-21 11:14:04,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-21 11:14:04,552 INFO L276 IsEmpty]: Start isEmpty. Operand 2713 states and 3686 transitions. [2022-07-21 11:14:04,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-21 11:14:04,559 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:14:04,560 INFO L195 NwaCegarLoop]: trace histogram [4, 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-21 11:14:04,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-21 11:14:04,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 11:14:04,775 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:14:04,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:14:04,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1993831216, now seen corresponding path program 1 times [2022-07-21 11:14:04,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 11:14:04,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678613902] [2022-07-21 11:14:04,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:14:04,777 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 11:14:04,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 11:14:04,778 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 11:14:04,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-21 11:14:05,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:14:05,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 1489 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 11:14:05,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:14:05,349 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-21 11:14:05,349 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:14:05,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 11:14:05,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678613902] [2022-07-21 11:14:05,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678613902] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:14:05,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:14:05,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 11:14:05,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154767954] [2022-07-21 11:14:05,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:14:05,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 11:14:05,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 11:14:05,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 11:14:05,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 11:14:05,351 INFO L87 Difference]: Start difference. First operand 2713 states and 3686 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-21 11:14:05,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:14:05,807 INFO L93 Difference]: Finished difference Result 6827 states and 9278 transitions. [2022-07-21 11:14:05,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 11:14:05,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 136 [2022-07-21 11:14:05,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:14:05,823 INFO L225 Difference]: With dead ends: 6827 [2022-07-21 11:14:05,824 INFO L226 Difference]: Without dead ends: 4142 [2022-07-21 11:14:05,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-21 11:14:05,832 INFO L413 NwaCegarLoop]: 1145 mSDtfsCounter, 725 mSDsluCounter, 2553 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-07-21 11:14:05,832 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.3s Time] [2022-07-21 11:14:05,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4142 states. [2022-07-21 11:14:05,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4142 to 2737. [2022-07-21 11:14:05,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2737 states, 2063 states have (on average 1.3460979156568105) internal successors, (2777), 2123 states have internal predecessors, (2777), 464 states have call successors, (464), 210 states have call predecessors, (464), 209 states have return successors, (477), 427 states have call predecessors, (477), 463 states have call successors, (477) [2022-07-21 11:14:05,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2737 states to 2737 states and 3718 transitions. [2022-07-21 11:14:05,935 INFO L78 Accepts]: Start accepts. Automaton has 2737 states and 3718 transitions. Word has length 136 [2022-07-21 11:14:05,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:14:05,936 INFO L495 AbstractCegarLoop]: Abstraction has 2737 states and 3718 transitions. [2022-07-21 11:14:05,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-21 11:14:05,936 INFO L276 IsEmpty]: Start isEmpty. Operand 2737 states and 3718 transitions. [2022-07-21 11:14:05,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-07-21 11:14:05,943 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:14:05,943 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 3, 3, 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-21 11:14:05,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-21 11:14:06,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 11:14:06,150 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:14:06,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:14:06,150 INFO L85 PathProgramCache]: Analyzing trace with hash 453904961, now seen corresponding path program 1 times [2022-07-21 11:14:06,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 11:14:06,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [539368309] [2022-07-21 11:14:06,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:14:06,152 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 11:14:06,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 11:14:06,153 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 11:14:06,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-21 11:14:06,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:14:06,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 1839 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-21 11:14:06,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:14:07,120 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-21 11:14:07,120 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:14:07,120 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 11:14:07,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [539368309] [2022-07-21 11:14:07,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [539368309] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:14:07,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:14:07,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 11:14:07,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684901941] [2022-07-21 11:14:07,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:14:07,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 11:14:07,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 11:14:07,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 11:14:07,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-21 11:14:07,123 INFO L87 Difference]: Start difference. First operand 2737 states and 3718 transitions. Second operand has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 7 states have internal predecessors, (140), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (20), 4 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-21 11:14:07,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:14:07,941 INFO L93 Difference]: Finished difference Result 5699 states and 7785 transitions. [2022-07-21 11:14:07,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 11:14:07,944 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 7 states have internal predecessors, (140), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (20), 4 states have call predecessors, (20), 2 states have call successors, (20) Word has length 208 [2022-07-21 11:14:07,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:14:07,956 INFO L225 Difference]: With dead ends: 5699 [2022-07-21 11:14:07,956 INFO L226 Difference]: Without dead ends: 2990 [2022-07-21 11:14:07,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-21 11:14:07,963 INFO L413 NwaCegarLoop]: 785 mSDtfsCounter, 162 mSDsluCounter, 5300 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 6085 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 11:14:07,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 6085 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-21 11:14:07,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2990 states. [2022-07-21 11:14:08,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2990 to 2773. [2022-07-21 11:14:08,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2773 states, 2091 states have (on average 1.3414634146341464) internal successors, (2805), 2151 states have internal predecessors, (2805), 464 states have call successors, (464), 210 states have call predecessors, (464), 217 states have return successors, (501), 435 states have call predecessors, (501), 463 states have call successors, (501) [2022-07-21 11:14:08,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2773 states to 2773 states and 3770 transitions. [2022-07-21 11:14:08,045 INFO L78 Accepts]: Start accepts. Automaton has 2773 states and 3770 transitions. Word has length 208 [2022-07-21 11:14:08,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:14:08,046 INFO L495 AbstractCegarLoop]: Abstraction has 2773 states and 3770 transitions. [2022-07-21 11:14:08,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 7 states have internal predecessors, (140), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (20), 4 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-21 11:14:08,047 INFO L276 IsEmpty]: Start isEmpty. Operand 2773 states and 3770 transitions. [2022-07-21 11:14:08,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-07-21 11:14:08,052 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:14:08,052 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 3, 3, 3, 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] [2022-07-21 11:14:08,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-21 11:14:08,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 11:14:08,267 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:14:08,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:14:08,268 INFO L85 PathProgramCache]: Analyzing trace with hash -849595108, now seen corresponding path program 1 times [2022-07-21 11:14:08,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 11:14:08,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [749759783] [2022-07-21 11:14:08,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:14:08,269 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 11:14:08,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 11:14:08,270 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 11:14:08,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-21 11:14:09,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:14:09,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 1849 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 11:14:09,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:14:09,152 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-21 11:14:09,152 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:14:09,152 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 11:14:09,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [749759783] [2022-07-21 11:14:09,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [749759783] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:14:09,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:14:09,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 11:14:09,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763441852] [2022-07-21 11:14:09,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:14:09,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 11:14:09,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 11:14:09,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 11:14:09,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 11:14:09,153 INFO L87 Difference]: Start difference. First operand 2773 states and 3770 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-21 11:14:09,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:14:09,216 INFO L93 Difference]: Finished difference Result 5666 states and 7734 transitions. [2022-07-21 11:14:09,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 11:14:09,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 211 [2022-07-21 11:14:09,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:14:09,227 INFO L225 Difference]: With dead ends: 5666 [2022-07-21 11:14:09,228 INFO L226 Difference]: Without dead ends: 2921 [2022-07-21 11:14:09,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 11:14:09,234 INFO L413 NwaCegarLoop]: 788 mSDtfsCounter, 243 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 1284 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-21 11:14:09,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 1284 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 11:14:09,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2022-07-21 11:14:09,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 2773. [2022-07-21 11:14:09,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2773 states, 2091 states have (on average 1.3395504543280727) internal successors, (2801), 2147 states have internal predecessors, (2801), 464 states have call successors, (464), 210 states have call predecessors, (464), 217 states have return successors, (501), 435 states have call predecessors, (501), 463 states have call successors, (501) [2022-07-21 11:14:09,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2773 states to 2773 states and 3766 transitions. [2022-07-21 11:14:09,328 INFO L78 Accepts]: Start accepts. Automaton has 2773 states and 3766 transitions. Word has length 211 [2022-07-21 11:14:09,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:14:09,328 INFO L495 AbstractCegarLoop]: Abstraction has 2773 states and 3766 transitions. [2022-07-21 11:14:09,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-21 11:14:09,329 INFO L276 IsEmpty]: Start isEmpty. Operand 2773 states and 3766 transitions. [2022-07-21 11:14:09,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-07-21 11:14:09,336 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:14:09,336 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 3, 3, 3, 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] [2022-07-21 11:14:09,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-21 11:14:09,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 11:14:09,542 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:14:09,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:14:09,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1474946276, now seen corresponding path program 1 times [2022-07-21 11:14:09,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 11:14:09,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [434854587] [2022-07-21 11:14:09,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:14:09,544 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 11:14:09,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 11:14:09,545 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 11:14:09,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-21 11:14:10,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:14:10,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 1921 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 11:14:10,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:14:10,456 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-21 11:14:10,456 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:14:10,456 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 11:14:10,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [434854587] [2022-07-21 11:14:10,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [434854587] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:14:10,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:14:10,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 11:14:10,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121441301] [2022-07-21 11:14:10,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:14:10,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 11:14:10,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 11:14:10,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 11:14:10,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 11:14:10,458 INFO L87 Difference]: Start difference. First operand 2773 states and 3766 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-21 11:14:10,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:14:10,516 INFO L93 Difference]: Finished difference Result 5522 states and 7510 transitions. [2022-07-21 11:14:10,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 11:14:10,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 216 [2022-07-21 11:14:10,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:14:10,525 INFO L225 Difference]: With dead ends: 5522 [2022-07-21 11:14:10,526 INFO L226 Difference]: Without dead ends: 2777 [2022-07-21 11:14:10,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 11:14:10,532 INFO L413 NwaCegarLoop]: 697 mSDtfsCounter, 0 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1389 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 11:14:10,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1389 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 11:14:10,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2777 states. [2022-07-21 11:14:10,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2777 to 2777. [2022-07-21 11:14:10,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2777 states, 2095 states have (on average 1.3389021479713603) internal successors, (2805), 2151 states have internal predecessors, (2805), 464 states have call successors, (464), 210 states have call predecessors, (464), 217 states have return successors, (501), 435 states have call predecessors, (501), 463 states have call successors, (501) [2022-07-21 11:14:10,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2777 states to 2777 states and 3770 transitions. [2022-07-21 11:14:10,597 INFO L78 Accepts]: Start accepts. Automaton has 2777 states and 3770 transitions. Word has length 216 [2022-07-21 11:14:10,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:14:10,598 INFO L495 AbstractCegarLoop]: Abstraction has 2777 states and 3770 transitions. [2022-07-21 11:14:10,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-21 11:14:10,598 INFO L276 IsEmpty]: Start isEmpty. Operand 2777 states and 3770 transitions. [2022-07-21 11:14:10,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-07-21 11:14:10,604 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:14:10,604 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 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] [2022-07-21 11:14:10,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-21 11:14:10,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 11:14:10,824 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:14:10,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:14:10,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1613310329, now seen corresponding path program 1 times [2022-07-21 11:14:10,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 11:14:10,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [184266469] [2022-07-21 11:14:10,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:14:10,825 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 11:14:10,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 11:14:10,826 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 11:14:10,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-21 11:14:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:14:11,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 1947 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-21 11:14:11,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:14:11,826 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-07-21 11:14:11,826 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:14:11,827 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 11:14:11,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [184266469] [2022-07-21 11:14:11,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [184266469] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:14:11,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:14:11,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 11:14:11,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953323577] [2022-07-21 11:14:11,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:14:11,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 11:14:11,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 11:14:11,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 11:14:11,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 11:14:11,828 INFO L87 Difference]: Start difference. First operand 2777 states and 3770 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (24), 4 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-21 11:14:11,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:14:11,950 INFO L93 Difference]: Finished difference Result 5787 states and 7901 transitions. [2022-07-21 11:14:11,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 11:14:11,951 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (24), 4 states have call predecessors, (24), 2 states have call successors, (24) Word has length 225 [2022-07-21 11:14:11,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:14:11,960 INFO L225 Difference]: With dead ends: 5787 [2022-07-21 11:14:11,960 INFO L226 Difference]: Without dead ends: 3038 [2022-07-21 11:14:11,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 11:14:11,966 INFO L413 NwaCegarLoop]: 789 mSDtfsCounter, 86 mSDsluCounter, 3846 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 4635 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 11:14:11,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 4635 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 11:14:11,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3038 states. [2022-07-21 11:14:12,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3038 to 2797. [2022-07-21 11:14:12,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2797 states, 2111 states have (on average 1.336333491236381) internal successors, (2821), 2163 states have internal predecessors, (2821), 464 states have call successors, (464), 210 states have call predecessors, (464), 221 states have return successors, (509), 443 states have call predecessors, (509), 463 states have call successors, (509) [2022-07-21 11:14:12,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2797 states to 2797 states and 3794 transitions. [2022-07-21 11:14:12,061 INFO L78 Accepts]: Start accepts. Automaton has 2797 states and 3794 transitions. Word has length 225 [2022-07-21 11:14:12,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:14:12,062 INFO L495 AbstractCegarLoop]: Abstraction has 2797 states and 3794 transitions. [2022-07-21 11:14:12,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (24), 4 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-21 11:14:12,062 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 3794 transitions. [2022-07-21 11:14:12,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2022-07-21 11:14:12,067 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:14:12,068 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:14:12,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-21 11:14:12,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 11:14:12,296 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:14:12,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:14:12,297 INFO L85 PathProgramCache]: Analyzing trace with hash 2070831396, now seen corresponding path program 1 times [2022-07-21 11:14:12,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 11:14:12,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1881422332] [2022-07-21 11:14:12,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:14:12,298 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 11:14:12,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 11:14:12,299 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 11:14:12,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-21 11:14:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:14:13,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 1957 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-21 11:14:13,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:14:13,381 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-07-21 11:14:13,381 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:14:13,381 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 11:14:13,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1881422332] [2022-07-21 11:14:13,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1881422332] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:14:13,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:14:13,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 11:14:13,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97212986] [2022-07-21 11:14:13,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:14:13,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 11:14:13,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 11:14:13,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 11:14:13,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 11:14:13,383 INFO L87 Difference]: Start difference. First operand 2797 states and 3794 transitions. Second operand has 8 states, 8 states have (on average 18.125) internal successors, (145), 6 states have internal predecessors, (145), 2 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-21 11:14:13,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:14:13,530 INFO L93 Difference]: Finished difference Result 5574 states and 7570 transitions. [2022-07-21 11:14:13,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 11:14:13,532 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 6 states have internal predecessors, (145), 2 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) Word has length 228 [2022-07-21 11:14:13,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:14:13,543 INFO L225 Difference]: With dead ends: 5574 [2022-07-21 11:14:13,544 INFO L226 Difference]: Without dead ends: 2805 [2022-07-21 11:14:13,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-21 11:14:13,551 INFO L413 NwaCegarLoop]: 694 mSDtfsCounter, 2 mSDsluCounter, 4151 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4845 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 11:14:13,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4845 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 11:14:13,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2805 states. [2022-07-21 11:14:13,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2805 to 2805. [2022-07-21 11:14:13,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2805 states, 2119 states have (on average 1.335063709296838) internal successors, (2829), 2167 states have internal predecessors, (2829), 464 states have call successors, (464), 210 states have call predecessors, (464), 221 states have return successors, (509), 447 states have call predecessors, (509), 463 states have call successors, (509) [2022-07-21 11:14:13,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2805 states to 2805 states and 3802 transitions. [2022-07-21 11:14:13,639 INFO L78 Accepts]: Start accepts. Automaton has 2805 states and 3802 transitions. Word has length 228 [2022-07-21 11:14:13,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:14:13,640 INFO L495 AbstractCegarLoop]: Abstraction has 2805 states and 3802 transitions. [2022-07-21 11:14:13,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 6 states have internal predecessors, (145), 2 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-21 11:14:13,640 INFO L276 IsEmpty]: Start isEmpty. Operand 2805 states and 3802 transitions. [2022-07-21 11:14:13,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2022-07-21 11:14:13,645 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:14:13,646 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2022-07-21 11:14:13,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-21 11:14:13,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 11:14:13,859 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:14:13,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:14:13,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1855046067, now seen corresponding path program 2 times [2022-07-21 11:14:13,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 11:14:13,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [779836698] [2022-07-21 11:14:13,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 11:14:13,861 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 11:14:13,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 11:14:13,862 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 11:14:13,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-21 11:14:14,290 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-21 11:14:14,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 11:14:14,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 1123 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 11:14:14,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:14:14,360 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-07-21 11:14:14,360 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:14:14,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 11:14:14,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [779836698] [2022-07-21 11:14:14,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [779836698] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:14:14,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:14:14,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 11:14:14,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537966946] [2022-07-21 11:14:14,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:14:14,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 11:14:14,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 11:14:14,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 11:14:14,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 11:14:14,362 INFO L87 Difference]: Start difference. First operand 2805 states and 3802 transitions. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 4 states have internal predecessors, (137), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 1 states have call successors, (21) [2022-07-21 11:14:14,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:14:14,437 INFO L93 Difference]: Finished difference Result 5612 states and 7638 transitions. [2022-07-21 11:14:14,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 11:14:14,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 4 states have internal predecessors, (137), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 1 states have call successors, (21) Word has length 237 [2022-07-21 11:14:14,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:14:14,446 INFO L225 Difference]: With dead ends: 5612 [2022-07-21 11:14:14,447 INFO L226 Difference]: Without dead ends: 2835 [2022-07-21 11:14:14,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 11:14:14,453 INFO L413 NwaCegarLoop]: 696 mSDtfsCounter, 2 mSDsluCounter, 2080 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2776 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 11:14:14,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2776 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 11:14:14,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2835 states. [2022-07-21 11:14:14,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2835 to 2825. [2022-07-21 11:14:14,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2825 states, 2133 states have (on average 1.3328645100796999) internal successors, (2843), 2183 states have internal predecessors, (2843), 464 states have call successors, (464), 210 states have call predecessors, (464), 227 states have return successors, (515), 451 states have call predecessors, (515), 463 states have call successors, (515) [2022-07-21 11:14:14,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2825 states to 2825 states and 3822 transitions. [2022-07-21 11:14:14,537 INFO L78 Accepts]: Start accepts. Automaton has 2825 states and 3822 transitions. Word has length 237 [2022-07-21 11:14:14,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:14:14,537 INFO L495 AbstractCegarLoop]: Abstraction has 2825 states and 3822 transitions. [2022-07-21 11:14:14,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 4 states have internal predecessors, (137), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 1 states have call successors, (21) [2022-07-21 11:14:14,538 INFO L276 IsEmpty]: Start isEmpty. Operand 2825 states and 3822 transitions. [2022-07-21 11:14:14,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2022-07-21 11:14:14,543 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:14:14,543 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:14:14,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-21 11:14:14,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 11:14:14,760 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:14:14,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:14:14,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1028389471, now seen corresponding path program 1 times [2022-07-21 11:14:14,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 11:14:14,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1930755522] [2022-07-21 11:14:14,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:14:14,762 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 11:14:14,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 11:14:14,763 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 11:14:14,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-21 11:14:15,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:14:15,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 1983 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-21 11:14:15,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:14:15,794 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-07-21 11:14:15,794 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:14:15,795 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 11:14:15,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1930755522] [2022-07-21 11:14:15,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1930755522] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:14:15,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:14:15,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 11:14:15,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693743478] [2022-07-21 11:14:15,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:14:15,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 11:14:15,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 11:14:15,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 11:14:15,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 11:14:15,797 INFO L87 Difference]: Start difference. First operand 2825 states and 3822 transitions. Second operand has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 4 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-21 11:14:15,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:14:15,950 INFO L93 Difference]: Finished difference Result 5871 states and 7989 transitions. [2022-07-21 11:14:15,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 11:14:15,951 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 4 states have call predecessors, (25), 2 states have call successors, (25) Word has length 235 [2022-07-21 11:14:15,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:14:15,965 INFO L225 Difference]: With dead ends: 5871 [2022-07-21 11:14:15,965 INFO L226 Difference]: Without dead ends: 3074 [2022-07-21 11:14:15,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 11:14:15,971 INFO L413 NwaCegarLoop]: 795 mSDtfsCounter, 86 mSDsluCounter, 3870 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 4665 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 11:14:15,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 4665 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 11:14:15,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3074 states. [2022-07-21 11:14:16,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3074 to 2833. [2022-07-21 11:14:16,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2833 states, 2141 states have (on average 1.33162073797291) internal successors, (2851), 2187 states have internal predecessors, (2851), 464 states have call successors, (464), 210 states have call predecessors, (464), 227 states have return successors, (515), 455 states have call predecessors, (515), 463 states have call successors, (515) [2022-07-21 11:14:16,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2833 states to 2833 states and 3830 transitions. [2022-07-21 11:14:16,056 INFO L78 Accepts]: Start accepts. Automaton has 2833 states and 3830 transitions. Word has length 235 [2022-07-21 11:14:16,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:14:16,056 INFO L495 AbstractCegarLoop]: Abstraction has 2833 states and 3830 transitions. [2022-07-21 11:14:16,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 4 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-21 11:14:16,057 INFO L276 IsEmpty]: Start isEmpty. Operand 2833 states and 3830 transitions. [2022-07-21 11:14:16,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-07-21 11:14:16,063 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:14:16,063 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-21 11:14:16,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-21 11:14:16,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 11:14:16,280 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:14:16,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:14:16,280 INFO L85 PathProgramCache]: Analyzing trace with hash 160942622, now seen corresponding path program 2 times [2022-07-21 11:14:16,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 11:14:16,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1834472119] [2022-07-21 11:14:16,281 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 11:14:16,281 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 11:14:16,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 11:14:16,282 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 11:14:16,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-21 11:14:16,732 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-21 11:14:16,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 11:14:16,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 1148 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-21 11:14:16,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:14:16,950 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-07-21 11:14:16,951 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:14:16,951 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 11:14:16,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1834472119] [2022-07-21 11:14:16,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1834472119] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:14:16,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:14:16,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 11:14:16,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108141525] [2022-07-21 11:14:16,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:14:16,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 11:14:16,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 11:14:16,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 11:14:16,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-21 11:14:16,953 INFO L87 Difference]: Start difference. First operand 2833 states and 3830 transitions. Second operand has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 9 states have internal predecessors, (136), 3 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (22), 5 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-21 11:14:17,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:14:17,260 INFO L93 Difference]: Finished difference Result 5740 states and 7804 transitions. [2022-07-21 11:14:17,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 11:14:17,261 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 9 states have internal predecessors, (136), 3 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (22), 5 states have call predecessors, (22), 2 states have call successors, (22) Word has length 241 [2022-07-21 11:14:17,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:14:17,269 INFO L225 Difference]: With dead ends: 5740 [2022-07-21 11:14:17,269 INFO L226 Difference]: Without dead ends: 2935 [2022-07-21 11:14:17,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-07-21 11:14:17,276 INFO L413 NwaCegarLoop]: 723 mSDtfsCounter, 47 mSDsluCounter, 6426 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 7149 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 11:14:17,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 7149 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 11:14:17,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2022-07-21 11:14:17,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 2849. [2022-07-21 11:14:17,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2849 states, 2155 states have (on average 1.3276102088167054) internal successors, (2861), 2199 states have internal predecessors, (2861), 464 states have call successors, (464), 210 states have call predecessors, (464), 229 states have return successors, (517), 459 states have call predecessors, (517), 463 states have call successors, (517) [2022-07-21 11:14:17,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2849 states to 2849 states and 3842 transitions. [2022-07-21 11:14:17,350 INFO L78 Accepts]: Start accepts. Automaton has 2849 states and 3842 transitions. Word has length 241 [2022-07-21 11:14:17,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:14:17,350 INFO L495 AbstractCegarLoop]: Abstraction has 2849 states and 3842 transitions. [2022-07-21 11:14:17,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 9 states have internal predecessors, (136), 3 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (22), 5 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-21 11:14:17,351 INFO L276 IsEmpty]: Start isEmpty. Operand 2849 states and 3842 transitions. [2022-07-21 11:14:17,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2022-07-21 11:14:17,357 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:14:17,357 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:14:17,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-21 11:14:17,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 11:14:17,576 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:14:17,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:14:17,576 INFO L85 PathProgramCache]: Analyzing trace with hash -521060932, now seen corresponding path program 1 times [2022-07-21 11:14:17,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 11:14:17,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1634909659] [2022-07-21 11:14:17,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:14:17,578 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 11:14:17,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 11:14:17,579 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 11:14:17,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-21 11:14:18,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:14:18,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 2152 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 11:14:18,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:14:18,805 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-21 11:14:18,805 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:14:18,806 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 11:14:18,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1634909659] [2022-07-21 11:14:18,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1634909659] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:14:18,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:14:18,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 11:14:18,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644080359] [2022-07-21 11:14:18,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:14:18,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 11:14:18,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 11:14:18,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 11:14:18,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 11:14:18,807 INFO L87 Difference]: Start difference. First operand 2849 states and 3842 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 3 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-21 11:14:19,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:14:19,863 INFO L93 Difference]: Finished difference Result 6596 states and 9052 transitions. [2022-07-21 11:14:19,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 11:14:19,865 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 3 states have call predecessors, (25), 2 states have call successors, (25) Word has length 257 [2022-07-21 11:14:19,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:14:19,872 INFO L225 Difference]: With dead ends: 6596 [2022-07-21 11:14:19,872 INFO L226 Difference]: Without dead ends: 3775 [2022-07-21 11:14:19,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-21 11:14:19,877 INFO L413 NwaCegarLoop]: 963 mSDtfsCounter, 353 mSDsluCounter, 3599 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 4562 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-21 11:14:19,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 4562 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-21 11:14:19,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3775 states. [2022-07-21 11:14:19,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3775 to 2861. [2022-07-21 11:14:19,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2861 states, 2167 states have (on average 1.3257960313797876) internal successors, (2873), 2207 states have internal predecessors, (2873), 464 states have call successors, (464), 210 states have call predecessors, (464), 229 states have return successors, (517), 463 states have call predecessors, (517), 463 states have call successors, (517) [2022-07-21 11:14:19,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2861 states to 2861 states and 3854 transitions. [2022-07-21 11:14:19,944 INFO L78 Accepts]: Start accepts. Automaton has 2861 states and 3854 transitions. Word has length 257 [2022-07-21 11:14:19,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:14:19,944 INFO L495 AbstractCegarLoop]: Abstraction has 2861 states and 3854 transitions. [2022-07-21 11:14:19,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 3 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-21 11:14:19,944 INFO L276 IsEmpty]: Start isEmpty. Operand 2861 states and 3854 transitions. [2022-07-21 11:14:19,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2022-07-21 11:14:19,950 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:14:19,950 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2022-07-21 11:14:19,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-21 11:14:20,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 11:14:20,176 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:14:20,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:14:20,177 INFO L85 PathProgramCache]: Analyzing trace with hash -314648663, now seen corresponding path program 1 times [2022-07-21 11:14:20,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 11:14:20,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [224730918] [2022-07-21 11:14:20,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:14:20,178 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 11:14:20,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 11:14:20,179 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 11:14:20,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-21 11:14:21,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:14:21,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 2176 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 11:14:21,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:14:21,360 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-21 11:14:21,360 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:14:21,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 11:14:21,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [224730918] [2022-07-21 11:14:21,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [224730918] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:14:21,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:14:21,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 11:14:21,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269039952] [2022-07-21 11:14:21,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:14:21,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 11:14:21,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 11:14:21,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 11:14:21,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 11:14:21,365 INFO L87 Difference]: Start difference. First operand 2861 states and 3854 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-21 11:14:21,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:14:21,542 INFO L93 Difference]: Finished difference Result 6249 states and 8442 transitions. [2022-07-21 11:14:21,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 11:14:21,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 266 [2022-07-21 11:14:21,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:14:21,550 INFO L225 Difference]: With dead ends: 6249 [2022-07-21 11:14:21,550 INFO L226 Difference]: Without dead ends: 3416 [2022-07-21 11:14:21,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 11:14:21,555 INFO L413 NwaCegarLoop]: 856 mSDtfsCounter, 212 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 1494 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 11:14:21,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 1494 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 11:14:21,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3416 states. [2022-07-21 11:14:21,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3416 to 3411. [2022-07-21 11:14:21,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3411 states, 2589 states have (on average 1.331788335264581) internal successors, (3448), 2649 states have internal predecessors, (3448), 544 states have call successors, (544), 258 states have call predecessors, (544), 277 states have return successors, (597), 531 states have call predecessors, (597), 543 states have call successors, (597) [2022-07-21 11:14:21,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3411 states to 3411 states and 4589 transitions. [2022-07-21 11:14:21,637 INFO L78 Accepts]: Start accepts. Automaton has 3411 states and 4589 transitions. Word has length 266 [2022-07-21 11:14:21,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:14:21,637 INFO L495 AbstractCegarLoop]: Abstraction has 3411 states and 4589 transitions. [2022-07-21 11:14:21,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-21 11:14:21,638 INFO L276 IsEmpty]: Start isEmpty. Operand 3411 states and 4589 transitions. [2022-07-21 11:14:21,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2022-07-21 11:14:21,643 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:14:21,643 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:14:21,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-21 11:14:21,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 11:14:21,864 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:14:21,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:14:21,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1348303546, now seen corresponding path program 1 times [2022-07-21 11:14:21,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 11:14:21,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [687813826] [2022-07-21 11:14:21,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:14:21,866 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 11:14:21,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 11:14:21,867 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 11:14:21,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-21 11:14:23,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:14:23,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 2228 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 11:14:23,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:14:23,205 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2022-07-21 11:14:23,206 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:14:23,206 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 11:14:23,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [687813826] [2022-07-21 11:14:23,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [687813826] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:14:23,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:14:23,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 11:14:23,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343423709] [2022-07-21 11:14:23,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:14:23,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 11:14:23,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 11:14:23,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 11:14:23,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 11:14:23,209 INFO L87 Difference]: Start difference. First operand 3411 states and 4589 transitions. Second operand has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-21 11:14:23,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:14:23,625 INFO L93 Difference]: Finished difference Result 9001 states and 12131 transitions. [2022-07-21 11:14:23,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 11:14:23,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 286 [2022-07-21 11:14:23,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:14:23,638 INFO L225 Difference]: With dead ends: 9001 [2022-07-21 11:14:23,638 INFO L226 Difference]: Without dead ends: 5618 [2022-07-21 11:14:23,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-21 11:14:23,645 INFO L413 NwaCegarLoop]: 1217 mSDtfsCounter, 954 mSDsluCounter, 2705 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 955 SdHoareTripleChecker+Valid, 3922 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 11:14:23,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [955 Valid, 3922 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 11:14:23,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5618 states. [2022-07-21 11:14:23,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5618 to 3443. [2022-07-21 11:14:23,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3443 states, 2617 states have (on average 1.3312953763851738) internal successors, (3484), 2677 states have internal predecessors, (3484), 548 states have call successors, (548), 258 states have call predecessors, (548), 277 states have return successors, (601), 535 states have call predecessors, (601), 547 states have call successors, (601) [2022-07-21 11:14:23,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3443 states to 3443 states and 4633 transitions. [2022-07-21 11:14:23,780 INFO L78 Accepts]: Start accepts. Automaton has 3443 states and 4633 transitions. Word has length 286 [2022-07-21 11:14:23,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:14:23,780 INFO L495 AbstractCegarLoop]: Abstraction has 3443 states and 4633 transitions. [2022-07-21 11:14:23,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-21 11:14:23,780 INFO L276 IsEmpty]: Start isEmpty. Operand 3443 states and 4633 transitions. [2022-07-21 11:14:23,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2022-07-21 11:14:23,786 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:14:23,786 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:14:23,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-21 11:14:24,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 11:14:24,003 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:14:24,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:14:24,004 INFO L85 PathProgramCache]: Analyzing trace with hash -925597813, now seen corresponding path program 1 times [2022-07-21 11:14:24,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 11:14:24,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [163491890] [2022-07-21 11:14:24,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:14:24,006 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 11:14:24,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 11:14:24,007 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 11:14:24,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-21 11:14:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:14:25,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 2233 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 11:14:25,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:14:25,436 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2022-07-21 11:14:25,436 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:14:25,436 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 11:14:25,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [163491890] [2022-07-21 11:14:25,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [163491890] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:14:25,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:14:25,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 11:14:25,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615324368] [2022-07-21 11:14:25,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:14:25,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 11:14:25,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 11:14:25,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 11:14:25,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 11:14:25,438 INFO L87 Difference]: Start difference. First operand 3443 states and 4633 transitions. Second operand has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-21 11:14:25,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:14:25,946 INFO L93 Difference]: Finished difference Result 10056 states and 13733 transitions. [2022-07-21 11:14:25,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 11:14:25,947 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 288 [2022-07-21 11:14:25,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:14:25,963 INFO L225 Difference]: With dead ends: 10056 [2022-07-21 11:14:25,963 INFO L226 Difference]: Without dead ends: 6641 [2022-07-21 11:14:25,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-21 11:14:25,969 INFO L413 NwaCegarLoop]: 1257 mSDtfsCounter, 1243 mSDsluCounter, 3199 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1244 SdHoareTripleChecker+Valid, 4456 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 11:14:25,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1244 Valid, 4456 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 11:14:25,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6641 states. [2022-07-21 11:14:26,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6641 to 3443. [2022-07-21 11:14:26,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3443 states, 2617 states have (on average 1.3312953763851738) internal successors, (3484), 2677 states have internal predecessors, (3484), 548 states have call successors, (548), 258 states have call predecessors, (548), 277 states have return successors, (601), 535 states have call predecessors, (601), 547 states have call successors, (601) [2022-07-21 11:14:26,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3443 states to 3443 states and 4633 transitions. [2022-07-21 11:14:26,100 INFO L78 Accepts]: Start accepts. Automaton has 3443 states and 4633 transitions. Word has length 288 [2022-07-21 11:14:26,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:14:26,101 INFO L495 AbstractCegarLoop]: Abstraction has 3443 states and 4633 transitions. [2022-07-21 11:14:26,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-21 11:14:26,101 INFO L276 IsEmpty]: Start isEmpty. Operand 3443 states and 4633 transitions. [2022-07-21 11:14:26,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2022-07-21 11:14:26,107 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:14:26,107 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 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] [2022-07-21 11:14:26,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-21 11:14:26,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 11:14:26,324 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:14:26,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:14:26,324 INFO L85 PathProgramCache]: Analyzing trace with hash -74601639, now seen corresponding path program 1 times [2022-07-21 11:14:26,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 11:14:26,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1460486248] [2022-07-21 11:14:26,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:14:26,326 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 11:14:26,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 11:14:26,327 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 11:14:26,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-21 11:14:27,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:14:27,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 2261 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 11:14:27,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:14:28,336 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 8 proven. 50 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2022-07-21 11:14:28,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 11:14:28,738 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2022-07-21 11:14:28,739 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 11:14:28,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1460486248] [2022-07-21 11:14:28,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1460486248] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 11:14:28,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 11:14:28,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-21 11:14:28,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956371522] [2022-07-21 11:14:28,739 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 11:14:28,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 11:14:28,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 11:14:28,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 11:14:28,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-21 11:14:28,741 INFO L87 Difference]: Start difference. First operand 3443 states and 4633 transitions. Second operand has 6 states, 6 states have (on average 53.666666666666664) internal successors, (322), 6 states have internal predecessors, (322), 6 states have call successors, (55), 4 states have call predecessors, (55), 3 states have return successors, (54), 5 states have call predecessors, (54), 5 states have call successors, (54) [2022-07-21 11:14:31,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:14:31,458 INFO L93 Difference]: Finished difference Result 16737 states and 22545 transitions. [2022-07-21 11:14:31,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 11:14:31,459 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 53.666666666666664) internal successors, (322), 6 states have internal predecessors, (322), 6 states have call successors, (55), 4 states have call predecessors, (55), 3 states have return successors, (54), 5 states have call predecessors, (54), 5 states have call successors, (54) Word has length 301 [2022-07-21 11:14:31,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:14:31,496 INFO L225 Difference]: With dead ends: 16737 [2022-07-21 11:14:31,496 INFO L226 Difference]: Without dead ends: 16728 [2022-07-21 11:14:31,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 597 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-21 11:14:31,502 INFO L413 NwaCegarLoop]: 1520 mSDtfsCounter, 3077 mSDsluCounter, 2726 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3077 SdHoareTripleChecker+Valid, 4246 SdHoareTripleChecker+Invalid, 1777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 1338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-21 11:14:31,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3077 Valid, 4246 Invalid, 1777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [439 Valid, 1338 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-21 11:14:31,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16728 states. [2022-07-21 11:14:32,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16728 to 15091. [2022-07-21 11:14:32,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15091 states, 11450 states have (on average 1.3285589519650656) internal successors, (15212), 11698 states have internal predecessors, (15212), 2434 states have call successors, (2434), 1115 states have call predecessors, (2434), 1206 states have return successors, (2681), 2396 states have call predecessors, (2681), 2433 states have call successors, (2681) [2022-07-21 11:14:32,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15091 states to 15091 states and 20327 transitions. [2022-07-21 11:14:32,053 INFO L78 Accepts]: Start accepts. Automaton has 15091 states and 20327 transitions. Word has length 301 [2022-07-21 11:14:32,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:14:32,054 INFO L495 AbstractCegarLoop]: Abstraction has 15091 states and 20327 transitions. [2022-07-21 11:14:32,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 53.666666666666664) internal successors, (322), 6 states have internal predecessors, (322), 6 states have call successors, (55), 4 states have call predecessors, (55), 3 states have return successors, (54), 5 states have call predecessors, (54), 5 states have call successors, (54) [2022-07-21 11:14:32,054 INFO L276 IsEmpty]: Start isEmpty. Operand 15091 states and 20327 transitions. [2022-07-21 11:14:32,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2022-07-21 11:14:32,063 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:14:32,063 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 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, 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] [2022-07-21 11:14:32,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2022-07-21 11:14:32,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 11:14:32,269 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:14:32,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:14:32,270 INFO L85 PathProgramCache]: Analyzing trace with hash -729911566, now seen corresponding path program 1 times [2022-07-21 11:14:32,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 11:14:32,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1700273349] [2022-07-21 11:14:32,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:14:32,271 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 11:14:32,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 11:14:32,272 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 11:14:32,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-21 11:14:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:14:33,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 2298 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 11:14:33,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:14:33,840 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2022-07-21 11:14:33,841 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:14:33,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 11:14:33,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1700273349] [2022-07-21 11:14:33,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1700273349] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:14:33,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:14:33,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 11:14:33,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088421968] [2022-07-21 11:14:33,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:14:33,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 11:14:33,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 11:14:33,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 11:14:33,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 11:14:33,843 INFO L87 Difference]: Start difference. First operand 15091 states and 20327 transitions. Second operand has 5 states, 5 states have (on average 34.2) internal successors, (171), 4 states have internal predecessors, (171), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (29), 3 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-21 11:14:34,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:14:34,319 INFO L93 Difference]: Finished difference Result 30101 states and 40546 transitions. [2022-07-21 11:14:34,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 11:14:34,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 4 states have internal predecessors, (171), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (29), 3 states have call predecessors, (29), 2 states have call successors, (29) Word has length 308 [2022-07-21 11:14:34,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:14:34,359 INFO L225 Difference]: With dead ends: 30101 [2022-07-21 11:14:34,360 INFO L226 Difference]: Without dead ends: 15091 [2022-07-21 11:14:34,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 11:14:34,384 INFO L413 NwaCegarLoop]: 695 mSDtfsCounter, 693 mSDsluCounter, 1384 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 2079 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 11:14:34,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 2079 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 11:14:34,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15091 states. [2022-07-21 11:14:34,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15091 to 15091. [2022-07-21 11:14:34,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15091 states, 11450 states have (on average 1.3271615720524017) internal successors, (15196), 11698 states have internal predecessors, (15196), 2434 states have call successors, (2434), 1115 states have call predecessors, (2434), 1206 states have return successors, (2681), 2396 states have call predecessors, (2681), 2433 states have call successors, (2681) [2022-07-21 11:14:34,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15091 states to 15091 states and 20311 transitions. [2022-07-21 11:14:34,976 INFO L78 Accepts]: Start accepts. Automaton has 15091 states and 20311 transitions. Word has length 308 [2022-07-21 11:14:34,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:14:34,976 INFO L495 AbstractCegarLoop]: Abstraction has 15091 states and 20311 transitions. [2022-07-21 11:14:34,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 4 states have internal predecessors, (171), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (29), 3 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-21 11:14:34,977 INFO L276 IsEmpty]: Start isEmpty. Operand 15091 states and 20311 transitions. [2022-07-21 11:14:34,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2022-07-21 11:14:34,989 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:14:34,989 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 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, 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] [2022-07-21 11:14:35,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-21 11:14:35,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 11:14:35,192 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:14:35,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:14:35,192 INFO L85 PathProgramCache]: Analyzing trace with hash -870460176, now seen corresponding path program 1 times [2022-07-21 11:14:35,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 11:14:35,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1488374981] [2022-07-21 11:14:35,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:14:35,194 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 11:14:35,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 11:14:35,195 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 11:14:35,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-21 11:14:36,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:14:36,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 2299 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 11:14:36,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:14:37,080 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2022-07-21 11:14:37,081 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:14:37,081 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 11:14:37,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1488374981] [2022-07-21 11:14:37,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1488374981] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:14:37,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:14:37,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 11:14:37,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173285750] [2022-07-21 11:14:37,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:14:37,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 11:14:37,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 11:14:37,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 11:14:37,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 11:14:37,083 INFO L87 Difference]: Start difference. First operand 15091 states and 20311 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 3 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2022-07-21 11:14:37,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:14:37,665 INFO L93 Difference]: Finished difference Result 30101 states and 40514 transitions. [2022-07-21 11:14:37,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 11:14:37,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 3 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 308 [2022-07-21 11:14:37,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:14:37,698 INFO L225 Difference]: With dead ends: 30101 [2022-07-21 11:14:37,698 INFO L226 Difference]: Without dead ends: 14767 [2022-07-21 11:14:37,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 11:14:37,720 INFO L413 NwaCegarLoop]: 867 mSDtfsCounter, 483 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 1551 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.1s IncrementalHoareTripleChecker+Time [2022-07-21 11:14:37,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 1551 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 11:14:37,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14767 states. [2022-07-21 11:14:38,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14767 to 14767. [2022-07-21 11:14:38,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14767 states, 11180 states have (on average 1.3167262969588551) internal successors, (14721), 11404 states have internal predecessors, (14721), 2398 states have call successors, (2398), 1097 states have call predecessors, (2398), 1188 states have return successors, (2645), 2378 states have call predecessors, (2645), 2397 states have call successors, (2645) [2022-07-21 11:14:38,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14767 states to 14767 states and 19764 transitions. [2022-07-21 11:14:38,353 INFO L78 Accepts]: Start accepts. Automaton has 14767 states and 19764 transitions. Word has length 308 [2022-07-21 11:14:38,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:14:38,353 INFO L495 AbstractCegarLoop]: Abstraction has 14767 states and 19764 transitions. [2022-07-21 11:14:38,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 3 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2022-07-21 11:14:38,354 INFO L276 IsEmpty]: Start isEmpty. Operand 14767 states and 19764 transitions. [2022-07-21 11:14:38,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2022-07-21 11:14:38,360 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:14:38,361 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 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, 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] [2022-07-21 11:14:38,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-21 11:14:38,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 11:14:38,575 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:14:38,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:14:38,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1128712482, now seen corresponding path program 1 times [2022-07-21 11:14:38,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 11:14:38,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [580136078] [2022-07-21 11:14:38,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:14:38,577 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 11:14:38,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 11:14:38,578 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 11:14:38,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-21 11:14:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:14:39,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 2304 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 11:14:39,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:14:39,596 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2022-07-21 11:14:39,597 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:14:39,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 11:14:39,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [580136078] [2022-07-21 11:14:39,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [580136078] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:14:39,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:14:39,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 11:14:39,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523452991] [2022-07-21 11:14:39,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:14:39,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 11:14:39,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 11:14:39,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 11:14:39,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 11:14:39,599 INFO L87 Difference]: Start difference. First operand 14767 states and 19764 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-21 11:14:39,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:14:39,954 INFO L93 Difference]: Finished difference Result 21905 states and 29295 transitions. [2022-07-21 11:14:39,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 11:14:39,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 311 [2022-07-21 11:14:39,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:14:39,972 INFO L225 Difference]: With dead ends: 21905 [2022-07-21 11:14:39,972 INFO L226 Difference]: Without dead ends: 7218 [2022-07-21 11:14:39,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 11:14:39,995 INFO L413 NwaCegarLoop]: 695 mSDtfsCounter, 0 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1385 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 11:14:39,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1385 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 11:14:40,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7218 states. [2022-07-21 11:14:40,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7218 to 7218. [2022-07-21 11:14:40,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7218 states, 5454 states have (on average 1.3124312431243124) internal successors, (7158), 5556 states have internal predecessors, (7158), 1178 states have call successors, (1178), 540 states have call predecessors, (1178), 585 states have return successors, (1301), 1175 states have call predecessors, (1301), 1177 states have call successors, (1301) [2022-07-21 11:14:40,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7218 states to 7218 states and 9637 transitions. [2022-07-21 11:14:40,319 INFO L78 Accepts]: Start accepts. Automaton has 7218 states and 9637 transitions. Word has length 311 [2022-07-21 11:14:40,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:14:40,320 INFO L495 AbstractCegarLoop]: Abstraction has 7218 states and 9637 transitions. [2022-07-21 11:14:40,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-21 11:14:40,320 INFO L276 IsEmpty]: Start isEmpty. Operand 7218 states and 9637 transitions. [2022-07-21 11:14:40,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2022-07-21 11:14:40,325 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:14:40,325 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:14:40,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-07-21 11:14:40,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 11:14:40,526 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:14:40,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:14:40,527 INFO L85 PathProgramCache]: Analyzing trace with hash -885161345, now seen corresponding path program 1 times [2022-07-21 11:14:40,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 11:14:40,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1676972167] [2022-07-21 11:14:40,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:14:40,528 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 11:14:40,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 11:14:40,529 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 11:14:40,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-21 11:15:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:15:09,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 2475 conjuncts, 292 conjunts are in the unsatisfiable core [2022-07-21 11:15:09,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:15:09,695 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 11:15:09,696 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 19 treesize of output 26 [2022-07-21 11:15:10,103 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-21 11:15:10,104 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 14 treesize of output 19 [2022-07-21 11:15:10,443 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-21 11:15:10,994 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 11:15:10,995 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 20 treesize of output 27 [2022-07-21 11:15:12,481 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-21 11:15:12,990 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-21 11:15:12,990 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 25 treesize of output 42 [2022-07-21 11:15:13,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 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-21 11:15:13,568 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 17 treesize of output 13 [2022-07-21 11:15:13,989 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 6 treesize of output 5 [2022-07-21 11:15:14,609 INFO L356 Elim1Store]: treesize reduction 22, result has 43.6 percent of original size [2022-07-21 11:15:14,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 34 [2022-07-21 11:15:14,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:15:14,883 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 44 treesize of output 31 [2022-07-21 11:15:14,996 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 17 treesize of output 13 [2022-07-21 11:15:15,479 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 6 treesize of output 5 [2022-07-21 11:15:16,024 INFO L356 Elim1Store]: treesize reduction 22, result has 43.6 percent of original size [2022-07-21 11:15:16,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 34 [2022-07-21 11:15:16,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:15:16,384 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 44 treesize of output 31 [2022-07-21 11:15:16,500 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 17 treesize of output 13 [2022-07-21 11:15:17,566 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-21 11:15:17,566 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 22 treesize of output 24 [2022-07-21 11:15:18,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:15:18,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:15:18,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:15:18,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:15:18,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:15:18,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:15:18,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:15:18,670 INFO L244 Elim1Store]: Index analysis took 138 ms [2022-07-21 11:15:18,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 18 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 77 [2022-07-21 11:15:18,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:15:18,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:15:18,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:15:18,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:15:18,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 80 [2022-07-21 11:15:20,765 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 11:15:20,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 137 treesize of output 68 [2022-07-21 11:15:20,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2022-07-21 11:15:21,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:15:21,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:15:21,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:15:21,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:15:21,394 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 11:15:21,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 150 treesize of output 119 [2022-07-21 11:15:21,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 106 [2022-07-21 11:15:32,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:15:32,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:15:32,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:15:32,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:15:32,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:15:32,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:15:32,160 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 11:15:32,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 266 treesize of output 86 [2022-07-21 11:15:32,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 19 [2022-07-21 11:15:37,617 INFO L356 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2022-07-21 11:15:37,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 78 [2022-07-21 11:15:37,793 INFO L356 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2022-07-21 11:15:37,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 78 [2022-07-21 11:15:37,834 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-21 11:15:37,859 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-21 11:15:37,920 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 16 treesize of output 15 [2022-07-21 11:15:38,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:15:38,175 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 16 treesize of output 1 [2022-07-21 11:15:38,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 46 [2022-07-21 11:15:38,297 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 20 [2022-07-21 11:15:38,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 13 treesize of output 9