./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--ppp--ppp_synctty.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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--ppp--ppp_synctty.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 389f662f7096bd36438270dc54f296be4073de8eeb864b893c17044d6fb4cc06 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 23:51:51,845 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 23:51:51,847 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 23:51:51,894 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 23:51:51,894 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 23:51:51,895 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 23:51:51,897 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 23:51:51,899 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 23:51:51,901 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 23:51:51,905 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 23:51:51,906 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 23:51:51,908 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 23:51:51,908 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 23:51:51,911 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 23:51:51,912 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 23:51:51,915 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 23:51:51,916 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 23:51:51,918 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 23:51:51,919 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 23:51:51,925 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 23:51:51,927 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 23:51:51,928 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 23:51:51,928 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 23:51:51,929 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 23:51:51,931 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 23:51:51,937 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 23:51:51,937 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 23:51:51,938 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 23:51:51,940 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 23:51:51,940 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 23:51:51,941 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 23:51:51,941 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 23:51:51,943 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 23:51:51,943 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 23:51:51,944 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 23:51:51,946 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 23:51:51,946 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 23:51:51,946 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 23:51:51,947 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 23:51:51,947 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 23:51:51,948 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 23:51:51,949 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 23:51:51,950 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-22 23:51:51,985 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 23:51:51,986 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 23:51:51,986 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 23:51:51,986 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 23:51:51,987 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 23:51:51,987 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 23:51:51,988 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 23:51:51,988 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 23:51:51,988 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 23:51:51,989 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 23:51:51,989 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 23:51:51,990 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 23:51:51,990 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 23:51:51,990 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 23:51:51,990 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 23:51:51,990 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 23:51:51,991 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 23:51:51,991 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 23:51:51,991 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 23:51:51,991 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 23:51:51,992 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 23:51:51,992 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 23:51:51,992 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 23:51:51,992 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 23:51:51,992 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 23:51:51,993 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 23:51:51,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 23:51:51,993 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 23:51:51,993 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 23:51:51,994 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 23:51:51,994 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 -> 389f662f7096bd36438270dc54f296be4073de8eeb864b893c17044d6fb4cc06 [2022-07-22 23:51:52,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 23:51:52,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 23:51:52,280 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 23:51:52,281 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 23:51:52,281 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 23:51:52,283 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--ppp--ppp_synctty.ko-entry_point.cil.out.i [2022-07-22 23:51:52,356 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6872c1ea/84537a9b149b433296873c9d62dea574/FLAGcd003aace [2022-07-22 23:51:53,042 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 23:51:53,044 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--ppp--ppp_synctty.ko-entry_point.cil.out.i [2022-07-22 23:51:53,079 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6872c1ea/84537a9b149b433296873c9d62dea574/FLAGcd003aace [2022-07-22 23:51:53,135 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6872c1ea/84537a9b149b433296873c9d62dea574 [2022-07-22 23:51:53,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 23:51:53,139 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 23:51:53,140 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 23:51:53,141 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 23:51:53,145 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 23:51:53,146 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:51:53" (1/1) ... [2022-07-22 23:51:53,147 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6099c577 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:51:53, skipping insertion in model container [2022-07-22 23:51:53,147 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:51:53" (1/1) ... [2022-07-22 23:51:53,170 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 23:51:53,273 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 23:51:54,114 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--ppp--ppp_synctty.ko-entry_point.cil.out.i[163507,163520] [2022-07-22 23:51:54,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 23:51:54,482 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 23:51:54,610 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--ppp--ppp_synctty.ko-entry_point.cil.out.i[163507,163520] [2022-07-22 23:51:54,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 23:51:54,777 INFO L208 MainTranslator]: Completed translation [2022-07-22 23:51:54,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:51:54 WrapperNode [2022-07-22 23:51:54,779 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 23:51:54,780 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 23:51:54,781 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 23:51:54,781 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 23:51:54,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:51:54" (1/1) ... [2022-07-22 23:51:54,845 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:51:54" (1/1) ... [2022-07-22 23:51:54,936 INFO L137 Inliner]: procedures = 176, calls = 448, calls flagged for inlining = 92, calls inlined = 85, statements flattened = 1769 [2022-07-22 23:51:54,937 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 23:51:54,938 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 23:51:54,938 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 23:51:54,938 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 23:51:54,948 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:51:54" (1/1) ... [2022-07-22 23:51:54,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:51:54" (1/1) ... [2022-07-22 23:51:54,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:51:54" (1/1) ... [2022-07-22 23:51:54,977 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:51:54" (1/1) ... [2022-07-22 23:51:55,033 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:51:54" (1/1) ... [2022-07-22 23:51:55,043 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:51:54" (1/1) ... [2022-07-22 23:51:55,052 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:51:54" (1/1) ... [2022-07-22 23:51:55,067 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 23:51:55,068 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 23:51:55,068 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 23:51:55,068 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 23:51:55,069 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:51:54" (1/1) ... [2022-07-22 23:51:55,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 23:51:55,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 23:51:55,117 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-22 23:51:55,130 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-22 23:51:55,157 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-22 23:51:55,157 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-22 23:51:55,158 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_alloc_skb_15 [2022-07-22 23:51:55,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_alloc_skb_15 [2022-07-22 23:51:55,158 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_sync_poll [2022-07-22 23:51:55,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_sync_poll [2022-07-22 23:51:55,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-22 23:51:55,158 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reserve [2022-07-22 23:51:55,159 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reserve [2022-07-22 23:51:55,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-22 23:51:55,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-22 23:51:55,159 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-22 23:51:55,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-22 23:51:55,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 23:51:55,160 INFO L130 BoogieDeclarations]: Found specification of procedure skb_push [2022-07-22 23:51:55,160 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_push [2022-07-22 23:51:55,160 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_output_wakeup [2022-07-22 23:51:55,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_output_wakeup [2022-07-22 23:51:55,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-22 23:51:55,160 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-22 23:51:55,161 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2022-07-22 23:51:55,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2022-07-22 23:51:55,161 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-22 23:51:55,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-22 23:51:55,161 INFO L130 BoogieDeclarations]: Found specification of procedure spin_trylock_bh [2022-07-22 23:51:55,161 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_trylock_bh [2022-07-22 23:51:55,161 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-22 23:51:55,162 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-22 23:51:55,162 INFO L130 BoogieDeclarations]: Found specification of procedure skb_trim [2022-07-22 23:51:55,162 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_trim [2022-07-22 23:51:55,162 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-07-22 23:51:55,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-07-22 23:51:55,162 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_synctty_ioctl [2022-07-22 23:51:55,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_synctty_ioctl [2022-07-22 23:51:55,163 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-22 23:51:55,163 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-22 23:51:55,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 23:51:55,163 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-22 23:51:55,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-22 23:51:55,164 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2022-07-22 23:51:55,164 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2022-07-22 23:51:55,164 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_sync_close [2022-07-22 23:51:55,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_sync_close [2022-07-22 23:51:55,164 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-22 23:51:55,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-22 23:51:55,165 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-22 23:51:55,165 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-22 23:51:55,165 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_print_buffer [2022-07-22 23:51:55,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_print_buffer [2022-07-22 23:51:55,165 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-22 23:51:55,165 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-22 23:51:55,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 23:51:55,166 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-07-22 23:51:55,166 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-07-22 23:51:55,166 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-22 23:51:55,166 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-22 23:51:55,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 23:51:55,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 23:51:55,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 23:51:55,167 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-07-22 23:51:55,167 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-07-22 23:51:55,167 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_schedule [2022-07-22 23:51:55,167 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_schedule [2022-07-22 23:51:55,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 23:51:55,168 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-07-22 23:51:55,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-07-22 23:51:55,168 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec_and_test [2022-07-22 23:51:55,168 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec_and_test [2022-07-22 23:51:55,168 INFO L130 BoogieDeclarations]: Found specification of procedure sp_put [2022-07-22 23:51:55,169 INFO L138 BoogieDeclarations]: Found implementation of procedure sp_put [2022-07-22 23:51:55,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 23:51:55,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-22 23:51:55,169 INFO L130 BoogieDeclarations]: Found specification of procedure skb_queue_tail [2022-07-22 23:51:55,169 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_queue_tail [2022-07-22 23:51:55,169 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_sync_hangup [2022-07-22 23:51:55,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_sync_hangup [2022-07-22 23:51:55,170 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-22 23:51:55,170 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-22 23:51:55,170 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-07-22 23:51:55,170 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-07-22 23:51:55,170 INFO L130 BoogieDeclarations]: Found specification of procedure sp_get [2022-07-22 23:51:55,170 INFO L138 BoogieDeclarations]: Found implementation of procedure sp_get [2022-07-22 23:51:55,170 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-22 23:51:55,171 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-22 23:51:55,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 23:51:55,171 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2022-07-22 23:51:55,171 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2022-07-22 23:51:55,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-22 23:51:55,171 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-22 23:51:55,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-22 23:51:55,171 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-07-22 23:51:55,172 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-07-22 23:51:55,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 23:51:55,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 23:51:55,172 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_sync_push [2022-07-22 23:51:55,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_sync_push [2022-07-22 23:51:55,592 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 23:51:55,594 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 23:51:55,673 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-22 23:51:56,743 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 23:51:56,761 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 23:51:56,762 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 23:51:56,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:51:56 BoogieIcfgContainer [2022-07-22 23:51:56,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 23:51:56,768 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 23:51:56,768 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 23:51:56,772 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 23:51:56,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 11:51:53" (1/3) ... [2022-07-22 23:51:56,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@847e545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:51:56, skipping insertion in model container [2022-07-22 23:51:56,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:51:54" (2/3) ... [2022-07-22 23:51:56,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@847e545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:51:56, skipping insertion in model container [2022-07-22 23:51:56,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:51:56" (3/3) ... [2022-07-22 23:51:56,775 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_synctty.ko-entry_point.cil.out.i [2022-07-22 23:51:56,788 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 23:51:56,788 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 23:51:56,844 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 23:51:56,850 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@38a9f37b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5a3fdb [2022-07-22 23:51:56,850 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 23:51:56,857 INFO L276 IsEmpty]: Start isEmpty. Operand has 644 states, 483 states have (on average 1.391304347826087) internal successors, (672), 499 states have internal predecessors, (672), 120 states have call successors, (120), 40 states have call predecessors, (120), 39 states have return successors, (116), 114 states have call predecessors, (116), 116 states have call successors, (116) [2022-07-22 23:51:56,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-22 23:51:56,870 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:51:56,871 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 23:51:56,871 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:51:56,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:51:56,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1758611482, now seen corresponding path program 1 times [2022-07-22 23:51:56,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:51:56,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387735880] [2022-07-22 23:51:56,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:51:56,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:51:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:57,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:51:57,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:57,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:51:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:57,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:51:57,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:57,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:51:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:57,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:51:57,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:57,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:51:57,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:57,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:51:57,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:57,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:51:57,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:57,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:51:57,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:57,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:51:57,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:57,471 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-22 23:51:57,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:51:57,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387735880] [2022-07-22 23:51:57,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387735880] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:51:57,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:51:57,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 23:51:57,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558413769] [2022-07-22 23:51:57,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:51:57,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 23:51:57,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:51:57,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 23:51:57,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 23:51:57,522 INFO L87 Difference]: Start difference. First operand has 644 states, 483 states have (on average 1.391304347826087) internal successors, (672), 499 states have internal predecessors, (672), 120 states have call successors, (120), 40 states have call predecessors, (120), 39 states have return successors, (116), 114 states have call predecessors, (116), 116 states have call successors, (116) Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-22 23:51:59,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:51:59,375 INFO L93 Difference]: Finished difference Result 2033 states and 2996 transitions. [2022-07-22 23:51:59,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 23:51:59,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 78 [2022-07-22 23:51:59,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:51:59,420 INFO L225 Difference]: With dead ends: 2033 [2022-07-22 23:51:59,420 INFO L226 Difference]: Without dead ends: 1378 [2022-07-22 23:51:59,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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-22 23:51:59,442 INFO L413 NwaCegarLoop]: 978 mSDtfsCounter, 1248 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1336 SdHoareTripleChecker+Valid, 1936 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-22 23:51:59,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1336 Valid, 1936 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-22 23:51:59,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2022-07-22 23:51:59,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 1222. [2022-07-22 23:51:59,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1222 states, 926 states have (on average 1.3736501079913608) internal successors, (1272), 946 states have internal predecessors, (1272), 219 states have call successors, (219), 77 states have call predecessors, (219), 76 states have return successors, (218), 214 states have call predecessors, (218), 218 states have call successors, (218) [2022-07-22 23:51:59,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1709 transitions. [2022-07-22 23:51:59,634 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1709 transitions. Word has length 78 [2022-07-22 23:51:59,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:51:59,635 INFO L495 AbstractCegarLoop]: Abstraction has 1222 states and 1709 transitions. [2022-07-22 23:51:59,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-22 23:51:59,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1709 transitions. [2022-07-22 23:51:59,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-22 23:51:59,640 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:51:59,640 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 23:51:59,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 23:51:59,641 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:51:59,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:51:59,642 INFO L85 PathProgramCache]: Analyzing trace with hash -152487068, now seen corresponding path program 1 times [2022-07-22 23:51:59,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:51:59,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660078990] [2022-07-22 23:51:59,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:51:59,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:51:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:59,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:51:59,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:59,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:51:59,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:59,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:51:59,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:59,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:51:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:59,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:51:59,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:59,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:51:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:59,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:51:59,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:59,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:51:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:59,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:51:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:59,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:51:59,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:59,863 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-22 23:51:59,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:51:59,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660078990] [2022-07-22 23:51:59,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660078990] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:51:59,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:51:59,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 23:51:59,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953409885] [2022-07-22 23:51:59,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:51:59,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 23:51:59,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:51:59,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 23:51:59,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 23:51:59,867 INFO L87 Difference]: Start difference. First operand 1222 states and 1709 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-22 23:52:01,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:52:01,916 INFO L93 Difference]: Finished difference Result 3917 states and 5611 transitions. [2022-07-22 23:52:01,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 23:52:01,917 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 82 [2022-07-22 23:52:01,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:52:01,936 INFO L225 Difference]: With dead ends: 3917 [2022-07-22 23:52:01,936 INFO L226 Difference]: Without dead ends: 2713 [2022-07-22 23:52:01,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-22 23:52:01,947 INFO L413 NwaCegarLoop]: 990 mSDtfsCounter, 1267 mSDsluCounter, 2192 mSDsCounter, 0 mSdLazyCounter, 1714 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1359 SdHoareTripleChecker+Valid, 3182 SdHoareTripleChecker+Invalid, 2037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 1714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-22 23:52:01,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1359 Valid, 3182 Invalid, 2037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 1714 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-22 23:52:01,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2713 states. [2022-07-22 23:52:02,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2713 to 2509. [2022-07-22 23:52:02,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2509 states, 1903 states have (on average 1.3751970572779821) internal successors, (2617), 1951 states have internal predecessors, (2617), 443 states have call successors, (443), 153 states have call predecessors, (443), 162 states have return successors, (500), 438 states have call predecessors, (500), 442 states have call successors, (500) [2022-07-22 23:52:02,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2509 states to 2509 states and 3560 transitions. [2022-07-22 23:52:02,058 INFO L78 Accepts]: Start accepts. Automaton has 2509 states and 3560 transitions. Word has length 82 [2022-07-22 23:52:02,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:52:02,058 INFO L495 AbstractCegarLoop]: Abstraction has 2509 states and 3560 transitions. [2022-07-22 23:52:02,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-22 23:52:02,059 INFO L276 IsEmpty]: Start isEmpty. Operand 2509 states and 3560 transitions. [2022-07-22 23:52:02,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-22 23:52:02,067 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:52:02,067 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2022-07-22 23:52:02,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 23:52:02,067 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:52:02,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:52:02,068 INFO L85 PathProgramCache]: Analyzing trace with hash -950375967, now seen corresponding path program 1 times [2022-07-22 23:52:02,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:52:02,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520541661] [2022-07-22 23:52:02,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:52:02,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:52:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:02,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:52:02,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:02,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:52:02,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:02,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:52:02,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:02,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:52:02,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:02,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:52:02,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:02,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:52:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:02,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:52:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:02,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:52:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:02,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:52:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:02,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:52:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:02,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-22 23:52:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:02,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 23:52:02,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:02,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:52:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:02,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:02,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:02,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 23:52:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:02,314 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-22 23:52:02,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:52:02,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520541661] [2022-07-22 23:52:02,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520541661] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:52:02,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:52:02,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 23:52:02,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336495022] [2022-07-22 23:52:02,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:52:02,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 23:52:02,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:52:02,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 23:52:02,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-22 23:52:02,318 INFO L87 Difference]: Start difference. First operand 2509 states and 3560 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-22 23:52:04,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:52:04,376 INFO L93 Difference]: Finished difference Result 6827 states and 9761 transitions. [2022-07-22 23:52:04,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 23:52:04,377 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 128 [2022-07-22 23:52:04,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:52:04,407 INFO L225 Difference]: With dead ends: 6827 [2022-07-22 23:52:04,407 INFO L226 Difference]: Without dead ends: 4342 [2022-07-22 23:52:04,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-07-22 23:52:04,420 INFO L413 NwaCegarLoop]: 873 mSDtfsCounter, 1615 mSDsluCounter, 1620 mSDsCounter, 0 mSdLazyCounter, 1306 mSolverCounterSat, 792 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1689 SdHoareTripleChecker+Valid, 2493 SdHoareTripleChecker+Invalid, 2098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 792 IncrementalHoareTripleChecker+Valid, 1306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-22 23:52:04,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1689 Valid, 2493 Invalid, 2098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [792 Valid, 1306 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-22 23:52:04,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4342 states. [2022-07-22 23:52:04,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4342 to 3931. [2022-07-22 23:52:04,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3931 states, 2993 states have (on average 1.3742064817908453) internal successors, (4113), 3055 states have internal predecessors, (4113), 659 states have call successors, (659), 249 states have call predecessors, (659), 278 states have return successors, (777), 662 states have call predecessors, (777), 658 states have call successors, (777) [2022-07-22 23:52:04,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3931 states to 3931 states and 5549 transitions. [2022-07-22 23:52:04,624 INFO L78 Accepts]: Start accepts. Automaton has 3931 states and 5549 transitions. Word has length 128 [2022-07-22 23:52:04,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:52:04,628 INFO L495 AbstractCegarLoop]: Abstraction has 3931 states and 5549 transitions. [2022-07-22 23:52:04,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-22 23:52:04,629 INFO L276 IsEmpty]: Start isEmpty. Operand 3931 states and 5549 transitions. [2022-07-22 23:52:04,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-07-22 23:52:04,644 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:52:04,644 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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-22 23:52:04,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 23:52:04,648 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:52:04,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:52:04,649 INFO L85 PathProgramCache]: Analyzing trace with hash -944835305, now seen corresponding path program 1 times [2022-07-22 23:52:04,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:52:04,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545092088] [2022-07-22 23:52:04,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:52:04,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:52:04,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:04,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:52:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:04,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:52:04,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:04,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:52:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:04,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:52:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:04,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:52:04,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:04,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:52:04,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:04,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:52:04,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:04,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:52:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:04,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:52:04,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:04,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:52:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:04,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-22 23:52:04,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:04,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:04,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:52:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:04,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 23:52:04,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:04,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:04,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:04,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:52:04,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:04,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 23:52:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:04,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-22 23:52:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:04,952 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-22 23:52:04,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:52:04,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545092088] [2022-07-22 23:52:04,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545092088] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:52:04,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:52:04,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 23:52:04,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989883275] [2022-07-22 23:52:04,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:52:04,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 23:52:04,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:52:04,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 23:52:04,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 23:52:04,955 INFO L87 Difference]: Start difference. First operand 3931 states and 5549 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-22 23:52:06,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:52:06,853 INFO L93 Difference]: Finished difference Result 9990 states and 14092 transitions. [2022-07-22 23:52:06,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 23:52:06,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 149 [2022-07-22 23:52:06,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:52:06,890 INFO L225 Difference]: With dead ends: 9990 [2022-07-22 23:52:06,891 INFO L226 Difference]: Without dead ends: 6083 [2022-07-22 23:52:06,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-22 23:52:06,909 INFO L413 NwaCegarLoop]: 1196 mSDtfsCounter, 1046 mSDsluCounter, 1550 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 411 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1101 SdHoareTripleChecker+Valid, 2746 SdHoareTripleChecker+Invalid, 1552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 411 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-22 23:52:06,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1101 Valid, 2746 Invalid, 1552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [411 Valid, 1141 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-22 23:52:06,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6083 states. [2022-07-22 23:52:07,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6083 to 5590. [2022-07-22 23:52:07,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5590 states, 4255 states have (on average 1.3635722679200941) internal successors, (5802), 4361 states have internal predecessors, (5802), 906 states have call successors, (906), 383 states have call predecessors, (906), 428 states have return successors, (1074), 909 states have call predecessors, (1074), 905 states have call successors, (1074) [2022-07-22 23:52:07,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5590 states to 5590 states and 7782 transitions. [2022-07-22 23:52:07,184 INFO L78 Accepts]: Start accepts. Automaton has 5590 states and 7782 transitions. Word has length 149 [2022-07-22 23:52:07,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:52:07,185 INFO L495 AbstractCegarLoop]: Abstraction has 5590 states and 7782 transitions. [2022-07-22 23:52:07,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-22 23:52:07,185 INFO L276 IsEmpty]: Start isEmpty. Operand 5590 states and 7782 transitions. [2022-07-22 23:52:07,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-22 23:52:07,194 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:52:07,195 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:52:07,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 23:52:07,195 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:52:07,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:52:07,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1643009203, now seen corresponding path program 1 times [2022-07-22 23:52:07,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:52:07,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984210894] [2022-07-22 23:52:07,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:52:07,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:52:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:07,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:52:07,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:07,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:52:07,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:07,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:52:07,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:07,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:52:07,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:07,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:52:07,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:07,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:52:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:07,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:52:07,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:07,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:52:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:07,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:52:07,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:07,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:52:07,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:07,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 23:52:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:07,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 23:52:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:07,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-22 23:52:07,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:07,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 23:52:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:07,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:52:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:07,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:07,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:07,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 23:52:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:07,402 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-07-22 23:52:07,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:52:07,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984210894] [2022-07-22 23:52:07,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984210894] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:52:07,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:52:07,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 23:52:07,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335743318] [2022-07-22 23:52:07,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:52:07,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 23:52:07,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:52:07,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 23:52:07,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-22 23:52:07,405 INFO L87 Difference]: Start difference. First operand 5590 states and 7782 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-22 23:52:09,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:52:09,794 INFO L93 Difference]: Finished difference Result 14712 states and 20604 transitions. [2022-07-22 23:52:09,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 23:52:09,795 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 151 [2022-07-22 23:52:09,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:52:09,848 INFO L225 Difference]: With dead ends: 14712 [2022-07-22 23:52:09,849 INFO L226 Difference]: Without dead ends: 9157 [2022-07-22 23:52:09,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-07-22 23:52:09,872 INFO L413 NwaCegarLoop]: 897 mSDtfsCounter, 1619 mSDsluCounter, 2014 mSDsCounter, 0 mSdLazyCounter, 1824 mSolverCounterSat, 656 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1697 SdHoareTripleChecker+Valid, 2911 SdHoareTripleChecker+Invalid, 2480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 656 IncrementalHoareTripleChecker+Valid, 1824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-22 23:52:09,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1697 Valid, 2911 Invalid, 2480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [656 Valid, 1824 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-22 23:52:09,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9157 states. [2022-07-22 23:52:10,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9157 to 8330. [2022-07-22 23:52:10,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8330 states, 6415 states have (on average 1.3624318004676539) internal successors, (8740), 6559 states have internal predecessors, (8740), 1254 states have call successors, (1254), 587 states have call predecessors, (1254), 660 states have return successors, (1489), 1267 states have call predecessors, (1489), 1253 states have call successors, (1489) [2022-07-22 23:52:10,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8330 states to 8330 states and 11483 transitions. [2022-07-22 23:52:10,290 INFO L78 Accepts]: Start accepts. Automaton has 8330 states and 11483 transitions. Word has length 151 [2022-07-22 23:52:10,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:52:10,292 INFO L495 AbstractCegarLoop]: Abstraction has 8330 states and 11483 transitions. [2022-07-22 23:52:10,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-22 23:52:10,293 INFO L276 IsEmpty]: Start isEmpty. Operand 8330 states and 11483 transitions. [2022-07-22 23:52:10,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-22 23:52:10,305 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:52:10,305 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:52:10,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 23:52:10,306 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:52:10,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:52:10,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1373098194, now seen corresponding path program 1 times [2022-07-22 23:52:10,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:52:10,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993735031] [2022-07-22 23:52:10,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:52:10,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:52:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:10,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:52:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:10,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:52:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:10,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:52:10,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:10,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:52:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:10,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:52:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:10,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:52:10,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:10,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:52:10,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:10,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:52:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:10,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:52:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:10,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:52:10,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:10,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 23:52:10,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:10,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 23:52:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:10,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-22 23:52:10,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:10,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:10,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:10,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 23:52:10,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:10,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:52:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:10,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:10,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:10,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 23:52:10,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:10,534 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2022-07-22 23:52:10,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:52:10,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993735031] [2022-07-22 23:52:10,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993735031] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:52:10,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:52:10,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 23:52:10,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793360657] [2022-07-22 23:52:10,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:52:10,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 23:52:10,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:52:10,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 23:52:10,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-22 23:52:10,537 INFO L87 Difference]: Start difference. First operand 8330 states and 11483 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (19), 6 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-22 23:52:12,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:52:12,329 INFO L93 Difference]: Finished difference Result 13560 states and 19023 transitions. [2022-07-22 23:52:12,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 23:52:12,335 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (19), 6 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2022-07-22 23:52:12,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:52:12,394 INFO L225 Difference]: With dead ends: 13560 [2022-07-22 23:52:12,395 INFO L226 Difference]: Without dead ends: 9164 [2022-07-22 23:52:12,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-22 23:52:12,417 INFO L413 NwaCegarLoop]: 821 mSDtfsCounter, 530 mSDsluCounter, 2011 mSDsCounter, 0 mSdLazyCounter, 1327 mSolverCounterSat, 312 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 2832 SdHoareTripleChecker+Invalid, 1639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 312 IncrementalHoareTripleChecker+Valid, 1327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-22 23:52:12,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 2832 Invalid, 1639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [312 Valid, 1327 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-22 23:52:12,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9164 states. [2022-07-22 23:52:12,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9164 to 8350. [2022-07-22 23:52:12,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8350 states, 6435 states have (on average 1.3613053613053614) internal successors, (8760), 6579 states have internal predecessors, (8760), 1254 states have call successors, (1254), 587 states have call predecessors, (1254), 660 states have return successors, (1489), 1267 states have call predecessors, (1489), 1253 states have call successors, (1489) [2022-07-22 23:52:12,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8350 states to 8350 states and 11503 transitions. [2022-07-22 23:52:12,825 INFO L78 Accepts]: Start accepts. Automaton has 8350 states and 11503 transitions. Word has length 156 [2022-07-22 23:52:12,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:52:12,826 INFO L495 AbstractCegarLoop]: Abstraction has 8350 states and 11503 transitions. [2022-07-22 23:52:12,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (19), 6 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-22 23:52:12,826 INFO L276 IsEmpty]: Start isEmpty. Operand 8350 states and 11503 transitions. [2022-07-22 23:52:12,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-22 23:52:12,843 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:52:12,843 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:52:12,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 23:52:12,844 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:52:12,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:52:12,844 INFO L85 PathProgramCache]: Analyzing trace with hash 554198863, now seen corresponding path program 1 times [2022-07-22 23:52:12,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:52:12,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754953227] [2022-07-22 23:52:12,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:52:12,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:52:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:12,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:52:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:12,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:52:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:13,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:52:13,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:13,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:52:13,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:13,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:52:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:13,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:52:13,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:13,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:52:13,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:13,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:52:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:13,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:52:13,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:13,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:52:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:13,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 23:52:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:13,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 23:52:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:13,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-22 23:52:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:13,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:13,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:13,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 23:52:13,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:13,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:52:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:13,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:13,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:13,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-22 23:52:13,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:13,310 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2022-07-22 23:52:13,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:52:13,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754953227] [2022-07-22 23:52:13,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754953227] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:52:13,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:52:13,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-22 23:52:13,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142971923] [2022-07-22 23:52:13,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:52:13,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-22 23:52:13,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:52:13,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-22 23:52:13,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-22 23:52:13,314 INFO L87 Difference]: Start difference. First operand 8350 states and 11503 transitions. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 8 states have internal predecessors, (87), 5 states have call successors, (19), 6 states have call predecessors, (19), 3 states have return successors, (18), 6 states have call predecessors, (18), 4 states have call successors, (18) [2022-07-22 23:52:16,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:52:16,827 INFO L93 Difference]: Finished difference Result 18695 states and 25902 transitions. [2022-07-22 23:52:16,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-22 23:52:16,828 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 8 states have internal predecessors, (87), 5 states have call successors, (19), 6 states have call predecessors, (19), 3 states have return successors, (18), 6 states have call predecessors, (18), 4 states have call successors, (18) Word has length 158 [2022-07-22 23:52:16,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:52:16,875 INFO L225 Difference]: With dead ends: 18695 [2022-07-22 23:52:16,875 INFO L226 Difference]: Without dead ends: 10380 [2022-07-22 23:52:16,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=175, Invalid=527, Unknown=0, NotChecked=0, Total=702 [2022-07-22 23:52:16,899 INFO L413 NwaCegarLoop]: 972 mSDtfsCounter, 3198 mSDsluCounter, 2713 mSDsCounter, 0 mSdLazyCounter, 3427 mSolverCounterSat, 1694 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3287 SdHoareTripleChecker+Valid, 3685 SdHoareTripleChecker+Invalid, 5121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1694 IncrementalHoareTripleChecker+Valid, 3427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-22 23:52:16,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3287 Valid, 3685 Invalid, 5121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1694 Valid, 3427 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-22 23:52:16,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10380 states. [2022-07-22 23:52:17,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10380 to 8726. [2022-07-22 23:52:17,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8726 states, 6679 states have (on average 1.3505015720916305) internal successors, (9020), 6821 states have internal predecessors, (9020), 1346 states have call successors, (1346), 665 states have call predecessors, (1346), 700 states have return successors, (1519), 1331 states have call predecessors, (1519), 1345 states have call successors, (1519) [2022-07-22 23:52:17,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8726 states to 8726 states and 11885 transitions. [2022-07-22 23:52:17,251 INFO L78 Accepts]: Start accepts. Automaton has 8726 states and 11885 transitions. Word has length 158 [2022-07-22 23:52:17,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:52:17,251 INFO L495 AbstractCegarLoop]: Abstraction has 8726 states and 11885 transitions. [2022-07-22 23:52:17,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 8 states have internal predecessors, (87), 5 states have call successors, (19), 6 states have call predecessors, (19), 3 states have return successors, (18), 6 states have call predecessors, (18), 4 states have call successors, (18) [2022-07-22 23:52:17,252 INFO L276 IsEmpty]: Start isEmpty. Operand 8726 states and 11885 transitions. [2022-07-22 23:52:17,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-07-22 23:52:17,270 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:52:17,271 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:52:17,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 23:52:17,271 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:52:17,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:52:17,272 INFO L85 PathProgramCache]: Analyzing trace with hash -3224619, now seen corresponding path program 1 times [2022-07-22 23:52:17,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:52:17,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91658247] [2022-07-22 23:52:17,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:52:17,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:52:17,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:17,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:52:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:17,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:52:17,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:17,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:52:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:17,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:52:17,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:17,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:52:17,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:17,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:52:17,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:17,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:52:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:17,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:52:17,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:17,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:52:17,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:17,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:52:17,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:17,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 23:52:17,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:17,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 23:52:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:17,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-22 23:52:17,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:17,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:17,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:17,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-22 23:52:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:17,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-22 23:52:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:17,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:17,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:17,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:17,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:17,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-22 23:52:17,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:17,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:17,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:17,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-22 23:52:17,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:17,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:17,688 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2022-07-22 23:52:17,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:52:17,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91658247] [2022-07-22 23:52:17,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91658247] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:52:17,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:52:17,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 23:52:17,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813151026] [2022-07-22 23:52:17,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:52:17,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 23:52:17,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:52:17,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 23:52:17,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-22 23:52:17,691 INFO L87 Difference]: Start difference. First operand 8726 states and 11885 transitions. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (22), 5 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-22 23:52:19,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:52:19,676 INFO L93 Difference]: Finished difference Result 18475 states and 25394 transitions. [2022-07-22 23:52:19,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 23:52:19,677 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (22), 5 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) Word has length 193 [2022-07-22 23:52:19,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:52:19,718 INFO L225 Difference]: With dead ends: 18475 [2022-07-22 23:52:19,719 INFO L226 Difference]: Without dead ends: 9784 [2022-07-22 23:52:19,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-22 23:52:19,744 INFO L413 NwaCegarLoop]: 840 mSDtfsCounter, 426 mSDsluCounter, 2381 mSDsCounter, 0 mSdLazyCounter, 1603 mSolverCounterSat, 293 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 3221 SdHoareTripleChecker+Invalid, 1896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 1603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-22 23:52:19,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 3221 Invalid, 1896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 1603 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-22 23:52:19,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9784 states. [2022-07-22 23:52:20,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9784 to 8790. [2022-07-22 23:52:20,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8790 states, 6727 states have (on average 1.3480005946187008) internal successors, (9068), 6869 states have internal predecessors, (9068), 1346 states have call successors, (1346), 665 states have call predecessors, (1346), 716 states have return successors, (1543), 1347 states have call predecessors, (1543), 1345 states have call successors, (1543) [2022-07-22 23:52:20,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8790 states to 8790 states and 11957 transitions. [2022-07-22 23:52:20,176 INFO L78 Accepts]: Start accepts. Automaton has 8790 states and 11957 transitions. Word has length 193 [2022-07-22 23:52:20,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:52:20,177 INFO L495 AbstractCegarLoop]: Abstraction has 8790 states and 11957 transitions. [2022-07-22 23:52:20,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (22), 5 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-22 23:52:20,177 INFO L276 IsEmpty]: Start isEmpty. Operand 8790 states and 11957 transitions. [2022-07-22 23:52:20,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-07-22 23:52:20,195 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:52:20,195 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 4, 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] [2022-07-22 23:52:20,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 23:52:20,195 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:52:20,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:52:20,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1088928772, now seen corresponding path program 1 times [2022-07-22 23:52:20,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:52:20,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295340431] [2022-07-22 23:52:20,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:52:20,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:52:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:20,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:52:20,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:20,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:52:20,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:20,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:52:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:20,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:52:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:20,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:52:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:20,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:52:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:20,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:52:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:20,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:52:20,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:20,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:52:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:20,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:52:20,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:20,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 23:52:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:20,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 23:52:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:20,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-22 23:52:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:20,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-22 23:52:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:20,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-22 23:52:20,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:20,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:20,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:20,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:20,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-22 23:52:20,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:20,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:20,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:20,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:20,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 23:52:20,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:20,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-22 23:52:20,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:20,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:20,472 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2022-07-22 23:52:20,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:52:20,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295340431] [2022-07-22 23:52:20,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295340431] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:52:20,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:52:20,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 23:52:20,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538323220] [2022-07-22 23:52:20,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:52:20,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 23:52:20,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:52:20,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 23:52:20,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 23:52:20,475 INFO L87 Difference]: Start difference. First operand 8790 states and 11957 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (22), 4 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-22 23:52:23,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:52:23,016 INFO L93 Difference]: Finished difference Result 22136 states and 30222 transitions. [2022-07-22 23:52:23,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 23:52:23,024 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (22), 4 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 215 [2022-07-22 23:52:23,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:52:23,080 INFO L225 Difference]: With dead ends: 22136 [2022-07-22 23:52:23,080 INFO L226 Difference]: Without dead ends: 13381 [2022-07-22 23:52:23,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-22 23:52:23,104 INFO L413 NwaCegarLoop]: 1442 mSDtfsCounter, 1149 mSDsluCounter, 2433 mSDsCounter, 0 mSdLazyCounter, 2023 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1192 SdHoareTripleChecker+Valid, 3875 SdHoareTripleChecker+Invalid, 2384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 2023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-22 23:52:23,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1192 Valid, 3875 Invalid, 2384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 2023 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-22 23:52:23,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13381 states. [2022-07-22 23:52:23,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13381 to 8806. [2022-07-22 23:52:23,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8806 states, 6743 states have (on average 1.3471748479905086) internal successors, (9084), 6885 states have internal predecessors, (9084), 1346 states have call successors, (1346), 665 states have call predecessors, (1346), 716 states have return successors, (1543), 1347 states have call predecessors, (1543), 1345 states have call successors, (1543) [2022-07-22 23:52:23,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8806 states to 8806 states and 11973 transitions. [2022-07-22 23:52:23,475 INFO L78 Accepts]: Start accepts. Automaton has 8806 states and 11973 transitions. Word has length 215 [2022-07-22 23:52:23,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:52:23,475 INFO L495 AbstractCegarLoop]: Abstraction has 8806 states and 11973 transitions. [2022-07-22 23:52:23,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (22), 4 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-22 23:52:23,476 INFO L276 IsEmpty]: Start isEmpty. Operand 8806 states and 11973 transitions. [2022-07-22 23:52:23,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-07-22 23:52:23,491 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:52:23,492 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:52:23,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 23:52:23,492 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:52:23,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:52:23,492 INFO L85 PathProgramCache]: Analyzing trace with hash 2069474836, now seen corresponding path program 1 times [2022-07-22 23:52:23,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:52:23,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171144689] [2022-07-22 23:52:23,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:52:23,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:52:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:23,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:52:23,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:23,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:52:23,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:23,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:52:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:23,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:52:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:23,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:52:23,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:23,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:52:23,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:23,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:52:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:23,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:52:23,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:23,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:52:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:23,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:52:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:23,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 23:52:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:23,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 23:52:23,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:23,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-22 23:52:23,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:23,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:23,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-22 23:52:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:23,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-22 23:52:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:23,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:23,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:23,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:23,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 23:52:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:23,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-22 23:52:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:23,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:23,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-22 23:52:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:23,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:23,868 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2022-07-22 23:52:23,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:52:23,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171144689] [2022-07-22 23:52:23,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171144689] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 23:52:23,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778742039] [2022-07-22 23:52:23,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:52:23,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 23:52:23,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 23:52:23,871 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-22 23:52:23,872 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-22 23:52:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:24,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 1400 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-22 23:52:24,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:52:24,516 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 98 proven. 8 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2022-07-22 23:52:24,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 23:52:24,995 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2022-07-22 23:52:24,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778742039] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 23:52:24,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 23:52:24,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 9] total 20 [2022-07-22 23:52:24,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154221132] [2022-07-22 23:52:24,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 23:52:24,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-22 23:52:24,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:52:24,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-22 23:52:24,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2022-07-22 23:52:24,998 INFO L87 Difference]: Start difference. First operand 8806 states and 11973 transitions. Second operand has 20 states, 20 states have (on average 10.4) internal successors, (208), 17 states have internal predecessors, (208), 9 states have call successors, (57), 9 states have call predecessors, (57), 11 states have return successors, (44), 13 states have call predecessors, (44), 9 states have call successors, (44) [2022-07-22 23:52:33,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:52:33,029 INFO L93 Difference]: Finished difference Result 31956 states and 44216 transitions. [2022-07-22 23:52:33,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-22 23:52:33,030 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 10.4) internal successors, (208), 17 states have internal predecessors, (208), 9 states have call successors, (57), 9 states have call predecessors, (57), 11 states have return successors, (44), 13 states have call predecessors, (44), 9 states have call successors, (44) Word has length 200 [2022-07-22 23:52:33,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:52:33,154 INFO L225 Difference]: With dead ends: 31956 [2022-07-22 23:52:33,155 INFO L226 Difference]: Without dead ends: 27104 [2022-07-22 23:52:33,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 443 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=556, Invalid=1994, Unknown=0, NotChecked=0, Total=2550 [2022-07-22 23:52:33,179 INFO L413 NwaCegarLoop]: 1613 mSDtfsCounter, 9435 mSDsluCounter, 5839 mSDsCounter, 0 mSdLazyCounter, 7766 mSolverCounterSat, 4383 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9711 SdHoareTripleChecker+Valid, 7452 SdHoareTripleChecker+Invalid, 12149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4383 IncrementalHoareTripleChecker+Valid, 7766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-07-22 23:52:33,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9711 Valid, 7452 Invalid, 12149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4383 Valid, 7766 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2022-07-22 23:52:33,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27104 states. [2022-07-22 23:52:34,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27104 to 24845. [2022-07-22 23:52:34,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24845 states, 18848 states have (on average 1.3417869269949065) internal successors, (25290), 19360 states have internal predecessors, (25290), 3884 states have call successors, (3884), 1849 states have call predecessors, (3884), 2112 states have return successors, (5009), 3909 states have call predecessors, (5009), 3883 states have call successors, (5009) [2022-07-22 23:52:34,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24845 states to 24845 states and 34183 transitions. [2022-07-22 23:52:34,236 INFO L78 Accepts]: Start accepts. Automaton has 24845 states and 34183 transitions. Word has length 200 [2022-07-22 23:52:34,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:52:34,237 INFO L495 AbstractCegarLoop]: Abstraction has 24845 states and 34183 transitions. [2022-07-22 23:52:34,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 10.4) internal successors, (208), 17 states have internal predecessors, (208), 9 states have call successors, (57), 9 states have call predecessors, (57), 11 states have return successors, (44), 13 states have call predecessors, (44), 9 states have call successors, (44) [2022-07-22 23:52:34,237 INFO L276 IsEmpty]: Start isEmpty. Operand 24845 states and 34183 transitions. [2022-07-22 23:52:34,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-07-22 23:52:34,252 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:52:34,253 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:52:34,285 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-22 23:52:34,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-22 23:52:34,480 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:52:34,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:52:34,480 INFO L85 PathProgramCache]: Analyzing trace with hash -872421549, now seen corresponding path program 1 times [2022-07-22 23:52:34,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:52:34,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563816370] [2022-07-22 23:52:34,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:52:34,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:52:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:34,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:52:34,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:34,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:52:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:34,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:52:34,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:34,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:52:34,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:34,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:52:34,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:34,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:52:34,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:34,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:52:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:34,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:52:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:34,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:52:34,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:34,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:52:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:34,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 23:52:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:34,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 23:52:34,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:34,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-22 23:52:34,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:34,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:34,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:34,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-22 23:52:34,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:34,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-22 23:52:34,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:34,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:34,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:34,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:34,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 23:52:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:34,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-22 23:52:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:34,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:34,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-22 23:52:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:34,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:34,695 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-07-22 23:52:34,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:52:34,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563816370] [2022-07-22 23:52:34,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563816370] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:52:34,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:52:34,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 23:52:34,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581039383] [2022-07-22 23:52:34,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:52:34,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 23:52:34,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:52:34,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 23:52:34,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-22 23:52:34,698 INFO L87 Difference]: Start difference. First operand 24845 states and 34183 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (23), 5 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-22 23:52:36,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:52:36,691 INFO L93 Difference]: Finished difference Result 47218 states and 65947 transitions. [2022-07-22 23:52:36,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 23:52:36,692 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (23), 5 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 202 [2022-07-22 23:52:36,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:52:36,804 INFO L225 Difference]: With dead ends: 47218 [2022-07-22 23:52:36,805 INFO L226 Difference]: Without dead ends: 26319 [2022-07-22 23:52:36,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-22 23:52:36,864 INFO L413 NwaCegarLoop]: 840 mSDtfsCounter, 443 mSDsluCounter, 1850 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 2690 SdHoareTripleChecker+Invalid, 1523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-22 23:52:36,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 2690 Invalid, 1523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-22 23:52:36,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26319 states. [2022-07-22 23:52:37,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26319 to 24829. [2022-07-22 23:52:37,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24829 states, 18832 states have (on average 1.3396346644010195) internal successors, (25228), 19344 states have internal predecessors, (25228), 3884 states have call successors, (3884), 1849 states have call predecessors, (3884), 2112 states have return successors, (4997), 3909 states have call predecessors, (4997), 3883 states have call successors, (4997) [2022-07-22 23:52:37,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24829 states to 24829 states and 34109 transitions. [2022-07-22 23:52:37,984 INFO L78 Accepts]: Start accepts. Automaton has 24829 states and 34109 transitions. Word has length 202 [2022-07-22 23:52:37,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:52:37,985 INFO L495 AbstractCegarLoop]: Abstraction has 24829 states and 34109 transitions. [2022-07-22 23:52:37,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (23), 5 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-22 23:52:37,985 INFO L276 IsEmpty]: Start isEmpty. Operand 24829 states and 34109 transitions. [2022-07-22 23:52:38,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-07-22 23:52:38,002 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:52:38,002 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 3, 3, 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] [2022-07-22 23:52:38,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-22 23:52:38,002 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:52:38,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:52:38,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1114922220, now seen corresponding path program 1 times [2022-07-22 23:52:38,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:52:38,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343570642] [2022-07-22 23:52:38,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:52:38,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:52:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:38,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:52:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:38,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:52:38,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:38,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:52:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:38,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:52:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:38,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:52:38,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:38,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:52:38,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:38,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:52:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:38,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:52:38,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:38,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:52:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:38,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:52:38,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:38,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 23:52:38,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:38,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 23:52:38,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:38,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-22 23:52:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:38,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:38,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:38,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-22 23:52:38,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:38,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-22 23:52:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:38,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:38,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:38,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:38,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 23:52:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:38,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-22 23:52:38,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:38,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:38,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:38,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-22 23:52:38,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:38,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:38,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:38,232 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2022-07-22 23:52:38,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:52:38,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343570642] [2022-07-22 23:52:38,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343570642] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:52:38,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:52:38,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 23:52:38,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941240726] [2022-07-22 23:52:38,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:52:38,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 23:52:38,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:52:38,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 23:52:38,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-22 23:52:38,235 INFO L87 Difference]: Start difference. First operand 24829 states and 34109 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (23), 5 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-22 23:52:41,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:52:41,170 INFO L93 Difference]: Finished difference Result 66761 states and 96168 transitions. [2022-07-22 23:52:41,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 23:52:41,170 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (23), 5 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 204 [2022-07-22 23:52:41,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:52:41,361 INFO L225 Difference]: With dead ends: 66761 [2022-07-22 23:52:41,361 INFO L226 Difference]: Without dead ends: 41967 [2022-07-22 23:52:41,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-22 23:52:41,436 INFO L413 NwaCegarLoop]: 1410 mSDtfsCounter, 1366 mSDsluCounter, 3004 mSDsCounter, 0 mSdLazyCounter, 1608 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1455 SdHoareTripleChecker+Valid, 4414 SdHoareTripleChecker+Invalid, 2047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 1608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-22 23:52:41,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1455 Valid, 4414 Invalid, 2047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [439 Valid, 1608 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-22 23:52:41,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41967 states. [2022-07-22 23:52:42,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41967 to 24889. [2022-07-22 23:52:42,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24889 states, 18892 states have (on average 1.338556002540758) internal successors, (25288), 19404 states have internal predecessors, (25288), 3884 states have call successors, (3884), 1849 states have call predecessors, (3884), 2112 states have return successors, (4997), 3909 states have call predecessors, (4997), 3883 states have call successors, (4997) [2022-07-22 23:52:42,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24889 states to 24889 states and 34169 transitions. [2022-07-22 23:52:42,812 INFO L78 Accepts]: Start accepts. Automaton has 24889 states and 34169 transitions. Word has length 204 [2022-07-22 23:52:42,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:52:42,813 INFO L495 AbstractCegarLoop]: Abstraction has 24889 states and 34169 transitions. [2022-07-22 23:52:42,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (23), 5 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-22 23:52:42,813 INFO L276 IsEmpty]: Start isEmpty. Operand 24889 states and 34169 transitions. [2022-07-22 23:52:42,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-07-22 23:52:42,832 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:52:42,832 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 3, 3, 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] [2022-07-22 23:52:42,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-22 23:52:42,833 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:52:42,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:52:42,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1099484298, now seen corresponding path program 1 times [2022-07-22 23:52:42,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:52:42,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6925966] [2022-07-22 23:52:42,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:52:42,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:52:42,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:43,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:52:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:43,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:52:43,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:43,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:52:43,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:43,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:52:43,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:43,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:52:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:43,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:52:43,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:43,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:52:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:43,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:52:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:43,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:52:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:43,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:52:43,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:43,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 23:52:43,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:43,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 23:52:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:43,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-22 23:52:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:43,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:43,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-22 23:52:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:43,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-22 23:52:43,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:43,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:43,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:43,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:43,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 23:52:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:43,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-22 23:52:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:43,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:43,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-22 23:52:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:43,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-22 23:52:43,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:43,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:43,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:43,221 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2022-07-22 23:52:43,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:52:43,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6925966] [2022-07-22 23:52:43,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6925966] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:52:43,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:52:43,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 23:52:43,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143446910] [2022-07-22 23:52:43,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:52:43,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 23:52:43,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:52:43,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 23:52:43,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-22 23:52:43,224 INFO L87 Difference]: Start difference. First operand 24889 states and 34169 transitions. Second operand has 8 states, 8 states have (on average 14.25) internal successors, (114), 5 states have internal predecessors, (114), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-22 23:52:45,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:52:45,487 INFO L93 Difference]: Finished difference Result 38316 states and 52807 transitions. [2022-07-22 23:52:45,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 23:52:45,492 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 5 states have internal predecessors, (114), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 208 [2022-07-22 23:52:45,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:52:45,546 INFO L225 Difference]: With dead ends: 38316 [2022-07-22 23:52:45,546 INFO L226 Difference]: Without dead ends: 13432 [2022-07-22 23:52:45,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-22 23:52:45,599 INFO L413 NwaCegarLoop]: 843 mSDtfsCounter, 657 mSDsluCounter, 2377 mSDsCounter, 0 mSdLazyCounter, 1611 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 3220 SdHoareTripleChecker+Invalid, 2044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 1611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-22 23:52:45,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 3220 Invalid, 2044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 1611 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-22 23:52:45,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13432 states. [2022-07-22 23:52:46,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13432 to 12493. [2022-07-22 23:52:46,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12493 states, 9477 states have (on average 1.3408251556399704) internal successors, (12707), 9738 states have internal predecessors, (12707), 1958 states have call successors, (1958), 926 states have call predecessors, (1958), 1057 states have return successors, (2524), 1965 states have call predecessors, (2524), 1957 states have call successors, (2524) [2022-07-22 23:52:46,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12493 states to 12493 states and 17189 transitions. [2022-07-22 23:52:46,202 INFO L78 Accepts]: Start accepts. Automaton has 12493 states and 17189 transitions. Word has length 208 [2022-07-22 23:52:46,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:52:46,203 INFO L495 AbstractCegarLoop]: Abstraction has 12493 states and 17189 transitions. [2022-07-22 23:52:46,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 5 states have internal predecessors, (114), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-22 23:52:46,203 INFO L276 IsEmpty]: Start isEmpty. Operand 12493 states and 17189 transitions. [2022-07-22 23:52:46,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-07-22 23:52:46,212 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:52:46,212 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 3, 3, 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] [2022-07-22 23:52:46,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-22 23:52:46,212 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:52:46,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:52:46,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1517373000, now seen corresponding path program 1 times [2022-07-22 23:52:46,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:52:46,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574516139] [2022-07-22 23:52:46,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:52:46,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:52:46,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:46,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:52:46,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:46,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:52:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:46,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:52:46,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:46,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:52:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:46,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:52:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:46,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:52:46,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:46,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:52:46,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:46,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:52:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:46,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:52:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:46,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:52:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:46,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 23:52:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:46,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 23:52:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:46,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-22 23:52:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:46,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:46,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-22 23:52:46,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:46,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-22 23:52:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:46,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:47,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:47,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:47,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 23:52:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:47,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-22 23:52:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:47,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:47,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-22 23:52:47,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:47,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-22 23:52:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:47,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:47,720 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 48 proven. 13 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2022-07-22 23:52:47,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:52:47,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574516139] [2022-07-22 23:52:47,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574516139] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 23:52:47,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694682588] [2022-07-22 23:52:47,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:52:47,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 23:52:47,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 23:52:47,722 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-22 23:52:47,724 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-22 23:52:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:48,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 1415 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-22 23:52:48,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:52:48,922 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2022-07-22 23:52:48,922 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:52:48,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694682588] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:52:48,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 23:52:48,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [33] total 41 [2022-07-22 23:52:48,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145264977] [2022-07-22 23:52:48,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:52:48,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-22 23:52:48,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:52:48,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-22 23:52:48,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1538, Unknown=0, NotChecked=0, Total=1640 [2022-07-22 23:52:48,925 INFO L87 Difference]: Start difference. First operand 12493 states and 17189 transitions. Second operand has 16 states, 15 states have (on average 8.133333333333333) internal successors, (122), 12 states have internal predecessors, (122), 3 states have call successors, (25), 2 states have call predecessors, (25), 6 states have return successors, (24), 6 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-22 23:52:50,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:52:50,417 INFO L93 Difference]: Finished difference Result 29309 states and 41475 transitions. [2022-07-22 23:52:50,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-22 23:52:50,418 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 8.133333333333333) internal successors, (122), 12 states have internal predecessors, (122), 3 states have call successors, (25), 2 states have call predecessors, (25), 6 states have return successors, (24), 6 states have call predecessors, (24), 3 states have call successors, (24) Word has length 208 [2022-07-22 23:52:50,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:52:50,479 INFO L225 Difference]: With dead ends: 29309 [2022-07-22 23:52:50,480 INFO L226 Difference]: Without dead ends: 16866 [2022-07-22 23:52:50,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 241 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=129, Invalid=1941, Unknown=0, NotChecked=0, Total=2070 [2022-07-22 23:52:50,507 INFO L413 NwaCegarLoop]: 1369 mSDtfsCounter, 375 mSDsluCounter, 17290 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 18659 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 23:52:50,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 18659 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 23:52:50,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16866 states. [2022-07-22 23:52:51,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16866 to 12583. [2022-07-22 23:52:51,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12583 states, 9543 states have (on average 1.3363722099968562) internal successors, (12753), 9801 states have internal predecessors, (12753), 1958 states have call successors, (1958), 926 states have call predecessors, (1958), 1081 states have return successors, (2556), 1992 states have call predecessors, (2556), 1957 states have call successors, (2556) [2022-07-22 23:52:51,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12583 states to 12583 states and 17267 transitions. [2022-07-22 23:52:51,326 INFO L78 Accepts]: Start accepts. Automaton has 12583 states and 17267 transitions. Word has length 208 [2022-07-22 23:52:51,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:52:51,327 INFO L495 AbstractCegarLoop]: Abstraction has 12583 states and 17267 transitions. [2022-07-22 23:52:51,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 8.133333333333333) internal successors, (122), 12 states have internal predecessors, (122), 3 states have call successors, (25), 2 states have call predecessors, (25), 6 states have return successors, (24), 6 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-22 23:52:51,327 INFO L276 IsEmpty]: Start isEmpty. Operand 12583 states and 17267 transitions. [2022-07-22 23:52:51,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-07-22 23:52:51,335 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:52:51,335 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 4, 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] [2022-07-22 23:52:51,370 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-22 23:52:51,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-22 23:52:51,552 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:52:51,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:52:51,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1833099563, now seen corresponding path program 1 times [2022-07-22 23:52:51,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:52:51,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145942249] [2022-07-22 23:52:51,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:52:51,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:52:51,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:51,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:52:51,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:51,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:52:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:51,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:52:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:51,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:52:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:51,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:52:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:51,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:52:51,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:51,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:52:51,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:51,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:52:51,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:51,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:52:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:51,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:52:51,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:51,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 23:52:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:51,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 23:52:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:51,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-22 23:52:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:51,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-22 23:52:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:51,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-22 23:52:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:51,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-22 23:52:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:51,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:51,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:51,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:51,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-22 23:52:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:51,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:51,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:51,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 23:52:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:51,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-22 23:52:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:51,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:51,889 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2022-07-22 23:52:51,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:52:51,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145942249] [2022-07-22 23:52:51,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145942249] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 23:52:51,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103759505] [2022-07-22 23:52:51,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:52:51,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 23:52:51,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 23:52:51,892 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-22 23:52:51,923 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-22 23:52:52,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:52,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 1518 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 23:52:52,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:52:52,369 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2022-07-22 23:52:52,369 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:52:52,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103759505] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:52:52,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 23:52:52,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2022-07-22 23:52:52,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718352166] [2022-07-22 23:52:52,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:52:52,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 23:52:52,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:52:52,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 23:52:52,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-22 23:52:52,371 INFO L87 Difference]: Start difference. First operand 12583 states and 17267 transitions. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 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-22 23:52:53,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:52:53,593 INFO L93 Difference]: Finished difference Result 31184 states and 42945 transitions. [2022-07-22 23:52:53,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 23:52:53,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 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 226 [2022-07-22 23:52:53,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:52:53,647 INFO L225 Difference]: With dead ends: 31184 [2022-07-22 23:52:53,647 INFO L226 Difference]: Without dead ends: 18651 [2022-07-22 23:52:53,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-07-22 23:52:53,668 INFO L413 NwaCegarLoop]: 1721 mSDtfsCounter, 1394 mSDsluCounter, 3632 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1400 SdHoareTripleChecker+Valid, 5353 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 23:52:53,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1400 Valid, 5353 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 23:52:53,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18651 states. [2022-07-22 23:52:54,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18651 to 12593. [2022-07-22 23:52:54,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12593 states, 9553 states have (on average 1.336020098398409) internal successors, (12763), 9801 states have internal predecessors, (12763), 1958 states have call successors, (1958), 926 states have call predecessors, (1958), 1081 states have return successors, (2556), 1992 states have call predecessors, (2556), 1957 states have call successors, (2556) [2022-07-22 23:52:54,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12593 states to 12593 states and 17277 transitions. [2022-07-22 23:52:54,297 INFO L78 Accepts]: Start accepts. Automaton has 12593 states and 17277 transitions. Word has length 226 [2022-07-22 23:52:54,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:52:54,298 INFO L495 AbstractCegarLoop]: Abstraction has 12593 states and 17277 transitions. [2022-07-22 23:52:54,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 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-22 23:52:54,298 INFO L276 IsEmpty]: Start isEmpty. Operand 12593 states and 17277 transitions. [2022-07-22 23:52:54,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2022-07-22 23:52:54,304 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:52:54,304 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 3, 3, 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] [2022-07-22 23:52:54,333 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-22 23:52:54,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 23:52:54,520 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:52:54,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:52:54,520 INFO L85 PathProgramCache]: Analyzing trace with hash -670216187, now seen corresponding path program 1 times [2022-07-22 23:52:54,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:52:54,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937127809] [2022-07-22 23:52:54,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:52:54,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:52:54,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:54,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:52:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:54,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:52:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:54,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:52:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:54,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:52:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:54,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:52:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:54,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:52:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:54,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:52:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:54,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:52:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:54,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:52:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:54,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:52:54,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:54,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 23:52:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:54,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 23:52:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:54,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-22 23:52:54,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:54,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:54,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:54,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-22 23:52:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:54,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-22 23:52:55,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:55,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:55,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:55,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 23:52:55,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:55,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-22 23:52:55,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:55,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-22 23:52:55,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:55,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-22 23:52:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:55,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-22 23:52:55,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:55,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:55,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:55,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-22 23:52:55,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:55,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:55,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-07-22 23:52:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:55,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:55,282 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2022-07-22 23:52:55,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:52:55,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937127809] [2022-07-22 23:52:55,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937127809] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:52:55,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:52:55,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-07-22 23:52:55,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950556133] [2022-07-22 23:52:55,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:52:55,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-22 23:52:55,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:52:55,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-22 23:52:55,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2022-07-22 23:52:55,286 INFO L87 Difference]: Start difference. First operand 12593 states and 17277 transitions. Second operand has 20 states, 20 states have (on average 6.8) internal successors, (136), 12 states have internal predecessors, (136), 5 states have call successors, (28), 7 states have call predecessors, (28), 4 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) [2022-07-22 23:53:01,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:53:01,850 INFO L93 Difference]: Finished difference Result 34036 states and 49217 transitions. [2022-07-22 23:53:01,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-22 23:53:01,851 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.8) internal successors, (136), 12 states have internal predecessors, (136), 5 states have call successors, (28), 7 states have call predecessors, (28), 4 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) Word has length 237 [2022-07-22 23:53:01,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:53:01,954 INFO L225 Difference]: With dead ends: 34036 [2022-07-22 23:53:01,955 INFO L226 Difference]: Without dead ends: 21493 [2022-07-22 23:53:01,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=859, Unknown=0, NotChecked=0, Total=992 [2022-07-22 23:53:01,995 INFO L413 NwaCegarLoop]: 1358 mSDtfsCounter, 1752 mSDsluCounter, 12764 mSDsCounter, 0 mSdLazyCounter, 7691 mSolverCounterSat, 656 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1868 SdHoareTripleChecker+Valid, 14122 SdHoareTripleChecker+Invalid, 8347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 656 IncrementalHoareTripleChecker+Valid, 7691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-07-22 23:53:01,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1868 Valid, 14122 Invalid, 8347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [656 Valid, 7691 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-07-22 23:53:02,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21493 states. [2022-07-22 23:53:02,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21493 to 12673. [2022-07-22 23:53:02,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12673 states, 9610 states have (on average 1.3340270551508846) internal successors, (12820), 9858 states have internal predecessors, (12820), 1973 states have call successors, (1973), 926 states have call predecessors, (1973), 1089 states have return successors, (2581), 2011 states have call predecessors, (2581), 1972 states have call successors, (2581) [2022-07-22 23:53:02,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12673 states to 12673 states and 17374 transitions. [2022-07-22 23:53:02,980 INFO L78 Accepts]: Start accepts. Automaton has 12673 states and 17374 transitions. Word has length 237 [2022-07-22 23:53:02,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:53:02,981 INFO L495 AbstractCegarLoop]: Abstraction has 12673 states and 17374 transitions. [2022-07-22 23:53:02,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.8) internal successors, (136), 12 states have internal predecessors, (136), 5 states have call successors, (28), 7 states have call predecessors, (28), 4 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) [2022-07-22 23:53:02,981 INFO L276 IsEmpty]: Start isEmpty. Operand 12673 states and 17374 transitions. [2022-07-22 23:53:02,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2022-07-22 23:53:02,986 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:53:02,987 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 3, 3, 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] [2022-07-22 23:53:02,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-22 23:53:02,987 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:53:02,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:53:02,987 INFO L85 PathProgramCache]: Analyzing trace with hash -944975801, now seen corresponding path program 1 times [2022-07-22 23:53:02,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:53:02,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750107273] [2022-07-22 23:53:02,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:53:02,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:53:03,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 23:53:03,797 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 23:53:04,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 23:53:04,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 23:53:04,387 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 23:53:04,389 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 23:53:04,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-22 23:53:04,394 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:53:04,398 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 23:53:04,454 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-22 23:53:04,455 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-22 23:53:04,455 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-22 23:53:04,455 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-22 23:53:04,456 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-22 23:53:04,456 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-22 23:53:04,456 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-22 23:53:04,456 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-22 23:53:04,457 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-22 23:53:04,457 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-22 23:53:04,464 WARN L418 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == dest.base && #res.offset == dest.offset; is not ensure(true) [2022-07-22 23:53:04,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 11:53:04 BoogieIcfgContainer [2022-07-22 23:53:04,659 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 23:53:04,660 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 23:53:04,660 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 23:53:04,660 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 23:53:04,661 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:51:56" (3/4) ... [2022-07-22 23:53:04,663 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-22 23:53:04,663 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 23:53:04,664 INFO L158 Benchmark]: Toolchain (without parser) took 71525.31ms. Allocated memory was 86.0MB in the beginning and 4.4GB in the end (delta: 4.3GB). Free memory was 42.4MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB. [2022-07-22 23:53:04,665 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 86.0MB. Free memory was 56.1MB in the beginning and 56.1MB in the end (delta: 21.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 23:53:04,665 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1638.84ms. Allocated memory was 86.0MB in the beginning and 184.5MB in the end (delta: 98.6MB). Free memory was 42.4MB in the beginning and 134.5MB in the end (delta: -92.0MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. [2022-07-22 23:53:04,666 INFO L158 Benchmark]: Boogie Procedure Inliner took 157.10ms. Allocated memory is still 184.5MB. Free memory was 134.5MB in the beginning and 124.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-22 23:53:04,666 INFO L158 Benchmark]: Boogie Preprocessor took 129.51ms. Allocated memory is still 184.5MB. Free memory was 124.0MB in the beginning and 113.3MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-22 23:53:04,666 INFO L158 Benchmark]: RCFGBuilder took 1698.18ms. Allocated memory is still 184.5MB. Free memory was 113.3MB in the beginning and 109.7MB in the end (delta: 3.6MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. [2022-07-22 23:53:04,666 INFO L158 Benchmark]: TraceAbstraction took 67891.04ms. Allocated memory was 184.5MB in the beginning and 4.4GB in the end (delta: 4.2GB). Free memory was 109.7MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB. [2022-07-22 23:53:04,667 INFO L158 Benchmark]: Witness Printer took 3.48ms. Allocated memory is still 4.4GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 23:53:04,673 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.20ms. Allocated memory is still 86.0MB. Free memory was 56.1MB in the beginning and 56.1MB in the end (delta: 21.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1638.84ms. Allocated memory was 86.0MB in the beginning and 184.5MB in the end (delta: 98.6MB). Free memory was 42.4MB in the beginning and 134.5MB in the end (delta: -92.0MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 157.10ms. Allocated memory is still 184.5MB. Free memory was 134.5MB in the beginning and 124.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 129.51ms. Allocated memory is still 184.5MB. Free memory was 124.0MB in the beginning and 113.3MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1698.18ms. Allocated memory is still 184.5MB. Free memory was 113.3MB in the beginning and 109.7MB in the end (delta: 3.6MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. * TraceAbstraction took 67891.04ms. Allocated memory was 184.5MB in the beginning and 4.4GB in the end (delta: 4.2GB). Free memory was 109.7MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB. * Witness Printer took 3.48ms. Allocated memory is still 4.4GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == dest.base && #res.offset == dest.offset; is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 5666]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of large string literal at line 5775, overapproximation of bitwiseOr at line 5315, overapproximation of bitwiseAnd at line 6430. Possible FailurePath: [L5689] int LDV_IN_INTERRUPT = 1; [L5690] int ldv_state_variable_2 ; [L5691] struct ppp_channel *sync_ops_group0 ; [L5692] int ref_cnt ; [L5693] int ldv_state_variable_1 ; [L5694] int ldv_state_variable_0 ; [L5695] struct tty_struct *ppp_sync_ldisc_group1 ; [L5751] static struct ppp_channel_ops const sync_ops = {& ppp_sync_send, & ppp_sync_ioctl}; [L5775-L5776] static rwlock_t disc_data_lock = {{{0}, {{0U}}}, 3736018669U, 4294967295U, (void *)-1, {0, {0, 0}, "disc_data_lock", 0, 0UL}}; [L6096-L6099] static struct tty_ldisc_ops ppp_sync_ldisc = {21507, (char *)"pppsync", 0, 0, & ppp_sync_open, & ppp_sync_close, 0, 0, & ppp_sync_read, & ppp_sync_write, & ppp_synctty_ioctl, 0, 0, & ppp_sync_poll, & ppp_sync_hangup, & ppp_sync_receive, & ppp_sync_wakeup, 0, 0, 0, & __this_module, 0}; [L6637] int ldv_retval_0 ; [L6638] int ldv_retval_1 ; [L7012] Element set_impl[15] ; [L7013] int last_index = 0; [L7147] Set LDV_SKBS ; VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L6661] size_t ldvarg11 ; [L6662] size_t tmp ; [L6663] struct file *ldvarg7 ; [L6664] void *tmp___0 ; [L6665] int ldvarg3 ; [L6666] int tmp___1 ; [L6667] unsigned long ldvarg0 ; [L6668] unsigned long tmp___2 ; [L6669] unsigned char *ldvarg12 ; [L6670] void *tmp___3 ; [L6671] unsigned char *ldvarg5 ; [L6672] void *tmp___4 ; [L6673] struct poll_table_struct *ldvarg6 ; [L6674] void *tmp___5 ; [L6675] size_t ldvarg8 ; [L6676] size_t tmp___6 ; [L6677] unsigned int ldvarg1 ; [L6678] unsigned int tmp___7 ; [L6679] char *ldvarg4 ; [L6680] void *tmp___8 ; [L6681] struct file *ldvarg13 ; [L6682] void *tmp___9 ; [L6683] struct file *ldvarg10 ; [L6684] void *tmp___10 ; [L6685] unsigned char *ldvarg9 ; [L6686] void *tmp___11 ; [L6687] struct file *ldvarg2 ; [L6688] void *tmp___12 ; [L6689] unsigned long ldvarg14 ; [L6690] unsigned long tmp___13 ; [L6691] struct sk_buff *ldvarg16 ; [L6692] void *tmp___14 ; [L6693] unsigned int ldvarg15 ; [L6694] unsigned int tmp___15 ; [L6695] int tmp___16 ; [L6696] int tmp___17 ; [L6697] int tmp___18 ; [L6698] int tmp___19 ; [L6700] tmp = __VERIFIER_nondet_size_t() [L6701] ldvarg11 = tmp VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg11=0, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=0] [L6702] CALL, EXPR ldv_zalloc(512UL) VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L5631] void *p ; [L5632] void *tmp ; [L5633] int tmp___0 ; [L5635] tmp___0 = __VERIFIER_nondet_int() [L5636] COND TRUE tmp___0 != 0 [L5637] return ((void *)0); VAL [\old(size)=512, \result={0:0}, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, size=512, sync_ops={21:0}, sync_ops_group0={0:0}, tmp___0=1] [L6702] RET, EXPR ldv_zalloc(512UL) VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_zalloc(512UL)={0:0}, ldvarg11=0, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=0] [L6702] tmp___0 = ldv_zalloc(512UL) [L6703] ldvarg7 = (struct file *)tmp___0 [L6704] tmp___1 = __VERIFIER_nondet_int() [L6705] ldvarg3 = tmp___1 [L6706] tmp___2 = __VERIFIER_nondet_ulong() [L6707] ldvarg0 = tmp___2 VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0=8589934607, ldvarg11=0, ldvarg3=-2, ldvarg7={0:0}, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=0, tmp___0={0:0}, tmp___1=-2, tmp___2=8589934607] [L6708] CALL, EXPR ldv_zalloc(1UL) VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L5631] void *p ; [L5632] void *tmp ; [L5633] int tmp___0 ; [L5635] tmp___0 = __VERIFIER_nondet_int() [L5636] COND TRUE tmp___0 != 0 [L5637] return ((void *)0); VAL [\old(size)=1, \result={0:0}, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, size=1, sync_ops={21:0}, sync_ops_group0={0:0}, tmp___0=1] [L6708] RET, EXPR ldv_zalloc(1UL) VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_zalloc(1UL)={0:0}, ldvarg0=8589934607, ldvarg11=0, ldvarg3=-2, ldvarg7={0:0}, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=0, tmp___0={0:0}, tmp___1=-2, tmp___2=8589934607] [L6708] tmp___3 = ldv_zalloc(1UL) [L6709] ldvarg12 = (unsigned char *)tmp___3 VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0=8589934607, ldvarg11=0, ldvarg12={0:0}, ldvarg3=-2, ldvarg7={0:0}, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=0, tmp___0={0:0}, tmp___1=-2, tmp___2=8589934607, tmp___3={0:0}] [L6710] CALL, EXPR ldv_zalloc(1UL) VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L5631] void *p ; [L5632] void *tmp ; [L5633] int tmp___0 ; [L5635] tmp___0 = __VERIFIER_nondet_int() [L5636] COND TRUE tmp___0 != 0 [L5637] return ((void *)0); VAL [\old(size)=1, \result={0:0}, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, size=1, sync_ops={21:0}, sync_ops_group0={0:0}, tmp___0=1] [L6710] RET, EXPR ldv_zalloc(1UL) VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_zalloc(1UL)={0:0}, ldvarg0=8589934607, ldvarg11=0, ldvarg12={0:0}, ldvarg3=-2, ldvarg7={0:0}, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=0, tmp___0={0:0}, tmp___1=-2, tmp___2=8589934607, tmp___3={0:0}] [L6710] tmp___4 = ldv_zalloc(1UL) [L6711] ldvarg5 = (unsigned char *)tmp___4 VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0=8589934607, ldvarg11=0, ldvarg12={0:0}, ldvarg3=-2, ldvarg5={0:0}, ldvarg7={0:0}, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=0, tmp___0={0:0}, tmp___1=-2, tmp___2=8589934607, tmp___3={0:0}, tmp___4={0:0}] [L6712] CALL, EXPR ldv_zalloc(16UL) VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L5631] void *p ; [L5632] void *tmp ; [L5633] int tmp___0 ; [L5635] tmp___0 = __VERIFIER_nondet_int() [L5636] COND TRUE tmp___0 != 0 [L5637] return ((void *)0); VAL [\old(size)=16, \result={0:0}, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, size=16, sync_ops={21:0}, sync_ops_group0={0:0}, tmp___0=1] [L6712] RET, EXPR ldv_zalloc(16UL) VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_zalloc(16UL)={0:0}, ldvarg0=8589934607, ldvarg11=0, ldvarg12={0:0}, ldvarg3=-2, ldvarg5={0:0}, ldvarg7={0:0}, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=0, tmp___0={0:0}, tmp___1=-2, tmp___2=8589934607, tmp___3={0:0}, tmp___4={0:0}] [L6712] tmp___5 = ldv_zalloc(16UL) [L6713] ldvarg6 = (struct poll_table_struct *)tmp___5 [L6714] tmp___6 = __VERIFIER_nondet_size_t() [L6715] ldvarg8 = tmp___6 [L6716] tmp___7 = __VERIFIER_nondet_uint() [L6717] ldvarg1 = tmp___7 VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0=8589934607, ldvarg1=13, ldvarg11=0, ldvarg12={0:0}, ldvarg3=-2, ldvarg5={0:0}, ldvarg6={0:0}, ldvarg7={0:0}, ldvarg8=0, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=0, tmp___0={0:0}, tmp___1=-2, tmp___2=8589934607, tmp___3={0:0}, tmp___4={0:0}, tmp___5={0:0}, tmp___6=0, tmp___7=13] [L6718] CALL, EXPR ldv_zalloc(1UL) VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L5631] void *p ; [L5632] void *tmp ; [L5633] int tmp___0 ; [L5635] tmp___0 = __VERIFIER_nondet_int() [L5636] COND TRUE tmp___0 != 0 [L5637] return ((void *)0); VAL [\old(size)=1, \result={0:0}, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, size=1, sync_ops={21:0}, sync_ops_group0={0:0}, tmp___0=1] [L6718] RET, EXPR ldv_zalloc(1UL) VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_zalloc(1UL)={0:0}, ldvarg0=8589934607, ldvarg1=13, ldvarg11=0, ldvarg12={0:0}, ldvarg3=-2, ldvarg5={0:0}, ldvarg6={0:0}, ldvarg7={0:0}, ldvarg8=0, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=0, tmp___0={0:0}, tmp___1=-2, tmp___2=8589934607, tmp___3={0:0}, tmp___4={0:0}, tmp___5={0:0}, tmp___6=0, tmp___7=13] [L6718] tmp___8 = ldv_zalloc(1UL) [L6719] ldvarg4 = (char *)tmp___8 VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0=8589934607, ldvarg1=13, ldvarg11=0, ldvarg12={0:0}, ldvarg3=-2, ldvarg4={0:0}, ldvarg5={0:0}, ldvarg6={0:0}, ldvarg7={0:0}, ldvarg8=0, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=0, tmp___0={0:0}, tmp___1=-2, tmp___2=8589934607, tmp___3={0:0}, tmp___4={0:0}, tmp___5={0:0}, tmp___6=0, tmp___7=13, tmp___8={0:0}] [L6720] CALL, EXPR ldv_zalloc(512UL) VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L5631] void *p ; [L5632] void *tmp ; [L5633] int tmp___0 ; [L5635] tmp___0 = __VERIFIER_nondet_int() [L5636] COND TRUE tmp___0 != 0 [L5637] return ((void *)0); VAL [\old(size)=512, \result={0:0}, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, size=512, sync_ops={21:0}, sync_ops_group0={0:0}, tmp___0=1] [L6720] RET, EXPR ldv_zalloc(512UL) VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_zalloc(512UL)={0:0}, ldvarg0=8589934607, ldvarg1=13, ldvarg11=0, ldvarg12={0:0}, ldvarg3=-2, ldvarg4={0:0}, ldvarg5={0:0}, ldvarg6={0:0}, ldvarg7={0:0}, ldvarg8=0, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=0, tmp___0={0:0}, tmp___1=-2, tmp___2=8589934607, tmp___3={0:0}, tmp___4={0:0}, tmp___5={0:0}, tmp___6=0, tmp___7=13, tmp___8={0:0}] [L6720] tmp___9 = ldv_zalloc(512UL) [L6721] ldvarg13 = (struct file *)tmp___9 VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0=8589934607, ldvarg1=13, ldvarg11=0, ldvarg12={0:0}, ldvarg13={0:0}, ldvarg3=-2, ldvarg4={0:0}, ldvarg5={0:0}, ldvarg6={0:0}, ldvarg7={0:0}, ldvarg8=0, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=0, tmp___0={0:0}, tmp___1=-2, tmp___2=8589934607, tmp___3={0:0}, tmp___4={0:0}, tmp___5={0:0}, tmp___6=0, tmp___7=13, tmp___8={0:0}, tmp___9={0:0}] [L6722] CALL, EXPR ldv_zalloc(512UL) VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L5631] void *p ; [L5632] void *tmp ; [L5633] int tmp___0 ; [L5635] tmp___0 = __VERIFIER_nondet_int() [L5636] COND TRUE tmp___0 != 0 [L5637] return ((void *)0); VAL [\old(size)=512, \result={0:0}, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, size=512, sync_ops={21:0}, sync_ops_group0={0:0}, tmp___0=1] [L6722] RET, EXPR ldv_zalloc(512UL) VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_zalloc(512UL)={0:0}, ldvarg0=8589934607, ldvarg1=13, ldvarg11=0, ldvarg12={0:0}, ldvarg13={0:0}, ldvarg3=-2, ldvarg4={0:0}, ldvarg5={0:0}, ldvarg6={0:0}, ldvarg7={0:0}, ldvarg8=0, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=0, tmp___0={0:0}, tmp___1=-2, tmp___2=8589934607, tmp___3={0:0}, tmp___4={0:0}, tmp___5={0:0}, tmp___6=0, tmp___7=13, tmp___8={0:0}, tmp___9={0:0}] [L6722] tmp___10 = ldv_zalloc(512UL) [L6723] ldvarg10 = (struct file *)tmp___10 VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0=8589934607, ldvarg1=13, ldvarg10={0:0}, ldvarg11=0, ldvarg12={0:0}, ldvarg13={0:0}, ldvarg3=-2, ldvarg4={0:0}, ldvarg5={0:0}, ldvarg6={0:0}, ldvarg7={0:0}, ldvarg8=0, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=0, tmp___0={0:0}, tmp___1=-2, tmp___10={0:0}, tmp___2=8589934607, tmp___3={0:0}, tmp___4={0:0}, tmp___5={0:0}, tmp___6=0, tmp___7=13, tmp___8={0:0}, tmp___9={0:0}] [L6724] CALL, EXPR ldv_zalloc(1UL) VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L5631] void *p ; [L5632] void *tmp ; [L5633] int tmp___0 ; [L5635] tmp___0 = __VERIFIER_nondet_int() [L5636] COND TRUE tmp___0 != 0 [L5637] return ((void *)0); VAL [\old(size)=1, \result={0:0}, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, size=1, sync_ops={21:0}, sync_ops_group0={0:0}, tmp___0=1] [L6724] RET, EXPR ldv_zalloc(1UL) VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_zalloc(1UL)={0:0}, ldvarg0=8589934607, ldvarg1=13, ldvarg10={0:0}, ldvarg11=0, ldvarg12={0:0}, ldvarg13={0:0}, ldvarg3=-2, ldvarg4={0:0}, ldvarg5={0:0}, ldvarg6={0:0}, ldvarg7={0:0}, ldvarg8=0, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=0, tmp___0={0:0}, tmp___1=-2, tmp___10={0:0}, tmp___2=8589934607, tmp___3={0:0}, tmp___4={0:0}, tmp___5={0:0}, tmp___6=0, tmp___7=13, tmp___8={0:0}, tmp___9={0:0}] [L6724] tmp___11 = ldv_zalloc(1UL) [L6725] ldvarg9 = (unsigned char *)tmp___11 VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0=8589934607, ldvarg1=13, ldvarg10={0:0}, ldvarg11=0, ldvarg12={0:0}, ldvarg13={0:0}, ldvarg3=-2, ldvarg4={0:0}, ldvarg5={0:0}, ldvarg6={0:0}, ldvarg7={0:0}, ldvarg8=0, ldvarg9={0:0}, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=0, tmp___0={0:0}, tmp___1=-2, tmp___10={0:0}, tmp___11={0:0}, tmp___2=8589934607, tmp___3={0:0}, tmp___4={0:0}, tmp___5={0:0}, tmp___6=0, tmp___7=13, tmp___8={0:0}, tmp___9={0:0}] [L6726] CALL, EXPR ldv_zalloc(512UL) VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L5631] void *p ; [L5632] void *tmp ; [L5633] int tmp___0 ; [L5635] tmp___0 = __VERIFIER_nondet_int() [L5636] COND TRUE tmp___0 != 0 [L5637] return ((void *)0); VAL [\old(size)=512, \result={0:0}, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, size=512, sync_ops={21:0}, sync_ops_group0={0:0}, tmp___0=1] [L6726] RET, EXPR ldv_zalloc(512UL) VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_zalloc(512UL)={0:0}, ldvarg0=8589934607, ldvarg1=13, ldvarg10={0:0}, ldvarg11=0, ldvarg12={0:0}, ldvarg13={0:0}, ldvarg3=-2, ldvarg4={0:0}, ldvarg5={0:0}, ldvarg6={0:0}, ldvarg7={0:0}, ldvarg8=0, ldvarg9={0:0}, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=0, tmp___0={0:0}, tmp___1=-2, tmp___10={0:0}, tmp___11={0:0}, tmp___2=8589934607, tmp___3={0:0}, tmp___4={0:0}, tmp___5={0:0}, tmp___6=0, tmp___7=13, tmp___8={0:0}, tmp___9={0:0}] [L6726] tmp___12 = ldv_zalloc(512UL) [L6727] ldvarg2 = (struct file *)tmp___12 [L6728] tmp___13 = __VERIFIER_nondet_ulong() [L6729] ldvarg14 = tmp___13 VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0=8589934607, ldvarg1=13, ldvarg10={0:0}, ldvarg11=0, ldvarg12={0:0}, ldvarg13={0:0}, ldvarg14=8589934595, ldvarg2={0:0}, ldvarg3=-2, ldvarg4={0:0}, ldvarg5={0:0}, ldvarg6={0:0}, ldvarg7={0:0}, ldvarg8=0, ldvarg9={0:0}, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=0, tmp___0={0:0}, tmp___1=-2, tmp___10={0:0}, tmp___11={0:0}, tmp___12={0:0}, tmp___13=8589934595, tmp___2=8589934607, tmp___3={0:0}, tmp___4={0:0}, tmp___5={0:0}, tmp___6=0, tmp___7=13, tmp___8={0:0}, tmp___9={0:0}] [L6730] CALL, EXPR ldv_zalloc(232UL) VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L5631] void *p ; [L5632] void *tmp ; [L5633] int tmp___0 ; [L5635] tmp___0 = __VERIFIER_nondet_int() [L5636] COND TRUE tmp___0 != 0 [L5637] return ((void *)0); VAL [\old(size)=232, \result={0:0}, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, size=232, sync_ops={21:0}, sync_ops_group0={0:0}, tmp___0=1] [L6730] RET, EXPR ldv_zalloc(232UL) VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_zalloc(232UL)={0:0}, ldvarg0=8589934607, ldvarg1=13, ldvarg10={0:0}, ldvarg11=0, ldvarg12={0:0}, ldvarg13={0:0}, ldvarg14=8589934595, ldvarg2={0:0}, ldvarg3=-2, ldvarg4={0:0}, ldvarg5={0:0}, ldvarg6={0:0}, ldvarg7={0:0}, ldvarg8=0, ldvarg9={0:0}, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=0, tmp___0={0:0}, tmp___1=-2, tmp___10={0:0}, tmp___11={0:0}, tmp___12={0:0}, tmp___13=8589934595, tmp___2=8589934607, tmp___3={0:0}, tmp___4={0:0}, tmp___5={0:0}, tmp___6=0, tmp___7=13, tmp___8={0:0}, tmp___9={0:0}] [L6730] tmp___14 = ldv_zalloc(232UL) [L6731] ldvarg16 = (struct sk_buff *)tmp___14 [L6732] tmp___15 = __VERIFIER_nondet_uint() [L6733] ldvarg15 = tmp___15 [L6734] CALL ldv_initialize() [L7166] CALL ldv_set_init(LDV_SKBS) [L7018] set = set_impl [L7019] last_index = 0 VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set={24:0}, set={0:0}, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L7166] RET ldv_set_init(LDV_SKBS) [L6734] RET ldv_initialize() [L6735] ldv_state_variable_1 = 0 [L6736] ref_cnt = 0 [L6737] ldv_state_variable_0 = 1 [L6738] ldv_state_variable_2 = 0 VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0=8589934607, ldvarg1=13, ldvarg10={0:0}, ldvarg11=0, ldvarg12={0:0}, ldvarg13={0:0}, ldvarg14=8589934595, ldvarg15=4294967292, ldvarg16={0:0}, ldvarg2={0:0}, ldvarg3=-2, ldvarg4={0:0}, ldvarg5={0:0}, ldvarg6={0:0}, ldvarg7={0:0}, ldvarg8=0, ldvarg9={0:0}, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=0, tmp___0={0:0}, tmp___1=-2, tmp___10={0:0}, tmp___11={0:0}, tmp___12={0:0}, tmp___13=8589934595, tmp___14={0:0}, tmp___15=4294967292, tmp___2=8589934607, tmp___3={0:0}, tmp___4={0:0}, tmp___5={0:0}, tmp___6=0, tmp___7=13, tmp___8={0:0}, tmp___9={0:0}] [L6740] tmp___16 = __VERIFIER_nondet_int() [L6742] case 0: [L6838] case 1: VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0=8589934607, ldvarg1=13, ldvarg10={0:0}, ldvarg11=0, ldvarg12={0:0}, ldvarg13={0:0}, ldvarg14=8589934595, ldvarg15=4294967292, ldvarg16={0:0}, ldvarg2={0:0}, ldvarg3=-2, ldvarg4={0:0}, ldvarg5={0:0}, ldvarg6={0:0}, ldvarg7={0:0}, ldvarg8=0, ldvarg9={0:0}, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=0, tmp___0={0:0}, tmp___1=-2, tmp___10={0:0}, tmp___11={0:0}, tmp___12={0:0}, tmp___13=8589934595, tmp___14={0:0}, tmp___15=4294967292, tmp___16=1, tmp___2=8589934607, tmp___3={0:0}, tmp___4={0:0}, tmp___5={0:0}, tmp___6=0, tmp___7=13, tmp___8={0:0}, tmp___9={0:0}] [L6839] COND TRUE ldv_state_variable_0 != 0 [L6840] tmp___18 = __VERIFIER_nondet_int() [L6842] case 0: [L6850] case 1: VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0=8589934607, ldvarg1=13, ldvarg10={0:0}, ldvarg11=0, ldvarg12={0:0}, ldvarg13={0:0}, ldvarg14=8589934595, ldvarg15=4294967292, ldvarg16={0:0}, ldvarg2={0:0}, ldvarg3=-2, ldvarg4={0:0}, ldvarg5={0:0}, ldvarg6={0:0}, ldvarg7={0:0}, ldvarg8=0, ldvarg9={0:0}, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=0, tmp___0={0:0}, tmp___1=-2, tmp___10={0:0}, tmp___11={0:0}, tmp___12={0:0}, tmp___13=8589934595, tmp___14={0:0}, tmp___15=4294967292, tmp___16=1, tmp___18=1, tmp___2=8589934607, tmp___3={0:0}, tmp___4={0:0}, tmp___5={0:0}, tmp___6=0, tmp___7=13, tmp___8={0:0}, tmp___9={0:0}] [L6851] COND TRUE ldv_state_variable_0 == 1 [L6852] CALL, EXPR ppp_sync_init() [L6102] int err ; [L6104] CALL, EXPR tty_register_ldisc(14, & ppp_sync_ldisc) [L7358] return __VERIFIER_nondet_int(); [L6104] RET, EXPR tty_register_ldisc(14, & ppp_sync_ldisc) [L6104] err = tty_register_ldisc(14, & ppp_sync_ldisc) [L6105] COND FALSE !(err != 0) VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, err=0, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L6109] return (err); VAL [\result=0, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, err=0, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L6852] RET, EXPR ppp_sync_init() [L6852] ldv_retval_1 = ppp_sync_init() [L6853] COND TRUE ldv_retval_1 == 0 [L6854] ldv_state_variable_0 = 3 [L6855] ldv_state_variable_2 = 1 [L6856] CALL ldv_initialize_ppp_channel_ops_2() [L6643] void *tmp ; VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=0, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L6645] CALL, EXPR ldv_zalloc(40UL) VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=0, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L5631] void *p ; [L5632] void *tmp ; [L5633] int tmp___0 ; [L5635] tmp___0 = __VERIFIER_nondet_int() [L5636] COND TRUE tmp___0 != 0 [L5637] return ((void *)0); VAL [\old(size)=40, \result={0:0}, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=0, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, size=40, sync_ops={21:0}, sync_ops_group0={0:0}, tmp___0=1] [L6645] RET, EXPR ldv_zalloc(40UL) VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=0, ldv_state_variable_2=1, ldv_zalloc(40UL)={0:0}, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L6645] tmp = ldv_zalloc(40UL) [L6646] sync_ops_group0 = (struct ppp_channel *)tmp VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=0, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp={0:0}] [L6856] RET ldv_initialize_ppp_channel_ops_2() [L6857] ldv_state_variable_1 = 1 [L6858] CALL ldv_target_type_1() [L6652] void *tmp ; VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L6654] CALL, EXPR ldv_zalloc(1752UL) VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L5631] void *p ; [L5632] void *tmp ; [L5633] int tmp___0 ; [L5635] tmp___0 = __VERIFIER_nondet_int() [L5636] COND TRUE tmp___0 != 0 [L5637] return ((void *)0); VAL [\old(size)=1752, \result={0:0}, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, size=1752, sync_ops={21:0}, sync_ops_group0={0:0}, tmp___0=1] [L6654] RET, EXPR ldv_zalloc(1752UL) VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_zalloc(1752UL)={0:0}, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L6654] tmp = ldv_zalloc(1752UL) [L6655] ppp_sync_ldisc_group1 = (struct tty_struct *)tmp VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp={0:0}] [L6858] RET ldv_target_type_1() [L6861] COND FALSE !(ldv_retval_1 != 0) VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0=8589934607, ldvarg1=13, ldvarg10={0:0}, ldvarg11=0, ldvarg12={0:0}, ldvarg13={0:0}, ldvarg14=8589934595, ldvarg15=4294967292, ldvarg16={0:0}, ldvarg2={0:0}, ldvarg3=-2, ldvarg4={0:0}, ldvarg5={0:0}, ldvarg6={0:0}, ldvarg7={0:0}, ldvarg8=0, ldvarg9={0:0}, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=0, tmp___0={0:0}, tmp___1=-2, tmp___10={0:0}, tmp___11={0:0}, tmp___12={0:0}, tmp___13=8589934595, tmp___14={0:0}, tmp___15=4294967292, tmp___16=1, tmp___18=1, tmp___2=8589934607, tmp___3={0:0}, tmp___4={0:0}, tmp___5={0:0}, tmp___6=0, tmp___7=13, tmp___8={0:0}, tmp___9={0:0}] [L6740] tmp___16 = __VERIFIER_nondet_int() [L6742] case 0: [L6838] case 1: [L6876] case 2: VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0=8589934607, ldvarg1=13, ldvarg10={0:0}, ldvarg11=0, ldvarg12={0:0}, ldvarg13={0:0}, ldvarg14=8589934595, ldvarg15=4294967292, ldvarg16={0:0}, ldvarg2={0:0}, ldvarg3=-2, ldvarg4={0:0}, ldvarg5={0:0}, ldvarg6={0:0}, ldvarg7={0:0}, ldvarg8=0, ldvarg9={0:0}, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=0, tmp___0={0:0}, tmp___1=-2, tmp___10={0:0}, tmp___11={0:0}, tmp___12={0:0}, tmp___13=8589934595, tmp___14={0:0}, tmp___15=4294967292, tmp___16=2, tmp___18=1, tmp___2=8589934607, tmp___3={0:0}, tmp___4={0:0}, tmp___5={0:0}, tmp___6=0, tmp___7=13, tmp___8={0:0}, tmp___9={0:0}] [L6877] COND TRUE ldv_state_variable_2 != 0 [L6878] tmp___19 = __VERIFIER_nondet_int() [L6880] case 0: VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0=8589934607, ldvarg1=13, ldvarg10={0:0}, ldvarg11=0, ldvarg12={0:0}, ldvarg13={0:0}, ldvarg14=8589934595, ldvarg15=4294967292, ldvarg16={0:0}, ldvarg2={0:0}, ldvarg3=-2, ldvarg4={0:0}, ldvarg5={0:0}, ldvarg6={0:0}, ldvarg7={0:0}, ldvarg8=0, ldvarg9={0:0}, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=0, tmp___0={0:0}, tmp___1=-2, tmp___10={0:0}, tmp___11={0:0}, tmp___12={0:0}, tmp___13=8589934595, tmp___14={0:0}, tmp___15=4294967292, tmp___16=2, tmp___18=1, tmp___19=0, tmp___2=8589934607, tmp___3={0:0}, tmp___4={0:0}, tmp___5={0:0}, tmp___6=0, tmp___7=13, tmp___8={0:0}, tmp___9={0:0}] [L6881] COND TRUE ldv_state_variable_2 == 1 [L6882] CALL ppp_sync_send(sync_ops_group0, ldvarg16) [L6439] struct syncppp *ap ; [L6440] int tmp ; [L6442] EXPR chan->private [L6442] ap = (struct syncppp *)chan->private [L6443] CALL ppp_sync_push(ap) VAL [\old(last_index)=0, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L6461] int sent ; [L6462] int done ; [L6463] struct tty_struct *tty ; [L6464] int tty_stuffed ; [L6465] int tmp ; [L6466] int tmp___0 ; [L6467] int tmp___1 ; [L6468] int tmp___2 ; [L6470] done = 0 [L6471] EXPR ap->tty [L6471] tty = ap->tty [L6472] tty_stuffed = 0 VAL [\old(last_index)=0, __this_module={8589934597:8589934603}, ap={24:0}, ap={24:0}, disc_data_lock={22:0}, done=0, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tty={0:0}, tty_stuffed=0] [L6473] CALL, EXPR spin_trylock_bh(& ap->xmit_lock) VAL [\old(last_index)=0, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L5417] int tmp ; [L5419] CALL, EXPR _raw_spin_trylock_bh(& lock->ldv_6338.rlock) [L7268] return __VERIFIER_nondet_int(); [L5419] RET, EXPR _raw_spin_trylock_bh(& lock->ldv_6338.rlock) [L5419] tmp = _raw_spin_trylock_bh(& lock->ldv_6338.rlock) [L5420] return (tmp); VAL [\old(last_index)=0, \result=0, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, lock={24:20}, lock={24:20}, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=0] [L6473] RET, EXPR spin_trylock_bh(& ap->xmit_lock) VAL [\old(last_index)=0, __this_module={8589934597:8589934603}, ap={24:0}, ap={24:0}, disc_data_lock={22:0}, done=0, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, spin_trylock_bh(& ap->xmit_lock)=0, sync_ops={21:0}, sync_ops_group0={0:0}, tty={0:0}, tty_stuffed=0] [L6473] tmp = spin_trylock_bh(& ap->xmit_lock) [L6474] COND TRUE tmp == 0 [L6475] return (0); VAL [\old(last_index)=0, \result=0, __this_module={8589934597:8589934603}, ap={24:0}, ap={24:0}, disc_data_lock={22:0}, done=0, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=0, tty={0:0}, tty_stuffed=0] [L6443] RET ppp_sync_push(ap) VAL [__this_module={8589934597:8589934603}, ap={24:0}, chan={0:0}, chan={0:0}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ppp_sync_push(ap)=0, ref_cnt=0, set_impl={24:0}, skb={0:0}, skb={0:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L6444] CALL, EXPR test_and_set_bit(1L, (unsigned long volatile *)(& ap->xmit_flags)) VAL [\old(nr)=1, __this_module={8589934597:8589934603}, addr={24:156}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L5290] char c ; [L5294] return ((int )((signed char )c) != 0); VAL [\old(nr)=1, \result=0, __this_module={8589934597:8589934603}, addr={24:156}, addr={24:156}, c=0, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, nr=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L6444] RET, EXPR test_and_set_bit(1L, (unsigned long volatile *)(& ap->xmit_flags)) VAL [__this_module={8589934597:8589934603}, ap={24:0}, chan={0:0}, chan={0:0}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, skb={0:0}, skb={0:0}, sync_ops={21:0}, sync_ops_group0={0:0}, test_and_set_bit(1L, (unsigned long volatile *)(& ap->xmit_flags))=0] [L6444] tmp = test_and_set_bit(1L, (unsigned long volatile *)(& ap->xmit_flags)) [L6445] COND FALSE !(tmp != 0) [L6449] CALL, EXPR ppp_sync_txmunge(ap, skb) [L6390] int proto ; [L6391] unsigned char *data ; [L6392] int islcp ; [L6393] u16 tmp ; [L6394] struct sk_buff *npkt ; [L6395] struct sk_buff *tmp___0 ; [L6396] unsigned char *tmp___1 ; [L6397] unsigned int tmp___2 ; [L6399] EXPR skb->data [L6399] data = skb->data [L6400] CALL, EXPR get_unaligned_be16((void const *)data) [L5737] __u16 tmp ; [L5739] CALL, EXPR __be16_to_cpup((__be16 const *)p) [L5328] __u16 tmp ; [L5330] CALL, EXPR __swab16p(p) [L5320] __u16 tmp ; [L5322] EXPR \read(*p) [L5322] CALL, EXPR __fswab16((int )*p) [L5315] return ((__u16 )((int )((short )((int )val << 8)) | (int )((short )((int )val >> 8)))); VAL [\old(val)=6656, \result=-81887, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, val=6656] [L5322] RET, EXPR __fswab16((int )*p) [L5322] tmp = __fswab16((int )*p) [L5323] return (tmp); VAL [\result=-81887, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, p={1:55}, p={1:55}, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=49185] [L5330] RET, EXPR __swab16p(p) [L5330] tmp = __swab16p(p) [L5331] return (tmp); VAL [\result=-81887, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, p={1:55}, p={1:55}, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=49185] [L5739] RET, EXPR __be16_to_cpup((__be16 const *)p) [L5739] tmp = __be16_to_cpup((__be16 const *)p) [L5740] return (tmp); VAL [\result=-81887, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, p={1:55}, p={1:55}, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=49185] [L6400] RET, EXPR get_unaligned_be16((void const *)data) [L6400] tmp = get_unaligned_be16((void const *)data) [L6401] proto = (int )tmp [L6402] EXPR proto == 49185 && (unsigned int )*(data + 2UL) != 0U [L6402] EXPR data + 2UL [L6402] EXPR proto == 49185 && (unsigned int )*(data + 2UL) != 0U VAL [__this_module={8589934597:8589934603}, ap={24:0}, ap={24:0}, data={1:55}, data + 2UL=-249, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, proto=49185, proto == 49185 && (unsigned int )*(data + 2UL) != 0U=1, ref_cnt=0, set_impl={24:0}, skb={0:0}, skb={0:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=49185] [L6402] EXPR (proto == 49185 && (unsigned int )*(data + 2UL) != 0U) && (unsigned int )*(data + 2UL) <= 7U [L6402] EXPR data + 2UL [L6402] EXPR (proto == 49185 && (unsigned int )*(data + 2UL) != 0U) && (unsigned int )*(data + 2UL) <= 7U VAL [(proto == 49185 && (unsigned int )*(data + 2UL) != 0U) && (unsigned int )*(data + 2UL) <= 7U=1, __this_module={8589934597:8589934603}, ap={24:0}, ap={24:0}, data={1:55}, data + 2UL=-249, data + 2UL=-249, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, proto=49185, proto == 49185 && (unsigned int )*(data + 2UL) != 0U=1, ref_cnt=0, set_impl={24:0}, skb={0:0}, skb={0:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=49185] [L6402] islcp = (proto == 49185 && (unsigned int )*(data + 2UL) != 0U) && (unsigned int )*(data + 2UL) <= 7U [L6403] EXPR \read(*data) [L6403] EXPR (unsigned int )*data == 0U && (int )ap->flags & 1 [L6403] EXPR ap->flags [L6403] EXPR (unsigned int )*data == 0U && (int )ap->flags & 1 VAL [(unsigned int )*data == 0U && (int )ap->flags & 1=1, \read(*data)=-58880, __this_module={8589934597:8589934603}, ap={24:0}, ap={24:0}, ap->flags=8589934587, data={1:55}, disc_data_lock={22:0}, islcp=1, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, proto=49185, ref_cnt=0, set_impl={24:0}, skb={0:0}, skb={0:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=49185] [L6403] COND FALSE !(((unsigned int )*data == 0U && (int )ap->flags & 1) && islcp == 0) [L6407] EXPR ap->flags VAL [__this_module={8589934597:8589934603}, ap={24:0}, ap={24:0}, ap->flags=8589934587, data={1:55}, disc_data_lock={22:0}, islcp=1, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, proto=49185, ref_cnt=0, set_impl={24:0}, skb={0:0}, skb={0:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=49185] [L6407] COND TRUE (ap->flags & 2U) == 0U || islcp != 0 [L6408] CALL, EXPR skb_headroom((struct sk_buff const *)skb) [L5565] EXPR skb->data [L5565] EXPR skb->head [L5565] return ((unsigned int )((long )skb->data) - (unsigned int )((long )skb->head)); [L6408] RET, EXPR skb_headroom((struct sk_buff const *)skb) [L6408] tmp___2 = skb_headroom((struct sk_buff const *)skb) [L6409] COND TRUE tmp___2 <= 1U [L6410] EXPR skb->len VAL [__this_module={8589934597:8589934603}, ap={24:0}, ap={24:0}, data={1:55}, disc_data_lock={22:0}, islcp=1, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, proto=49185, ref_cnt=0, set_impl={24:0}, skb={0:0}, skb={0:0}, skb->len=4294967296, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=49185, tmp___2=0] [L6410] CALL, EXPR ldv_dev_alloc_skb_15(skb->len + 2U) VAL [\old(last_index)=0, \old(length)=2, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L6970] struct sk_buff *tmp ; VAL [\old(last_index)=0, \old(length)=2, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, length=2, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L6972] CALL, EXPR ldv_skb_alloc() VAL [\old(last_index)=0, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L7150] void *skb ; [L7151] void *tmp___7 ; VAL [\old(last_index)=0, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L7153] CALL, EXPR ldv_zalloc(sizeof(struct sk_buff___0 )) VAL [\old(last_index)=0, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L5631] void *p ; [L5632] void *tmp ; [L5633] int tmp___0 ; [L5635] tmp___0 = __VERIFIER_nondet_int() [L5636] COND FALSE !(tmp___0 != 0) [L5639] EXPR, FCALL calloc(1UL, size) [L5639] tmp = calloc(1UL, size) [L5640] p = tmp VAL [\old(last_index)=0, \old(size)=248, __this_module={8589934597:8589934603}, calloc(1UL, size)={-18446744073709551615:0}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, p={-18446744073709551615:0}, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, size=248, sync_ops={21:0}, sync_ops_group0={0:0}, tmp={-18446744073709551615:0}, tmp___0=0] [L5641] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, \old(last_index)=0, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L5610] COND FALSE !(!cond) VAL [\old(cond)=1, \old(last_index)=0, __this_module={8589934597:8589934603}, cond=1, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L5641] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(last_index)=0, \old(size)=248, __this_module={8589934597:8589934603}, calloc(1UL, size)={-18446744073709551615:0}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, p={-18446744073709551615:0}, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, size=248, sync_ops={21:0}, sync_ops_group0={0:0}, tmp={-18446744073709551615:0}, tmp___0=0] [L5642] return (p); VAL [\old(last_index)=0, \old(size)=248, \result={-18446744073709551615:0}, __this_module={8589934597:8589934603}, calloc(1UL, size)={-18446744073709551615:0}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, p={-18446744073709551615:0}, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, size=248, sync_ops={21:0}, sync_ops_group0={0:0}, tmp={-18446744073709551615:0}, tmp___0=0] [L7153] RET, EXPR ldv_zalloc(sizeof(struct sk_buff___0 )) VAL [\old(last_index)=0, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_zalloc(sizeof(struct sk_buff___0 ))={-18446744073709551615:0}, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L7153] tmp___7 = ldv_zalloc(sizeof(struct sk_buff___0 )) [L7154] skb = (struct sk_buff___0 *)tmp___7 VAL [\old(last_index)=0, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, skb={-18446744073709551615:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp___7={-18446744073709551615:0}] [L7155] COND FALSE !(! skb) [L7158] CALL ldv_set_add(LDV_SKBS, skb) [L7026] int i ; [L7028] i = 0 VAL [\old(last_index)=0, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, e={-18446744073709551615:0}, e={-18446744073709551615:0}, i=0, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L7029] COND TRUE 1 VAL [\old(last_index)=0, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, e={-18446744073709551615:0}, e={-18446744073709551615:0}, i=0, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L7030] COND FALSE !(i < last_index) VAL [\old(last_index)=0, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, e={-18446744073709551615:0}, e={-18446744073709551615:0}, i=0, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L7040] COND TRUE last_index < 15 [L7041] set_impl[last_index] = e [L7042] last_index = last_index + 1 VAL [\old(last_index)=0, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, e={-18446744073709551615:0}, e={-18446744073709551615:0}, i=0, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L7158] RET ldv_set_add(LDV_SKBS, skb) [L7159] return (skb); VAL [\old(last_index)=0, \result={-18446744073709551615:0}, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, skb={-18446744073709551615:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp___7={-18446744073709551615:0}] [L6972] RET, EXPR ldv_skb_alloc() VAL [\old(last_index)=0, \old(length)=2, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_skb_alloc()={-18446744073709551615:0}, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, length=2, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L6972] tmp = ldv_skb_alloc() [L6973] return (tmp); VAL [\old(last_index)=0, \old(length)=2, \result={-18446744073709551615:0}, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, length=2, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp={-18446744073709551615:0}] [L6410] RET, EXPR ldv_dev_alloc_skb_15(skb->len + 2U) VAL [__this_module={8589934597:8589934603}, ap={24:0}, ap={24:0}, data={1:55}, disc_data_lock={22:0}, islcp=1, last_index=1, ldv_dev_alloc_skb_15(skb->len + 2U)={-18446744073709551615:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, proto=49185, ref_cnt=0, set_impl={24:0}, skb={0:0}, skb={0:0}, skb->len=4294967296, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=49185, tmp___2=0] [L6410] tmp___0 = ldv_dev_alloc_skb_15(skb->len + 2U) [L6411] npkt = tmp___0 VAL [__this_module={8589934597:8589934603}, ap={24:0}, ap={24:0}, data={1:55}, disc_data_lock={22:0}, islcp=1, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, npkt={-18446744073709551615:0}, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, proto=49185, ref_cnt=0, set_impl={24:0}, skb={0:0}, skb={0:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=49185, tmp___0={-18446744073709551615:0}, tmp___2=0] [L6412] COND FALSE !((unsigned long )npkt == (unsigned long )((struct sk_buff *)0)) VAL [__this_module={8589934597:8589934603}, ap={24:0}, ap={24:0}, data={1:55}, disc_data_lock={22:0}, islcp=1, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, npkt={-18446744073709551615:0}, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, proto=49185, ref_cnt=0, set_impl={24:0}, skb={0:0}, skb={0:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=49185, tmp___0={-18446744073709551615:0}, tmp___2=0] [L6417] CALL skb_reserve(npkt, 2) VAL [\old(len)=2, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, skb={-18446744073709551615:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L5579] EXPR skb->data [L5579] skb->data = skb->data + (unsigned long )len [L5580] EXPR skb->tail [L5580] skb->tail = skb->tail + (sk_buff_data_t )len [L6417] RET skb_reserve(npkt, 2) VAL [__this_module={8589934597:8589934603}, ap={24:0}, ap={24:0}, data={1:55}, disc_data_lock={22:0}, islcp=1, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, npkt={-18446744073709551615:0}, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, proto=49185, ref_cnt=0, set_impl={24:0}, skb={0:0}, skb={0:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=49185, tmp___0={-18446744073709551615:0}, tmp___2=0] [L6418] EXPR skb->len VAL [__this_module={8589934597:8589934603}, ap={24:0}, ap={24:0}, data={1:55}, disc_data_lock={22:0}, islcp=1, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, npkt={-18446744073709551615:0}, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, proto=49185, ref_cnt=0, set_impl={24:0}, skb={0:0}, skb={0:0}, skb->len=4294967296, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=49185, tmp___0={-18446744073709551615:0}, tmp___2=0] [L6418] CALL, EXPR skb_put(npkt, skb->len) VAL [\old(arg1)=4294967296, __this_module={8589934597:8589934603}, arg0={-18446744073709551615:0}, disc_data_lock={22:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L7333] EXPR arg0->data [L7333] EXPR arg0->tail [L7333] unsigned char *ret_val = arg0->data + arg0->tail; [L7334] EXPR arg0->tail [L7334] arg0->tail += arg1 [L7335] return ret_val; VAL [\old(arg1)=4294967296, \result={8589934599:39}, __this_module={8589934597:8589934603}, arg0={-18446744073709551615:0}, arg0={-18446744073709551615:0}, arg1=4294967296, disc_data_lock={22:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, ret_val={8589934599:39}, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L6418] RET, EXPR skb_put(npkt, skb->len) VAL [__this_module={8589934597:8589934603}, ap={24:0}, ap={24:0}, data={1:55}, disc_data_lock={22:0}, islcp=1, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, npkt={-18446744073709551615:0}, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, proto=49185, ref_cnt=0, set_impl={24:0}, skb={0:0}, skb={0:0}, skb->len=4294967296, skb_put(npkt, skb->len)={8589934599:39}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=49185, tmp___0={-18446744073709551615:0}, tmp___2=0] [L6418] tmp___1 = skb_put(npkt, skb->len) [L6419] EXPR skb->len [L6419] CALL skb_copy_from_linear_data((struct sk_buff const *)skb, (void *)tmp___1, skb->len) [L5592] size_t __len ; [L5593] void *__ret ; [L5595] __len = (size_t )len [L5596] EXPR skb->data VAL [\old(len)=0, __len=0, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, len=0, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, skb={0:0}, skb={0:0}, skb->data={1:55}, sync_ops={21:0}, sync_ops_group0={0:0}, to={8589934599:39}, to={8589934599:39}] [L5596] EXPR, FCALL memcpy(to, (void const *)skb->data, __len) VAL [\old(len)=0, __len=0, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, len=0, memcpy(to, (void const *)skb->data, __len)={8589934599:39}, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, skb={0:0}, skb={0:0}, skb->data={1:55}, sync_ops={21:0}, sync_ops_group0={0:0}, to={8589934599:39}, to={8589934599:39}] [L5596] __ret = memcpy(to, (void const *)skb->data, __len) [L6419] RET skb_copy_from_linear_data((struct sk_buff const *)skb, (void *)tmp___1, skb->len) [L6420] CALL ldv_consume_skb_17(skb) [L6986] CALL ldv_skb_free(ldv_func_arg1) VAL [\old(last_index)=1, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, skb={0:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L7173] CALL ldv_set_remove(LDV_SKBS, skb) VAL [\old(last_index)=1, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, e={0:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set={0:0}, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L7051] int i ; [L7052] int deleted_index ; [L7054] deleted_index = -1 [L7055] i = 0 VAL [\old(last_index)=1, __this_module={8589934597:8589934603}, deleted_index=-1, disc_data_lock={22:0}, e={0:0}, e={0:0}, i=0, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L7056] COND TRUE 1 VAL [\old(last_index)=1, __this_module={8589934597:8589934603}, deleted_index=-1, disc_data_lock={22:0}, e={0:0}, e={0:0}, i=0, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L7057] COND TRUE i < last_index VAL [\old(last_index)=1, __this_module={8589934597:8589934603}, deleted_index=-1, disc_data_lock={22:0}, e={0:0}, e={0:0}, i=0, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L7061] EXPR set_impl[i] VAL [\old(last_index)=1, __this_module={8589934597:8589934603}, deleted_index=-1, disc_data_lock={22:0}, e={0:0}, e={0:0}, i=0, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={24:0}, set_impl[i]={-18446744073709551615:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L7061] COND FALSE !((unsigned long )set_impl[i] == (unsigned long )e) [L7066] i = i + 1 VAL [\old(last_index)=1, __this_module={8589934597:8589934603}, deleted_index=-1, disc_data_lock={22:0}, e={0:0}, e={0:0}, i=1, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L7056] COND TRUE 1 VAL [\old(last_index)=1, __this_module={8589934597:8589934603}, deleted_index=-1, disc_data_lock={22:0}, e={0:0}, e={0:0}, i=1, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L7057] COND FALSE !(i < last_index) VAL [\old(last_index)=1, __this_module={8589934597:8589934603}, deleted_index=-1, disc_data_lock={22:0}, e={0:0}, e={0:0}, i=1, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L7068] COND FALSE !(deleted_index != -1) VAL [\old(last_index)=1, __this_module={8589934597:8589934603}, deleted_index=-1, disc_data_lock={22:0}, e={0:0}, e={0:0}, i=1, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L7173] RET ldv_set_remove(LDV_SKBS, skb) VAL [\old(last_index)=1, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, skb={0:0}, skb={0:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L6986] RET ldv_skb_free(ldv_func_arg1) VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=1, ldv_func_arg1={0:0}, ldv_func_arg1={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L6420] RET ldv_consume_skb_17(skb) [L6421] skb = npkt VAL [__this_module={8589934597:8589934603}, ap={24:0}, ap={24:0}, data={1:55}, disc_data_lock={22:0}, islcp=1, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, npkt={-18446744073709551615:0}, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, proto=49185, ref_cnt=0, set_impl={24:0}, skb={-18446744073709551615:0}, skb={0:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=49185, tmp___0={-18446744073709551615:0}, tmp___1={8589934599:39}, tmp___2=0] [L6424] CALL skb_push(skb, 2U) VAL [\old(arg1)=2, __this_module={8589934597:8589934603}, arg0={-18446744073709551615:0}, disc_data_lock={22:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L7330] CALL, EXPR ldv_malloc(sizeof(unsigned char)) VAL [\old(size)=1, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L5614] void *p ; [L5615] void *tmp ; [L5616] int tmp___0 ; [L5618] tmp___0 = __VERIFIER_nondet_int() [L5619] COND TRUE tmp___0 != 0 [L5620] return ((void *)0); VAL [\old(size)=1, \result={0:0}, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, size=1, sync_ops={21:0}, sync_ops_group0={0:0}, tmp___0=1] [L7330] RET, EXPR ldv_malloc(sizeof(unsigned char)) VAL [\old(arg1)=2, __this_module={8589934597:8589934603}, arg0={-18446744073709551615:0}, arg0={-18446744073709551615:0}, arg1=2, disc_data_lock={22:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(unsigned char))={0:0}, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L7330] return ldv_malloc(sizeof(unsigned char)); [L6424] RET skb_push(skb, 2U) VAL [__this_module={8589934597:8589934603}, ap={24:0}, ap={24:0}, data={1:55}, disc_data_lock={22:0}, islcp=1, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, npkt={-18446744073709551615:0}, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, proto=49185, ref_cnt=0, set_impl={24:0}, skb={0:0}, skb={-18446744073709551615:0}, skb_push(skb, 2U)={0:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=49185, tmp___0={-18446744073709551615:0}, tmp___1={8589934599:39}, tmp___2=0] [L6425] EXPR skb->data [L6425] *(skb->data) = 255U [L6426] EXPR skb->data [L6426] *(skb->data + 1UL) = 3U [L6429] ap->last_xmit = jiffies [L6430] (unsigned long )skb != (unsigned long )((struct sk_buff *)0) && (ap->flags & 262144U) != 0U [L6430] EXPR ap->flags [L6430] (unsigned long )skb != (unsigned long )((struct sk_buff *)0) && (ap->flags & 262144U) != 0U VAL [(unsigned long )skb != (unsigned long )((struct sk_buff *)0) && (ap->flags & 262144U) != 0U=0, __this_module={8589934597:8589934603}, ap={24:0}, ap={24:0}, ap->flags=8589934587, data={1:55}, disc_data_lock={22:0}, islcp=1, jiffies=8589934592, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, npkt={-18446744073709551615:0}, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, proto=49185, ref_cnt=0, set_impl={24:0}, skb={-18446744073709551615:0}, skb={0:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=49185, tmp___0={-18446744073709551615:0}, tmp___1={8589934599:39}, tmp___2=0] [L6430] COND FALSE !((unsigned long )skb != (unsigned long )((struct sk_buff *)0) && (ap->flags & 262144U) != 0U) [L6434] return (skb); VAL [\result={-18446744073709551615:0}, __this_module={8589934597:8589934603}, ap={24:0}, ap={24:0}, data={1:55}, disc_data_lock={22:0}, islcp=1, jiffies=8589934592, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, npkt={-18446744073709551615:0}, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, proto=49185, ref_cnt=0, set_impl={24:0}, skb={0:0}, skb={-18446744073709551615:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=49185, tmp___0={-18446744073709551615:0}, tmp___1={8589934599:39}, tmp___2=0] [L6449] RET, EXPR ppp_sync_txmunge(ap, skb) [L6449] skb = ppp_sync_txmunge(ap, skb) [L6450] COND TRUE (unsigned long )skb != (unsigned long )((struct sk_buff *)0) [L6451] ap->tpkt = skb VAL [__this_module={8589934597:8589934603}, ap={24:0}, chan={0:0}, chan={0:0}, disc_data_lock={22:0}, jiffies=8589934592, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, skb={0:0}, skb={-18446744073709551615:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=0] [L6455] CALL ppp_sync_push(ap) VAL [\old(last_index)=1, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, jiffies=8589934592, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L6461] int sent ; [L6462] int done ; [L6463] struct tty_struct *tty ; [L6464] int tty_stuffed ; [L6465] int tmp ; [L6466] int tmp___0 ; [L6467] int tmp___1 ; [L6468] int tmp___2 ; [L6470] done = 0 [L6471] EXPR ap->tty [L6471] tty = ap->tty [L6472] tty_stuffed = 0 VAL [\old(last_index)=1, __this_module={8589934597:8589934603}, ap={24:0}, ap={24:0}, disc_data_lock={22:0}, done=0, jiffies=8589934592, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tty={-18446744073709551615:0}, tty_stuffed=0] [L6473] CALL, EXPR spin_trylock_bh(& ap->xmit_lock) VAL [\old(last_index)=1, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, jiffies=8589934592, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L5417] int tmp ; [L5419] CALL, EXPR _raw_spin_trylock_bh(& lock->ldv_6338.rlock) [L7268] return __VERIFIER_nondet_int(); [L5419] RET, EXPR _raw_spin_trylock_bh(& lock->ldv_6338.rlock) [L5419] tmp = _raw_spin_trylock_bh(& lock->ldv_6338.rlock) [L5420] return (tmp); VAL [\old(last_index)=1, \result=0, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, jiffies=8589934592, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, lock={24:20}, lock={24:20}, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=0] [L6473] RET, EXPR spin_trylock_bh(& ap->xmit_lock) VAL [\old(last_index)=1, __this_module={8589934597:8589934603}, ap={24:0}, ap={24:0}, disc_data_lock={22:0}, done=0, jiffies=8589934592, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, spin_trylock_bh(& ap->xmit_lock)=0, sync_ops={21:0}, sync_ops_group0={0:0}, tty={-18446744073709551615:0}, tty_stuffed=0] [L6473] tmp = spin_trylock_bh(& ap->xmit_lock) [L6474] COND TRUE tmp == 0 [L6475] return (0); VAL [\old(last_index)=1, \result=0, __this_module={8589934597:8589934603}, ap={24:0}, ap={24:0}, disc_data_lock={22:0}, done=0, jiffies=8589934592, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=0, tty={-18446744073709551615:0}, tty_stuffed=0] [L6455] RET ppp_sync_push(ap) VAL [__this_module={8589934597:8589934603}, ap={24:0}, chan={0:0}, chan={0:0}, disc_data_lock={22:0}, jiffies=8589934592, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ppp_sync_push(ap)=0, ref_cnt=0, set_impl={24:0}, skb={0:0}, skb={-18446744073709551615:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=0] [L6456] return (1); VAL [\result=1, __this_module={8589934597:8589934603}, ap={24:0}, chan={0:0}, chan={0:0}, disc_data_lock={22:0}, jiffies=8589934592, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, skb={0:0}, skb={-18446744073709551615:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=0] [L6882] RET ppp_sync_send(sync_ops_group0, ldvarg16) [L6883] ldv_state_variable_2 = 1 VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, jiffies=8589934592, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0=8589934607, ldvarg1=13, ldvarg10={0:0}, ldvarg11=0, ldvarg12={0:0}, ldvarg13={0:0}, ldvarg14=8589934595, ldvarg15=4294967292, ldvarg16={0:0}, ldvarg2={0:0}, ldvarg3=-2, ldvarg4={0:0}, ldvarg5={0:0}, ldvarg6={0:0}, ldvarg7={0:0}, ldvarg8=0, ldvarg9={0:0}, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=0, tmp___0={0:0}, tmp___1=-2, tmp___10={0:0}, tmp___11={0:0}, tmp___12={0:0}, tmp___13=8589934595, tmp___14={0:0}, tmp___15=4294967292, tmp___16=2, tmp___18=1, tmp___19=0, tmp___2=8589934607, tmp___3={0:0}, tmp___4={0:0}, tmp___5={0:0}, tmp___6=0, tmp___7=13, tmp___8={0:0}, tmp___9={0:0}] [L6740] tmp___16 = __VERIFIER_nondet_int() [L6742] case 0: [L6838] case 1: VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, jiffies=8589934592, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0=8589934607, ldvarg1=13, ldvarg10={0:0}, ldvarg11=0, ldvarg12={0:0}, ldvarg13={0:0}, ldvarg14=8589934595, ldvarg15=4294967292, ldvarg16={0:0}, ldvarg2={0:0}, ldvarg3=-2, ldvarg4={0:0}, ldvarg5={0:0}, ldvarg6={0:0}, ldvarg7={0:0}, ldvarg8=0, ldvarg9={0:0}, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=0, tmp___0={0:0}, tmp___1=-2, tmp___10={0:0}, tmp___11={0:0}, tmp___12={0:0}, tmp___13=8589934595, tmp___14={0:0}, tmp___15=4294967292, tmp___16=1, tmp___18=1, tmp___19=0, tmp___2=8589934607, tmp___3={0:0}, tmp___4={0:0}, tmp___5={0:0}, tmp___6=0, tmp___7=13, tmp___8={0:0}, tmp___9={0:0}] [L6839] COND TRUE ldv_state_variable_0 != 0 [L6840] tmp___18 = __VERIFIER_nondet_int() [L6842] case 0: VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, jiffies=8589934592, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0=8589934607, ldvarg1=13, ldvarg10={0:0}, ldvarg11=0, ldvarg12={0:0}, ldvarg13={0:0}, ldvarg14=8589934595, ldvarg15=4294967292, ldvarg16={0:0}, ldvarg2={0:0}, ldvarg3=-2, ldvarg4={0:0}, ldvarg5={0:0}, ldvarg6={0:0}, ldvarg7={0:0}, ldvarg8=0, ldvarg9={0:0}, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=0, tmp___0={0:0}, tmp___1=-2, tmp___10={0:0}, tmp___11={0:0}, tmp___12={0:0}, tmp___13=8589934595, tmp___14={0:0}, tmp___15=4294967292, tmp___16=1, tmp___18=0, tmp___19=0, tmp___2=8589934607, tmp___3={0:0}, tmp___4={0:0}, tmp___5={0:0}, tmp___6=0, tmp___7=13, tmp___8={0:0}, tmp___9={0:0}] [L6843] COND TRUE ldv_state_variable_0 == 3 && ref_cnt == 0 [L6844] CALL ppp_sync_cleanup() [L6627] int tmp ; [L6629] CALL, EXPR tty_unregister_ldisc(14) [L7366] return __VERIFIER_nondet_int(); [L6629] RET, EXPR tty_unregister_ldisc(14) [L6629] tmp = tty_unregister_ldisc(14) [L6630] COND TRUE tmp != 0 [L6844] RET ppp_sync_cleanup() [L6845] ldv_state_variable_0 = 2 VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, jiffies=8589934592, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0=8589934607, ldvarg1=13, ldvarg10={0:0}, ldvarg11=0, ldvarg12={0:0}, ldvarg13={0:0}, ldvarg14=8589934595, ldvarg15=4294967292, ldvarg16={0:0}, ldvarg2={0:0}, ldvarg3=-2, ldvarg4={0:0}, ldvarg5={0:0}, ldvarg6={0:0}, ldvarg7={0:0}, ldvarg8=0, ldvarg9={0:0}, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp=0, tmp___0={0:0}, tmp___1=-2, tmp___10={0:0}, tmp___11={0:0}, tmp___12={0:0}, tmp___13=8589934595, tmp___14={0:0}, tmp___15=4294967292, tmp___16=1, tmp___18=0, tmp___19=0, tmp___2=8589934607, tmp___3={0:0}, tmp___4={0:0}, tmp___5={0:0}, tmp___6=0, tmp___7=13, tmp___8={0:0}, tmp___9={0:0}] [L6907] CALL ldv_check_final_state() [L7217] int tmp___7 ; [L7219] CALL, EXPR ldv_set_is_empty(LDV_SKBS) [L7108] return (last_index == 0); VAL [\result=0, __this_module={8589934597:8589934603}, disc_data_lock={22:0}, jiffies=8589934592, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L7219] RET, EXPR ldv_set_is_empty(LDV_SKBS) [L7219] tmp___7 = ldv_set_is_empty(LDV_SKBS) [L7220] COND FALSE !(\read(tmp___7)) VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, jiffies=8589934592, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}, tmp___7=0] [L7222] CALL ldv_error() VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, jiffies=8589934592, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] [L5666] reach_error() VAL [__this_module={8589934597:8589934603}, disc_data_lock={22:0}, jiffies=8589934592, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ppp_sync_ldisc={23:0}, ppp_sync_ldisc_group1={0:0}, ref_cnt=0, set_impl={24:0}, sync_ops={21:0}, sync_ops_group0={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 41 procedures, 645 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 67.6s, OverallIterations: 17, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 46.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28667 SdHoareTripleChecker+Valid, 33.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27520 mSDsluCounter, 82791 SdHoareTripleChecker+Invalid, 28.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 64628 mSDsCounter, 11556 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35458 IncrementalHoareTripleChecker+Invalid, 47014 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11556 mSolverCounterUnsat, 18163 mSDtfsCounter, 35458 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1722 GetRequests, 1474 SyntacticMatches, 4 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1213 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24889occurred in iteration=12, InterpolantAutomatonStates: 210, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 51055 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 3666 NumberOfCodeBlocks, 3666 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 3609 ConstructedInterpolants, 0 QuantifiedInterpolants, 9547 SizeOfPredicates, 20 NumberOfNonLiveVariables, 4333 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 20 InterpolantComputations, 15 PerfectInterpolantSequences, 6025/6075 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-22 23:53:04,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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--ppp--ppp_synctty.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 389f662f7096bd36438270dc54f296be4073de8eeb864b893c17044d6fb4cc06 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 23:53:06,904 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 23:53:06,906 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 23:53:06,943 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 23:53:06,943 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 23:53:06,945 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 23:53:06,949 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 23:53:06,952 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 23:53:06,954 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 23:53:06,960 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 23:53:06,960 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 23:53:06,961 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 23:53:06,962 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 23:53:06,962 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 23:53:06,963 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 23:53:06,964 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 23:53:06,965 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 23:53:06,965 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 23:53:06,967 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 23:53:06,968 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 23:53:06,969 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 23:53:06,973 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 23:53:06,976 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 23:53:06,977 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 23:53:06,978 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 23:53:06,986 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 23:53:06,986 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 23:53:06,986 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 23:53:06,987 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 23:53:06,988 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 23:53:06,988 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 23:53:06,988 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 23:53:06,989 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 23:53:06,990 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 23:53:06,990 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 23:53:06,991 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 23:53:06,991 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 23:53:06,992 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 23:53:06,992 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 23:53:06,992 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 23:53:06,993 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 23:53:06,994 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 23:53:07,000 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-07-22 23:53:07,030 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 23:53:07,031 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 23:53:07,032 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 23:53:07,032 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 23:53:07,033 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 23:53:07,033 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 23:53:07,034 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 23:53:07,034 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 23:53:07,034 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 23:53:07,035 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 23:53:07,036 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 23:53:07,036 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 23:53:07,036 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 23:53:07,036 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 23:53:07,036 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-22 23:53:07,037 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-22 23:53:07,037 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-22 23:53:07,037 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 23:53:07,037 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 23:53:07,037 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 23:53:07,038 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 23:53:07,038 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 23:53:07,038 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 23:53:07,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 23:53:07,038 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 23:53:07,039 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 23:53:07,039 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 23:53:07,039 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-22 23:53:07,039 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-22 23:53:07,039 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 23:53:07,040 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 23:53:07,040 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 23:53:07,040 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-22 23:53:07,040 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 -> 389f662f7096bd36438270dc54f296be4073de8eeb864b893c17044d6fb4cc06 [2022-07-22 23:53:07,339 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 23:53:07,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 23:53:07,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 23:53:07,361 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 23:53:07,361 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 23:53:07,363 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--ppp--ppp_synctty.ko-entry_point.cil.out.i [2022-07-22 23:53:07,414 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d220f6b6/55d9d80ad4a548538cb5f7860d04f871/FLAG4907b7658 [2022-07-22 23:53:08,220 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 23:53:08,220 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--ppp--ppp_synctty.ko-entry_point.cil.out.i [2022-07-22 23:53:08,256 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d220f6b6/55d9d80ad4a548538cb5f7860d04f871/FLAG4907b7658 [2022-07-22 23:53:08,395 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d220f6b6/55d9d80ad4a548538cb5f7860d04f871 [2022-07-22 23:53:08,397 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 23:53:08,399 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 23:53:08,400 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 23:53:08,400 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 23:53:08,406 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 23:53:08,407 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:53:08" (1/1) ... [2022-07-22 23:53:08,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b622598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:53:08, skipping insertion in model container [2022-07-22 23:53:08,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:53:08" (1/1) ... [2022-07-22 23:53:08,416 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 23:53:08,515 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 23:53:09,535 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--ppp--ppp_synctty.ko-entry_point.cil.out.i[163507,163520] [2022-07-22 23:53:09,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 23:53:09,922 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-22 23:53:09,978 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 23:53:10,146 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--ppp--ppp_synctty.ko-entry_point.cil.out.i[163507,163520] [2022-07-22 23:53:10,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 23:53:10,265 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 23:53:10,469 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--ppp--ppp_synctty.ko-entry_point.cil.out.i[163507,163520] [2022-07-22 23:53:10,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 23:53:10,677 INFO L208 MainTranslator]: Completed translation [2022-07-22 23:53:10,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:53:10 WrapperNode [2022-07-22 23:53:10,678 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 23:53:10,679 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 23:53:10,679 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 23:53:10,679 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 23:53:10,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:53:10" (1/1) ... [2022-07-22 23:53:10,748 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:53:10" (1/1) ... [2022-07-22 23:53:10,846 INFO L137 Inliner]: procedures = 190, calls = 448, calls flagged for inlining = 92, calls inlined = 85, statements flattened = 1716 [2022-07-22 23:53:10,847 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 23:53:10,847 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 23:53:10,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 23:53:10,848 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 23:53:10,856 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:53:10" (1/1) ... [2022-07-22 23:53:10,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:53:10" (1/1) ... [2022-07-22 23:53:10,883 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:53:10" (1/1) ... [2022-07-22 23:53:10,883 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:53:10" (1/1) ... [2022-07-22 23:53:10,960 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:53:10" (1/1) ... [2022-07-22 23:53:10,980 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:53:10" (1/1) ... [2022-07-22 23:53:10,990 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:53:10" (1/1) ... [2022-07-22 23:53:11,020 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 23:53:11,022 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 23:53:11,023 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 23:53:11,023 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 23:53:11,023 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:53:10" (1/1) ... [2022-07-22 23:53:11,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 23:53:11,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 23:53:11,057 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-22 23:53:11,099 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-22 23:53:11,100 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-22 23:53:11,100 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_alloc_skb_15 [2022-07-22 23:53:11,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_alloc_skb_15 [2022-07-22 23:53:11,100 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_sync_poll [2022-07-22 23:53:11,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_sync_poll [2022-07-22 23:53:11,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-22 23:53:11,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-07-22 23:53:11,101 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reserve [2022-07-22 23:53:11,101 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reserve [2022-07-22 23:53:11,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-22 23:53:11,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-22 23:53:11,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2022-07-22 23:53:11,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-22 23:53:11,102 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-22 23:53:11,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-22 23:53:11,102 INFO L130 BoogieDeclarations]: Found specification of procedure skb_push [2022-07-22 23:53:11,102 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_push [2022-07-22 23:53:11,102 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_output_wakeup [2022-07-22 23:53:11,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_output_wakeup [2022-07-22 23:53:11,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-22 23:53:11,087 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-22 23:53:11,103 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-22 23:53:11,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2022-07-22 23:53:11,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2022-07-22 23:53:11,104 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-22 23:53:11,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-22 23:53:11,104 INFO L130 BoogieDeclarations]: Found specification of procedure spin_trylock_bh [2022-07-22 23:53:11,104 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_trylock_bh [2022-07-22 23:53:11,104 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-22 23:53:11,105 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-22 23:53:11,105 INFO L130 BoogieDeclarations]: Found specification of procedure skb_trim [2022-07-22 23:53:11,105 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_trim [2022-07-22 23:53:11,105 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-07-22 23:53:11,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-07-22 23:53:11,106 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_synctty_ioctl [2022-07-22 23:53:11,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_synctty_ioctl [2022-07-22 23:53:11,106 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-22 23:53:11,106 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-22 23:53:11,106 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-22 23:53:11,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-22 23:53:11,106 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2022-07-22 23:53:11,107 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2022-07-22 23:53:11,107 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_sync_close [2022-07-22 23:53:11,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_sync_close [2022-07-22 23:53:11,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2022-07-22 23:53:11,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2022-07-22 23:53:11,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2022-07-22 23:53:11,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2022-07-22 23:53:11,108 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-22 23:53:11,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-22 23:53:11,109 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-22 23:53:11,109 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-22 23:53:11,110 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_print_buffer [2022-07-22 23:53:11,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_print_buffer [2022-07-22 23:53:11,110 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-22 23:53:11,110 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-22 23:53:11,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 23:53:11,110 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-07-22 23:53:11,111 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-07-22 23:53:11,111 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-22 23:53:11,111 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-22 23:53:11,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 23:53:11,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 23:53:11,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 23:53:11,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2022-07-22 23:53:11,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2022-07-22 23:53:11,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2022-07-22 23:53:11,112 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-07-22 23:53:11,113 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-07-22 23:53:11,113 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_schedule [2022-07-22 23:53:11,113 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_schedule [2022-07-22 23:53:11,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 23:53:11,113 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-07-22 23:53:11,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-07-22 23:53:11,113 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec_and_test [2022-07-22 23:53:11,113 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec_and_test [2022-07-22 23:53:11,114 INFO L130 BoogieDeclarations]: Found specification of procedure sp_put [2022-07-22 23:53:11,114 INFO L138 BoogieDeclarations]: Found implementation of procedure sp_put [2022-07-22 23:53:11,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-07-22 23:53:11,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-07-22 23:53:11,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 23:53:11,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-22 23:53:11,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-22 23:53:11,115 INFO L130 BoogieDeclarations]: Found specification of procedure skb_queue_tail [2022-07-22 23:53:11,115 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_queue_tail [2022-07-22 23:53:11,115 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_sync_hangup [2022-07-22 23:53:11,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_sync_hangup [2022-07-22 23:53:11,116 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-22 23:53:11,116 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-22 23:53:11,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-22 23:53:11,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-07-22 23:53:11,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2022-07-22 23:53:11,117 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-07-22 23:53:11,118 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-07-22 23:53:11,118 INFO L130 BoogieDeclarations]: Found specification of procedure sp_get [2022-07-22 23:53:11,118 INFO L138 BoogieDeclarations]: Found implementation of procedure sp_get [2022-07-22 23:53:11,118 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-22 23:53:11,118 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-22 23:53:11,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2022-07-22 23:53:11,118 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2022-07-22 23:53:11,119 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2022-07-22 23:53:11,119 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-22 23:53:11,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-22 23:53:11,119 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-07-22 23:53:11,119 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-07-22 23:53:11,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 23:53:11,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 23:53:11,120 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_sync_push [2022-07-22 23:53:11,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_sync_push [2022-07-22 23:53:11,643 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 23:53:11,646 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 23:53:11,771 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-22 23:53:19,485 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 23:53:19,504 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 23:53:19,505 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 23:53:19,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:53:19 BoogieIcfgContainer [2022-07-22 23:53:19,510 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 23:53:19,511 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 23:53:19,512 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 23:53:19,515 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 23:53:19,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 11:53:08" (1/3) ... [2022-07-22 23:53:19,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37e2f9da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:53:19, skipping insertion in model container [2022-07-22 23:53:19,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:53:10" (2/3) ... [2022-07-22 23:53:19,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37e2f9da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:53:19, skipping insertion in model container [2022-07-22 23:53:19,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:53:19" (3/3) ... [2022-07-22 23:53:19,523 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_synctty.ko-entry_point.cil.out.i [2022-07-22 23:53:19,536 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 23:53:19,536 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 23:53:19,614 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 23:53:19,624 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@733f9934, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6a147d57 [2022-07-22 23:53:19,624 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 23:53:19,633 INFO L276 IsEmpty]: Start isEmpty. Operand has 644 states, 483 states have (on average 1.391304347826087) internal successors, (672), 499 states have internal predecessors, (672), 120 states have call successors, (120), 40 states have call predecessors, (120), 39 states have return successors, (116), 114 states have call predecessors, (116), 116 states have call successors, (116) [2022-07-22 23:53:19,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-22 23:53:19,650 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:53:19,651 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 23:53:19,651 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:53:19,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:53:19,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1758611482, now seen corresponding path program 1 times [2022-07-22 23:53:19,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 23:53:19,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [694573044] [2022-07-22 23:53:19,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:53:19,671 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 23:53:19,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 23:53:19,679 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-22 23:53:19,711 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-22 23:53:20,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:20,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 23:53:20,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:53:20,275 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-22 23:53:20,276 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:53:20,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 23:53:20,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [694573044] [2022-07-22 23:53:20,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [694573044] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:53:20,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:53:20,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 23:53:20,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484727262] [2022-07-22 23:53:20,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:53:20,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 23:53:20,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 23:53:20,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 23:53:20,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 23:53:20,342 INFO L87 Difference]: Start difference. First operand has 644 states, 483 states have (on average 1.391304347826087) internal successors, (672), 499 states have internal predecessors, (672), 120 states have call successors, (120), 40 states have call predecessors, (120), 39 states have return successors, (116), 114 states have call predecessors, (116), 116 states have call successors, (116) Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-22 23:53:20,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:53:20,597 INFO L93 Difference]: Finished difference Result 1877 states and 2724 transitions. [2022-07-22 23:53:20,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 23:53:20,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 78 [2022-07-22 23:53:20,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:53:20,622 INFO L225 Difference]: With dead ends: 1877 [2022-07-22 23:53:20,622 INFO L226 Difference]: Without dead ends: 1222 [2022-07-22 23:53:20,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 76 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-22 23:53:20,633 INFO L413 NwaCegarLoop]: 1008 mSDtfsCounter, 833 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 1889 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 23:53:20,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 1889 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 23:53:20,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2022-07-22 23:53:20,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1222. [2022-07-22 23:53:20,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1222 states, 926 states have (on average 1.3736501079913608) internal successors, (1272), 946 states have internal predecessors, (1272), 219 states have call successors, (219), 77 states have call predecessors, (219), 76 states have return successors, (218), 214 states have call predecessors, (218), 218 states have call successors, (218) [2022-07-22 23:53:20,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1709 transitions. [2022-07-22 23:53:20,798 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1709 transitions. Word has length 78 [2022-07-22 23:53:20,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:53:20,799 INFO L495 AbstractCegarLoop]: Abstraction has 1222 states and 1709 transitions. [2022-07-22 23:53:20,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-22 23:53:20,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1709 transitions. [2022-07-22 23:53:20,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-22 23:53:20,808 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:53:20,809 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 23:53:20,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-22 23:53:21,023 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-22 23:53:21,023 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:53:21,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:53:21,024 INFO L85 PathProgramCache]: Analyzing trace with hash -152487068, now seen corresponding path program 1 times [2022-07-22 23:53:21,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 23:53:21,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1813330558] [2022-07-22 23:53:21,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:53:21,025 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 23:53:21,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 23:53:21,027 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-22 23:53:21,029 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-22 23:53:21,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:21,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 23:53:21,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:53:21,544 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-22 23:53:21,544 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:53:21,545 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 23:53:21,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1813330558] [2022-07-22 23:53:21,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1813330558] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:53:21,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:53:21,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 23:53:21,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919252451] [2022-07-22 23:53:21,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:53:21,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 23:53:21,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 23:53:21,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 23:53:21,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 23:53:21,548 INFO L87 Difference]: Start difference. First operand 1222 states and 1709 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-22 23:53:21,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:53:21,848 INFO L93 Difference]: Finished difference Result 3615 states and 5103 transitions. [2022-07-22 23:53:21,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 23:53:21,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 82 [2022-07-22 23:53:21,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:53:21,870 INFO L225 Difference]: With dead ends: 3615 [2022-07-22 23:53:21,870 INFO L226 Difference]: Without dead ends: 2411 [2022-07-22 23:53:21,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-22 23:53:21,905 INFO L413 NwaCegarLoop]: 1052 mSDtfsCounter, 863 mSDsluCounter, 2963 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 4015 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.2s IncrementalHoareTripleChecker+Time [2022-07-22 23:53:21,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 4015 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 23:53:21,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2411 states. [2022-07-22 23:53:21,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2411 to 2403. [2022-07-22 23:53:21,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2403 states, 1823 states have (on average 1.3752057048820625) internal successors, (2507), 1863 states have internal predecessors, (2507), 427 states have call successors, (427), 153 states have call predecessors, (427), 152 states have return successors, (464), 418 states have call predecessors, (464), 426 states have call successors, (464) [2022-07-22 23:53:22,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2403 states to 2403 states and 3398 transitions. [2022-07-22 23:53:22,015 INFO L78 Accepts]: Start accepts. Automaton has 2403 states and 3398 transitions. Word has length 82 [2022-07-22 23:53:22,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:53:22,017 INFO L495 AbstractCegarLoop]: Abstraction has 2403 states and 3398 transitions. [2022-07-22 23:53:22,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-22 23:53:22,018 INFO L276 IsEmpty]: Start isEmpty. Operand 2403 states and 3398 transitions. [2022-07-22 23:53:22,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-22 23:53:22,026 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:53:22,027 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2022-07-22 23:53:22,044 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-22 23:53:22,241 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-22 23:53:22,242 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:53:22,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:53:22,242 INFO L85 PathProgramCache]: Analyzing trace with hash -950375967, now seen corresponding path program 1 times [2022-07-22 23:53:22,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 23:53:22,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [322305096] [2022-07-22 23:53:22,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:53:22,243 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 23:53:22,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 23:53:22,251 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-22 23:53:22,254 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-22 23:53:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:22,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 23:53:22,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:53:22,732 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-22 23:53:22,732 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:53:22,732 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 23:53:22,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [322305096] [2022-07-22 23:53:22,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [322305096] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:53:22,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:53:22,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 23:53:22,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64417467] [2022-07-22 23:53:22,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:53:22,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 23:53:22,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 23:53:22,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 23:53:22,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 23:53:22,734 INFO L87 Difference]: Start difference. First operand 2403 states and 3398 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-22 23:53:23,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:53:23,012 INFO L93 Difference]: Finished difference Result 6105 states and 8595 transitions. [2022-07-22 23:53:23,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 23:53:23,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 128 [2022-07-22 23:53:23,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:53:23,033 INFO L225 Difference]: With dead ends: 6105 [2022-07-22 23:53:23,034 INFO L226 Difference]: Without dead ends: 3726 [2022-07-22 23:53:23,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 126 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-22 23:53:23,047 INFO L413 NwaCegarLoop]: 943 mSDtfsCounter, 500 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 1755 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 23:53:23,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 1755 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 23:53:23,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3726 states. [2022-07-22 23:53:23,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3726 to 3713. [2022-07-22 23:53:23,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3713 states, 2831 states have (on average 1.375132462027552) internal successors, (3893), 2877 states have internal predecessors, (3893), 633 states have call successors, (633), 249 states have call predecessors, (633), 248 states have return successors, (688), 622 states have call predecessors, (688), 632 states have call successors, (688) [2022-07-22 23:53:23,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3713 states to 3713 states and 5214 transitions. [2022-07-22 23:53:23,222 INFO L78 Accepts]: Start accepts. Automaton has 3713 states and 5214 transitions. Word has length 128 [2022-07-22 23:53:23,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:53:23,223 INFO L495 AbstractCegarLoop]: Abstraction has 3713 states and 5214 transitions. [2022-07-22 23:53:23,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-22 23:53:23,223 INFO L276 IsEmpty]: Start isEmpty. Operand 3713 states and 5214 transitions. [2022-07-22 23:53:23,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-07-22 23:53:23,231 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:53:23,233 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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-22 23:53:23,254 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-22 23:53:23,451 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-22 23:53:23,451 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:53:23,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:53:23,452 INFO L85 PathProgramCache]: Analyzing trace with hash -944835305, now seen corresponding path program 1 times [2022-07-22 23:53:23,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 23:53:23,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1065486731] [2022-07-22 23:53:23,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:53:23,453 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 23:53:23,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 23:53:23,455 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-22 23:53:23,456 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-22 23:53:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:23,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 23:53:23,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:53:23,985 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-22 23:53:23,986 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:53:23,986 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 23:53:23,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1065486731] [2022-07-22 23:53:23,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1065486731] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:53:23,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:53:23,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 23:53:23,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027800514] [2022-07-22 23:53:23,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:53:23,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 23:53:23,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 23:53:23,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 23:53:23,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 23:53:23,988 INFO L87 Difference]: Start difference. First operand 3713 states and 5214 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-22 23:53:24,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:53:24,224 INFO L93 Difference]: Finished difference Result 9002 states and 12550 transitions. [2022-07-22 23:53:24,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 23:53:24,224 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), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 149 [2022-07-22 23:53:24,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:53:24,259 INFO L225 Difference]: With dead ends: 9002 [2022-07-22 23:53:24,260 INFO L226 Difference]: Without dead ends: 5313 [2022-07-22 23:53:24,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 147 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-22 23:53:24,274 INFO L413 NwaCegarLoop]: 1274 mSDtfsCounter, 546 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 2116 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 23:53:24,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 2116 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 23:53:24,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5313 states. [2022-07-22 23:53:24,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5313 to 5304. [2022-07-22 23:53:24,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5304 states, 4047 states have (on average 1.3654558932542624) internal successors, (5526), 4129 states have internal predecessors, (5526), 874 states have call successors, (874), 383 states have call predecessors, (874), 382 states have return successors, (953), 855 states have call predecessors, (953), 873 states have call successors, (953) [2022-07-22 23:53:24,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5304 states to 5304 states and 7353 transitions. [2022-07-22 23:53:24,503 INFO L78 Accepts]: Start accepts. Automaton has 5304 states and 7353 transitions. Word has length 149 [2022-07-22 23:53:24,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:53:24,504 INFO L495 AbstractCegarLoop]: Abstraction has 5304 states and 7353 transitions. [2022-07-22 23:53:24,504 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), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-22 23:53:24,504 INFO L276 IsEmpty]: Start isEmpty. Operand 5304 states and 7353 transitions. [2022-07-22 23:53:24,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-22 23:53:24,517 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:53:24,517 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:53:24,541 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-22 23:53:24,741 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-22 23:53:24,742 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:53:24,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:53:24,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1643009203, now seen corresponding path program 1 times [2022-07-22 23:53:24,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 23:53:24,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1757413066] [2022-07-22 23:53:24,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:53:24,743 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 23:53:24,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 23:53:24,745 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-22 23:53:24,747 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-22 23:53:25,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:25,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 23:53:25,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:53:25,307 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2022-07-22 23:53:25,307 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:53:25,307 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 23:53:25,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1757413066] [2022-07-22 23:53:25,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1757413066] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:53:25,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:53:25,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 23:53:25,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547978836] [2022-07-22 23:53:25,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:53:25,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 23:53:25,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 23:53:25,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 23:53:25,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 23:53:25,309 INFO L87 Difference]: Start difference. First operand 5304 states and 7353 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-22 23:53:25,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:53:25,558 INFO L93 Difference]: Finished difference Result 8032 states and 11140 transitions. [2022-07-22 23:53:25,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 23:53:25,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 151 [2022-07-22 23:53:25,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:53:25,573 INFO L225 Difference]: With dead ends: 8032 [2022-07-22 23:53:25,573 INFO L226 Difference]: Without dead ends: 2743 [2022-07-22 23:53:25,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-22 23:53:25,586 INFO L413 NwaCegarLoop]: 886 mSDtfsCounter, 24 mSDsluCounter, 2648 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 3534 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 23:53:25,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 3534 Invalid, 22 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 23:53:25,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2743 states. [2022-07-22 23:53:25,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2743 to 2697. [2022-07-22 23:53:25,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2697 states, 2058 states have (on average 1.3644314868804666) internal successors, (2808), 2100 states have internal predecessors, (2808), 446 states have call successors, (446), 193 states have call predecessors, (446), 192 states have return successors, (485), 435 states have call predecessors, (485), 445 states have call successors, (485) [2022-07-22 23:53:25,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2697 states to 2697 states and 3739 transitions. [2022-07-22 23:53:25,670 INFO L78 Accepts]: Start accepts. Automaton has 2697 states and 3739 transitions. Word has length 151 [2022-07-22 23:53:25,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:53:25,670 INFO L495 AbstractCegarLoop]: Abstraction has 2697 states and 3739 transitions. [2022-07-22 23:53:25,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-22 23:53:25,671 INFO L276 IsEmpty]: Start isEmpty. Operand 2697 states and 3739 transitions. [2022-07-22 23:53:25,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-22 23:53:25,678 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:53:25,678 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:53:25,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-22 23:53:25,891 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-22 23:53:25,892 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:53:25,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:53:25,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1883248949, now seen corresponding path program 1 times [2022-07-22 23:53:25,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 23:53:25,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [254878234] [2022-07-22 23:53:25,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:53:25,894 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 23:53:25,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 23:53:25,895 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-22 23:53:25,898 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-22 23:53:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:26,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 23:53:26,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:53:26,422 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-07-22 23:53:26,422 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:53:26,422 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 23:53:26,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [254878234] [2022-07-22 23:53:26,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [254878234] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:53:26,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:53:26,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 23:53:26,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386755089] [2022-07-22 23:53:26,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:53:26,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 23:53:26,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 23:53:26,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 23:53:26,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 23:53:26,424 INFO L87 Difference]: Start difference. First operand 2697 states and 3739 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-22 23:53:26,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:53:26,697 INFO L93 Difference]: Finished difference Result 6649 states and 9223 transitions. [2022-07-22 23:53:26,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 23:53:26,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 151 [2022-07-22 23:53:26,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:53:26,719 INFO L225 Difference]: With dead ends: 6649 [2022-07-22 23:53:26,719 INFO L226 Difference]: Without dead ends: 4002 [2022-07-22 23:53:26,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 149 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-22 23:53:26,729 INFO L413 NwaCegarLoop]: 984 mSDtfsCounter, 686 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 1772 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 23:53:26,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 1772 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 23:53:26,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4002 states. [2022-07-22 23:53:26,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4002 to 3985. [2022-07-22 23:53:26,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3985 states, 3080 states have (on average 1.3652597402597402) internal successors, (4205), 3134 states have internal predecessors, (4205), 610 states have call successors, (610), 295 states have call predecessors, (610), 294 states have return successors, (665), 597 states have call predecessors, (665), 609 states have call successors, (665) [2022-07-22 23:53:26,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3985 states to 3985 states and 5480 transitions. [2022-07-22 23:53:26,905 INFO L78 Accepts]: Start accepts. Automaton has 3985 states and 5480 transitions. Word has length 151 [2022-07-22 23:53:26,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:53:26,905 INFO L495 AbstractCegarLoop]: Abstraction has 3985 states and 5480 transitions. [2022-07-22 23:53:26,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-22 23:53:26,918 INFO L276 IsEmpty]: Start isEmpty. Operand 3985 states and 5480 transitions. [2022-07-22 23:53:26,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-22 23:53:26,926 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:53:26,926 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:53:26,946 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-22 23:53:27,139 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-22 23:53:27,140 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:53:27,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:53:27,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1042738156, now seen corresponding path program 1 times [2022-07-22 23:53:27,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 23:53:27,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1765015023] [2022-07-22 23:53:27,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:53:27,141 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 23:53:27,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 23:53:27,143 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-22 23:53:27,145 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-22 23:53:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:27,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 23:53:27,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:53:27,587 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2022-07-22 23:53:27,587 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:53:27,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 23:53:27,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1765015023] [2022-07-22 23:53:27,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1765015023] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:53:27,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:53:27,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 23:53:27,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419246873] [2022-07-22 23:53:27,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:53:27,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 23:53:27,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 23:53:27,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 23:53:27,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 23:53:27,589 INFO L87 Difference]: Start difference. First operand 3985 states and 5480 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-22 23:53:27,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:53:27,666 INFO L93 Difference]: Finished difference Result 5989 states and 8307 transitions. [2022-07-22 23:53:27,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 23:53:27,667 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), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2022-07-22 23:53:27,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:53:27,714 INFO L225 Difference]: With dead ends: 5989 [2022-07-22 23:53:27,714 INFO L226 Difference]: Without dead ends: 4005 [2022-07-22 23:53:27,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 154 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-22 23:53:27,722 INFO L413 NwaCegarLoop]: 884 mSDtfsCounter, 5 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1760 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 23:53:27,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1760 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 23:53:27,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4005 states. [2022-07-22 23:53:27,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4005 to 4005. [2022-07-22 23:53:27,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4005 states, 3095 states have (on average 1.3634894991922455) internal successors, (4220), 3154 states have internal predecessors, (4220), 610 states have call successors, (610), 295 states have call predecessors, (610), 299 states have return successors, (670), 597 states have call predecessors, (670), 609 states have call successors, (670) [2022-07-22 23:53:27,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4005 states to 4005 states and 5500 transitions. [2022-07-22 23:53:27,856 INFO L78 Accepts]: Start accepts. Automaton has 4005 states and 5500 transitions. Word has length 156 [2022-07-22 23:53:27,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:53:27,856 INFO L495 AbstractCegarLoop]: Abstraction has 4005 states and 5500 transitions. [2022-07-22 23:53:27,857 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), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-22 23:53:27,857 INFO L276 IsEmpty]: Start isEmpty. Operand 4005 states and 5500 transitions. [2022-07-22 23:53:27,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-22 23:53:27,867 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:53:27,867 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:53:27,890 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-22 23:53:28,084 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-22 23:53:28,085 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:53:28,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:53:28,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1404375923, now seen corresponding path program 1 times [2022-07-22 23:53:28,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 23:53:28,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1827519663] [2022-07-22 23:53:28,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:53:28,086 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 23:53:28,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 23:53:28,088 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-22 23:53:28,090 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-22 23:53:28,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:28,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-22 23:53:28,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:53:28,854 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2022-07-22 23:53:28,854 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:53:28,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 23:53:28,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1827519663] [2022-07-22 23:53:28,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1827519663] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:53:28,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:53:28,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 23:53:28,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601641298] [2022-07-22 23:53:28,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:53:28,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 23:53:28,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 23:53:28,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 23:53:28,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 23:53:28,856 INFO L87 Difference]: Start difference. First operand 4005 states and 5500 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 5 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 5 states have call predecessors, (18), 4 states have call successors, (18) [2022-07-22 23:53:32,886 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:53:34,902 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:53:37,111 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:53:39,129 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:53:41,141 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:53:44,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:53:44,743 INFO L93 Difference]: Finished difference Result 8583 states and 11834 transitions. [2022-07-22 23:53:44,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 23:53:44,744 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 5 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 5 states have call predecessors, (18), 4 states have call successors, (18) Word has length 158 [2022-07-22 23:53:44,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:53:44,788 INFO L225 Difference]: With dead ends: 8583 [2022-07-22 23:53:44,789 INFO L226 Difference]: Without dead ends: 4628 [2022-07-22 23:53:44,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-22 23:53:44,801 INFO L413 NwaCegarLoop]: 959 mSDtfsCounter, 1320 mSDsluCounter, 1897 mSDsCounter, 0 mSdLazyCounter, 1537 mSolverCounterSat, 404 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1428 SdHoareTripleChecker+Valid, 2856 SdHoareTripleChecker+Invalid, 1946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 1537 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.6s IncrementalHoareTripleChecker+Time [2022-07-22 23:53:44,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1428 Valid, 2856 Invalid, 1946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 1537 Invalid, 5 Unknown, 0 Unchecked, 15.6s Time] [2022-07-22 23:53:44,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4628 states. [2022-07-22 23:53:44,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4628 to 4413. [2022-07-22 23:53:44,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4413 states, 3378 states have (on average 1.3502072232089994) internal successors, (4561), 3451 states have internal predecessors, (4561), 683 states have call successors, (683), 334 states have call predecessors, (683), 351 states have return successors, (769), 673 states have call predecessors, (769), 682 states have call successors, (769) [2022-07-22 23:53:44,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4413 states to 4413 states and 6013 transitions. [2022-07-22 23:53:44,979 INFO L78 Accepts]: Start accepts. Automaton has 4413 states and 6013 transitions. Word has length 158 [2022-07-22 23:53:44,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:53:44,980 INFO L495 AbstractCegarLoop]: Abstraction has 4413 states and 6013 transitions. [2022-07-22 23:53:44,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 5 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 5 states have call predecessors, (18), 4 states have call successors, (18) [2022-07-22 23:53:44,980 INFO L276 IsEmpty]: Start isEmpty. Operand 4413 states and 6013 transitions. [2022-07-22 23:53:44,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-07-22 23:53:44,991 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:53:44,991 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:53:45,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-22 23:53:45,208 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-22 23:53:45,208 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:53:45,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:53:45,209 INFO L85 PathProgramCache]: Analyzing trace with hash 484822487, now seen corresponding path program 1 times [2022-07-22 23:53:45,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 23:53:45,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1637099626] [2022-07-22 23:53:45,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:53:45,210 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 23:53:45,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 23:53:45,212 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-22 23:53:45,214 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-22 23:53:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:45,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-22 23:53:45,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:53:46,126 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 23:53:46,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 41 [2022-07-22 23:53:46,207 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2022-07-22 23:53:46,208 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:53:46,208 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 23:53:46,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1637099626] [2022-07-22 23:53:46,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1637099626] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:53:46,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:53:46,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 23:53:46,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037133030] [2022-07-22 23:53:46,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:53:46,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 23:53:46,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 23:53:46,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 23:53:46,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-22 23:53:46,210 INFO L87 Difference]: Start difference. First operand 4413 states and 6013 transitions. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 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-22 23:53:52,732 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:53:54,743 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:53:56,753 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:53:58,763 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:54:00,776 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:54:02,796 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:54:04,815 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:54:07,874 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:54:09,207 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:54:12,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:54:12,405 INFO L93 Difference]: Finished difference Result 8878 states and 12123 transitions. [2022-07-22 23:54:12,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 23:54:12,410 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 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 193 [2022-07-22 23:54:12,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:54:12,432 INFO L225 Difference]: With dead ends: 8878 [2022-07-22 23:54:12,432 INFO L226 Difference]: Without dead ends: 4515 [2022-07-22 23:54:12,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2022-07-22 23:54:12,445 INFO L413 NwaCegarLoop]: 874 mSDtfsCounter, 128 mSDsluCounter, 5712 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 29 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 6586 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.7s IncrementalHoareTripleChecker+Time [2022-07-22 23:54:12,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 6586 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 422 Invalid, 6 Unknown, 0 Unchecked, 25.7s Time] [2022-07-22 23:54:12,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4515 states. [2022-07-22 23:54:12,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4515 to 4443. [2022-07-22 23:54:12,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4443 states, 3408 states have (on average 1.3488849765258215) internal successors, (4597), 3481 states have internal predecessors, (4597), 683 states have call successors, (683), 334 states have call predecessors, (683), 351 states have return successors, (769), 673 states have call predecessors, (769), 682 states have call successors, (769) [2022-07-22 23:54:12,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4443 states to 4443 states and 6049 transitions. [2022-07-22 23:54:12,609 INFO L78 Accepts]: Start accepts. Automaton has 4443 states and 6049 transitions. Word has length 193 [2022-07-22 23:54:12,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:54:12,610 INFO L495 AbstractCegarLoop]: Abstraction has 4443 states and 6049 transitions. [2022-07-22 23:54:12,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 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-22 23:54:12,610 INFO L276 IsEmpty]: Start isEmpty. Operand 4443 states and 6049 transitions. [2022-07-22 23:54:12,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-07-22 23:54:12,620 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:54:12,620 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:54:12,643 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-22 23:54:12,840 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-22 23:54:12,840 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:54:12,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:54:12,841 INFO L85 PathProgramCache]: Analyzing trace with hash -7803687, now seen corresponding path program 1 times [2022-07-22 23:54:12,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 23:54:12,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1474719211] [2022-07-22 23:54:12,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:54:12,842 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 23:54:12,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 23:54:12,843 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-22 23:54:12,845 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-22 23:54:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:54:13,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 23:54:13,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:54:13,420 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2022-07-22 23:54:13,420 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:54:13,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 23:54:13,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1474719211] [2022-07-22 23:54:13,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1474719211] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:54:13,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:54:13,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 23:54:13,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161998044] [2022-07-22 23:54:13,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:54:13,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 23:54:13,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 23:54:13,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 23:54:13,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 23:54:13,423 INFO L87 Difference]: Start difference. First operand 4443 states and 6049 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-22 23:54:13,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:54:13,591 INFO L93 Difference]: Finished difference Result 8886 states and 12152 transitions. [2022-07-22 23:54:13,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 23:54:13,592 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) Word has length 193 [2022-07-22 23:54:13,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:54:13,612 INFO L225 Difference]: With dead ends: 8886 [2022-07-22 23:54:13,612 INFO L226 Difference]: Without dead ends: 4493 [2022-07-22 23:54:13,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 23:54:13,626 INFO L413 NwaCegarLoop]: 883 mSDtfsCounter, 2 mSDsluCounter, 2631 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3514 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 23:54:13,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3514 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 23:54:13,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4493 states. [2022-07-22 23:54:13,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4493 to 4475. [2022-07-22 23:54:13,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4475 states, 3432 states have (on average 1.3464452214452214) internal successors, (4621), 3505 states have internal predecessors, (4621), 683 states have call successors, (683), 334 states have call predecessors, (683), 359 states have return successors, (785), 681 states have call predecessors, (785), 682 states have call successors, (785) [2022-07-22 23:54:13,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4475 states to 4475 states and 6089 transitions. [2022-07-22 23:54:13,785 INFO L78 Accepts]: Start accepts. Automaton has 4475 states and 6089 transitions. Word has length 193 [2022-07-22 23:54:13,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:54:13,785 INFO L495 AbstractCegarLoop]: Abstraction has 4475 states and 6089 transitions. [2022-07-22 23:54:13,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-22 23:54:13,786 INFO L276 IsEmpty]: Start isEmpty. Operand 4475 states and 6089 transitions. [2022-07-22 23:54:13,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-07-22 23:54:13,795 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:54:13,795 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 4, 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] [2022-07-22 23:54:13,819 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-22 23:54:14,015 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-22 23:54:14,016 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:54:14,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:54:14,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1515483270, now seen corresponding path program 1 times [2022-07-22 23:54:14,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 23:54:14,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [284549606] [2022-07-22 23:54:14,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:54:14,018 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 23:54:14,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 23:54:14,019 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-22 23:54:14,021 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-22 23:54:14,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:54:14,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 23:54:14,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:54:14,547 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2022-07-22 23:54:14,548 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:54:14,549 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 23:54:14,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [284549606] [2022-07-22 23:54:14,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [284549606] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:54:14,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:54:14,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 23:54:14,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613999919] [2022-07-22 23:54:14,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:54:14,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 23:54:14,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 23:54:14,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 23:54:14,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 23:54:14,552 INFO L87 Difference]: Start difference. First operand 4475 states and 6089 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 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-22 23:54:15,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:54:15,041 INFO L93 Difference]: Finished difference Result 10570 states and 14339 transitions. [2022-07-22 23:54:15,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 23:54:15,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 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 215 [2022-07-22 23:54:15,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:54:15,068 INFO L225 Difference]: With dead ends: 10570 [2022-07-22 23:54:15,069 INFO L226 Difference]: Without dead ends: 6145 [2022-07-22 23:54:15,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 213 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-22 23:54:15,084 INFO L413 NwaCegarLoop]: 1515 mSDtfsCounter, 934 mSDsluCounter, 2136 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 3651 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 23:54:15,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 3651 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 23:54:15,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6145 states. [2022-07-22 23:54:15,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6145 to 4483. [2022-07-22 23:54:15,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4483 states, 3440 states have (on average 1.345639534883721) internal successors, (4629), 3513 states have internal predecessors, (4629), 683 states have call successors, (683), 334 states have call predecessors, (683), 359 states have return successors, (785), 681 states have call predecessors, (785), 682 states have call successors, (785) [2022-07-22 23:54:15,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4483 states to 4483 states and 6097 transitions. [2022-07-22 23:54:15,262 INFO L78 Accepts]: Start accepts. Automaton has 4483 states and 6097 transitions. Word has length 215 [2022-07-22 23:54:15,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:54:15,262 INFO L495 AbstractCegarLoop]: Abstraction has 4483 states and 6097 transitions. [2022-07-22 23:54:15,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 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-22 23:54:15,263 INFO L276 IsEmpty]: Start isEmpty. Operand 4483 states and 6097 transitions. [2022-07-22 23:54:15,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-07-22 23:54:15,272 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:54:15,272 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:54:15,297 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-22 23:54:15,492 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-22 23:54:15,493 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:54:15,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:54:15,493 INFO L85 PathProgramCache]: Analyzing trace with hash -592633712, now seen corresponding path program 1 times [2022-07-22 23:54:15,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 23:54:15,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1772534532] [2022-07-22 23:54:15,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:54:15,494 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 23:54:15,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 23:54:15,495 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-22 23:54:15,497 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-22 23:54:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:54:15,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 820 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-22 23:54:15,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:54:16,465 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2022-07-22 23:54:16,465 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:54:16,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 23:54:16,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1772534532] [2022-07-22 23:54:16,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1772534532] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:54:16,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:54:16,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-22 23:54:16,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516681876] [2022-07-22 23:54:16,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:54:16,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-22 23:54:16,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 23:54:16,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-22 23:54:16,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-22 23:54:16,468 INFO L87 Difference]: Start difference. First operand 4483 states and 6097 transitions. Second operand has 12 states, 12 states have (on average 9.75) internal successors, (117), 9 states have internal predecessors, (117), 3 states have call successors, (24), 2 states have call predecessors, (24), 5 states have return successors, (23), 6 states have call predecessors, (23), 3 states have call successors, (23) [2022-07-22 23:54:17,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:54:17,147 INFO L93 Difference]: Finished difference Result 10681 states and 14957 transitions. [2022-07-22 23:54:17,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 23:54:17,148 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.75) internal successors, (117), 9 states have internal predecessors, (117), 3 states have call successors, (24), 2 states have call predecessors, (24), 5 states have return successors, (23), 6 states have call predecessors, (23), 3 states have call successors, (23) Word has length 200 [2022-07-22 23:54:17,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:54:17,170 INFO L225 Difference]: With dead ends: 10681 [2022-07-22 23:54:17,170 INFO L226 Difference]: Without dead ends: 6248 [2022-07-22 23:54:17,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-07-22 23:54:17,184 INFO L413 NwaCegarLoop]: 1378 mSDtfsCounter, 362 mSDsluCounter, 13282 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 14660 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 23:54:17,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 14660 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 23:54:17,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6248 states. [2022-07-22 23:54:17,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6248 to 4525. [2022-07-22 23:54:17,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4525 states, 3470 states have (on average 1.3403458213256485) internal successors, (4651), 3543 states have internal predecessors, (4651), 683 states have call successors, (683), 334 states have call predecessors, (683), 371 states have return successors, (801), 693 states have call predecessors, (801), 682 states have call successors, (801) [2022-07-22 23:54:17,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4525 states to 4525 states and 6135 transitions. [2022-07-22 23:54:17,441 INFO L78 Accepts]: Start accepts. Automaton has 4525 states and 6135 transitions. Word has length 200 [2022-07-22 23:54:17,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:54:17,443 INFO L495 AbstractCegarLoop]: Abstraction has 4525 states and 6135 transitions. [2022-07-22 23:54:17,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.75) internal successors, (117), 9 states have internal predecessors, (117), 3 states have call successors, (24), 2 states have call predecessors, (24), 5 states have return successors, (23), 6 states have call predecessors, (23), 3 states have call successors, (23) [2022-07-22 23:54:17,444 INFO L276 IsEmpty]: Start isEmpty. Operand 4525 states and 6135 transitions. [2022-07-22 23:54:17,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-07-22 23:54:17,453 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:54:17,453 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 4, 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] [2022-07-22 23:54:17,476 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-22 23:54:17,671 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-22 23:54:17,672 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:54:17,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:54:17,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1833099563, now seen corresponding path program 1 times [2022-07-22 23:54:17,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 23:54:17,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [209990891] [2022-07-22 23:54:17,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:54:17,673 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 23:54:17,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 23:54:17,676 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-22 23:54:17,678 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-22 23:54:18,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:54:18,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 898 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 23:54:18,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:54:18,450 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2022-07-22 23:54:18,450 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:54:18,451 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 23:54:18,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [209990891] [2022-07-22 23:54:18,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [209990891] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:54:18,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:54:18,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 23:54:18,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359741137] [2022-07-22 23:54:18,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:54:18,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 23:54:18,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 23:54:18,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 23:54:18,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 23:54:18,452 INFO L87 Difference]: Start difference. First operand 4525 states and 6135 transitions. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 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-22 23:54:19,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:54:19,126 INFO L93 Difference]: Finished difference Result 10696 states and 14455 transitions. [2022-07-22 23:54:19,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 23:54:19,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 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 226 [2022-07-22 23:54:19,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:54:19,148 INFO L225 Difference]: With dead ends: 10696 [2022-07-22 23:54:19,148 INFO L226 Difference]: Without dead ends: 6221 [2022-07-22 23:54:19,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 223 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-22 23:54:19,160 INFO L413 NwaCegarLoop]: 1510 mSDtfsCounter, 1212 mSDsluCounter, 3340 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1218 SdHoareTripleChecker+Valid, 4850 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-22 23:54:19,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1218 Valid, 4850 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-22 23:54:19,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6221 states. [2022-07-22 23:54:19,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6221 to 4529. [2022-07-22 23:54:19,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4529 states, 3474 states have (on average 1.3399539435808865) internal successors, (4655), 3543 states have internal predecessors, (4655), 683 states have call successors, (683), 334 states have call predecessors, (683), 371 states have return successors, (801), 693 states have call predecessors, (801), 682 states have call successors, (801) [2022-07-22 23:54:19,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4529 states to 4529 states and 6139 transitions. [2022-07-22 23:54:19,348 INFO L78 Accepts]: Start accepts. Automaton has 4529 states and 6139 transitions. Word has length 226 [2022-07-22 23:54:19,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:54:19,349 INFO L495 AbstractCegarLoop]: Abstraction has 4529 states and 6139 transitions. [2022-07-22 23:54:19,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 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-22 23:54:19,349 INFO L276 IsEmpty]: Start isEmpty. Operand 4529 states and 6139 transitions. [2022-07-22 23:54:19,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2022-07-22 23:54:19,358 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:54:19,358 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:54:19,386 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-22 23:54:19,574 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-22 23:54:19,575 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:54:19,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:54:19,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1966699871, now seen corresponding path program 1 times [2022-07-22 23:54:19,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 23:54:19,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1525975929] [2022-07-22 23:54:19,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:54:19,577 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 23:54:19,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 23:54:19,578 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-22 23:54:19,580 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-22 23:54:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:54:20,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 1014 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-22 23:54:20,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:54:20,993 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 98 proven. 8 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2022-07-22 23:54:20,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 23:54:22,386 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2022-07-22 23:54:22,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 23:54:22,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1525975929] [2022-07-22 23:54:22,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1525975929] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 23:54:22,387 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 23:54:22,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2022-07-22 23:54:22,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925791558] [2022-07-22 23:54:22,387 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 23:54:22,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-22 23:54:22,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 23:54:22,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-22 23:54:22,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-07-22 23:54:22,389 INFO L87 Difference]: Start difference. First operand 4529 states and 6139 transitions. Second operand has 15 states, 15 states have (on average 15.466666666666667) internal successors, (232), 15 states have internal predecessors, (232), 9 states have call successors, (46), 7 states have call predecessors, (46), 10 states have return successors, (45), 12 states have call predecessors, (45), 9 states have call successors, (45) [2022-07-22 23:54:28,011 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:54:30,027 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:54:32,034 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:54:35,147 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:54:37,164 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:54:39,176 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:54:41,224 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:54:43,238 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:54:52,771 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:54:54,784 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:54:56,794 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:54:58,803 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:55:00,839 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:55:02,849 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:55:04,859 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:55:08,126 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:55:10,137 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:55:12,145 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:55:14,171 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:55:16,179 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:55:18,190 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:55:21,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:55:21,907 INFO L93 Difference]: Finished difference Result 13740 states and 19055 transitions. [2022-07-22 23:55:21,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-22 23:55:21,908 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 15.466666666666667) internal successors, (232), 15 states have internal predecessors, (232), 9 states have call successors, (46), 7 states have call predecessors, (46), 10 states have return successors, (45), 12 states have call predecessors, (45), 9 states have call successors, (45) Word has length 233 [2022-07-22 23:55:21,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:55:21,946 INFO L225 Difference]: With dead ends: 13740 [2022-07-22 23:55:21,946 INFO L226 Difference]: Without dead ends: 11260 [2022-07-22 23:55:21,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 456 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=204, Invalid=552, Unknown=0, NotChecked=0, Total=756 [2022-07-22 23:55:21,958 INFO L413 NwaCegarLoop]: 1513 mSDtfsCounter, 7074 mSDsluCounter, 5200 mSDsCounter, 0 mSdLazyCounter, 4842 mSolverCounterSat, 2421 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 56.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7279 SdHoareTripleChecker+Valid, 6713 SdHoareTripleChecker+Invalid, 7284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2421 IncrementalHoareTripleChecker+Valid, 4842 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 58.4s IncrementalHoareTripleChecker+Time [2022-07-22 23:55:21,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7279 Valid, 6713 Invalid, 7284 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2421 Valid, 4842 Invalid, 21 Unknown, 0 Unchecked, 58.4s Time] [2022-07-22 23:55:21,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11260 states. [2022-07-22 23:55:22,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11260 to 11074. [2022-07-22 23:55:22,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11074 states, 8498 states have (on average 1.346199105671923) internal successors, (11440), 8682 states have internal predecessors, (11440), 1673 states have call successors, (1673), 797 states have call predecessors, (1673), 902 states have return successors, (2048), 1701 states have call predecessors, (2048), 1672 states have call successors, (2048) [2022-07-22 23:55:22,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11074 states to 11074 states and 15161 transitions. [2022-07-22 23:55:22,456 INFO L78 Accepts]: Start accepts. Automaton has 11074 states and 15161 transitions. Word has length 233 [2022-07-22 23:55:22,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:55:22,458 INFO L495 AbstractCegarLoop]: Abstraction has 11074 states and 15161 transitions. [2022-07-22 23:55:22,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 15.466666666666667) internal successors, (232), 15 states have internal predecessors, (232), 9 states have call successors, (46), 7 states have call predecessors, (46), 10 states have return successors, (45), 12 states have call predecessors, (45), 9 states have call successors, (45) [2022-07-22 23:55:22,459 INFO L276 IsEmpty]: Start isEmpty. Operand 11074 states and 15161 transitions. [2022-07-22 23:55:22,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2022-07-22 23:55:22,468 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:55:22,468 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:55:22,503 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-22 23:55:22,682 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-22 23:55:22,683 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:55:22,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:55:22,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1802197632, now seen corresponding path program 1 times [2022-07-22 23:55:22,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 23:55:22,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1815958716] [2022-07-22 23:55:22,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:55:22,684 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 23:55:22,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 23:55:22,685 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-22 23:55:22,687 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-22 23:55:23,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:55:23,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 1018 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 23:55:23,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:55:23,415 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2022-07-22 23:55:23,415 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:55:23,415 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 23:55:23,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1815958716] [2022-07-22 23:55:23,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1815958716] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:55:23,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:55:23,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 23:55:23,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466172214] [2022-07-22 23:55:23,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:55:23,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 23:55:23,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 23:55:23,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 23:55:23,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 23:55:23,417 INFO L87 Difference]: Start difference. First operand 11074 states and 15161 transitions. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-22 23:55:23,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:55:23,898 INFO L93 Difference]: Finished difference Result 20193 states and 27862 transitions. [2022-07-22 23:55:23,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 23:55:23,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 235 [2022-07-22 23:55:23,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:55:23,938 INFO L225 Difference]: With dead ends: 20193 [2022-07-22 23:55:23,939 INFO L226 Difference]: Without dead ends: 11164 [2022-07-22 23:55:23,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 232 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-22 23:55:23,962 INFO L413 NwaCegarLoop]: 881 mSDtfsCounter, 10 mSDsluCounter, 1755 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2636 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 23:55:23,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2636 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 23:55:23,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11164 states. [2022-07-22 23:55:24,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11164 to 11104. [2022-07-22 23:55:24,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11104 states, 8528 states have (on average 1.3461538461538463) internal successors, (11480), 8712 states have internal predecessors, (11480), 1673 states have call successors, (1673), 797 states have call predecessors, (1673), 902 states have return successors, (2048), 1701 states have call predecessors, (2048), 1672 states have call successors, (2048) [2022-07-22 23:55:24,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11104 states to 11104 states and 15201 transitions. [2022-07-22 23:55:24,686 INFO L78 Accepts]: Start accepts. Automaton has 11104 states and 15201 transitions. Word has length 235 [2022-07-22 23:55:24,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:55:24,687 INFO L495 AbstractCegarLoop]: Abstraction has 11104 states and 15201 transitions. [2022-07-22 23:55:24,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-22 23:55:24,688 INFO L276 IsEmpty]: Start isEmpty. Operand 11104 states and 15201 transitions. [2022-07-22 23:55:24,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2022-07-22 23:55:24,696 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:55:24,696 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 3, 3, 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] [2022-07-22 23:55:24,735 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-22 23:55:24,915 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-22 23:55:24,916 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:55:24,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:55:24,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1056928775, now seen corresponding path program 1 times [2022-07-22 23:55:24,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 23:55:24,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24422699] [2022-07-22 23:55:24,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:55:24,918 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 23:55:24,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 23:55:24,919 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-22 23:55:24,921 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-22 23:55:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:55:25,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 1020 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-22 23:55:25,599 INFO L286 TraceCheckSpWp]: Computing forward predicates...