./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 eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--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-?-eb692b5 [2022-07-19 23:37:56,691 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 23:37:56,693 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 23:37:56,730 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 23:37:56,731 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 23:37:56,732 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 23:37:56,734 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 23:37:56,740 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 23:37:56,741 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 23:37:56,747 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 23:37:56,748 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 23:37:56,749 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 23:37:56,749 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 23:37:56,751 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 23:37:56,752 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 23:37:56,754 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 23:37:56,755 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 23:37:56,755 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 23:37:56,757 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 23:37:56,758 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 23:37:56,759 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 23:37:56,760 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 23:37:56,761 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 23:37:56,762 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 23:37:56,763 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 23:37:56,766 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 23:37:56,768 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 23:37:56,769 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 23:37:56,770 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 23:37:56,770 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 23:37:56,771 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 23:37:56,772 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 23:37:56,773 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 23:37:56,774 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 23:37:56,775 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 23:37:56,775 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 23:37:56,775 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 23:37:56,776 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 23:37:56,776 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 23:37:56,776 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 23:37:56,777 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 23:37:56,779 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 23:37:56,781 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-19 23:37:56,806 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 23:37:56,813 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 23:37:56,813 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 23:37:56,813 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 23:37:56,814 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 23:37:56,815 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 23:37:56,815 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 23:37:56,815 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 23:37:56,815 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 23:37:56,816 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 23:37:56,817 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 23:37:56,817 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 23:37:56,817 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 23:37:56,817 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 23:37:56,817 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 23:37:56,818 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 23:37:56,818 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 23:37:56,818 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 23:37:56,818 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 23:37:56,818 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 23:37:56,819 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 23:37:56,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 23:37:56,819 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 23:37:56,819 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 23:37:56,820 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 23:37:56,820 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 23:37:56,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 23:37:56,820 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 23:37:56,820 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 23:37:56,821 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 23:37:56,821 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-19 23:37:57,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 23:37:57,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 23:37:57,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 23:37:57,067 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 23:37:57,067 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 23:37:57,068 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-19 23:37:57,130 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d4449e71/269bf7f1f2cb462f81e2ab39a5c3ada1/FLAGc9b00abbf [2022-07-19 23:37:57,822 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 23:37:57,825 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-19 23:37:57,870 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d4449e71/269bf7f1f2cb462f81e2ab39a5c3ada1/FLAGc9b00abbf [2022-07-19 23:37:57,942 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d4449e71/269bf7f1f2cb462f81e2ab39a5c3ada1 [2022-07-19 23:37:57,945 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 23:37:57,946 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 23:37:57,949 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 23:37:57,949 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 23:37:57,952 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 23:37:57,952 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:37:57" (1/1) ... [2022-07-19 23:37:57,953 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b2ff651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:37:57, skipping insertion in model container [2022-07-19 23:37:57,954 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:37:57" (1/1) ... [2022-07-19 23:37:57,960 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 23:37:58,044 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 23:37:58,759 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-19 23:37:59,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 23:37:59,090 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 23:37:59,259 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-19 23:37:59,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 23:37:59,425 INFO L208 MainTranslator]: Completed translation [2022-07-19 23:37:59,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:37:59 WrapperNode [2022-07-19 23:37:59,427 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 23:37:59,428 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 23:37:59,429 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 23:37:59,429 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 23:37:59,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:37:59" (1/1) ... [2022-07-19 23:37:59,486 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:37:59" (1/1) ... [2022-07-19 23:37:59,581 INFO L137 Inliner]: procedures = 176, calls = 448, calls flagged for inlining = 92, calls inlined = 85, statements flattened = 1769 [2022-07-19 23:37:59,581 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 23:37:59,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 23:37:59,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 23:37:59,583 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 23:37:59,590 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:37:59" (1/1) ... [2022-07-19 23:37:59,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:37:59" (1/1) ... [2022-07-19 23:37:59,613 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:37:59" (1/1) ... [2022-07-19 23:37:59,613 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:37:59" (1/1) ... [2022-07-19 23:37:59,684 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:37:59" (1/1) ... [2022-07-19 23:37:59,698 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:37:59" (1/1) ... [2022-07-19 23:37:59,708 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:37:59" (1/1) ... [2022-07-19 23:37:59,744 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 23:37:59,745 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 23:37:59,745 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 23:37:59,745 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 23:37:59,746 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:37:59" (1/1) ... [2022-07-19 23:37:59,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 23:37:59,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:37:59,799 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 23:37:59,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 23:37:59,832 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-19 23:37:59,832 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-19 23:37:59,832 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_alloc_skb_15 [2022-07-19 23:37:59,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_alloc_skb_15 [2022-07-19 23:37:59,833 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_sync_poll [2022-07-19 23:37:59,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_sync_poll [2022-07-19 23:37:59,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-19 23:37:59,833 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reserve [2022-07-19 23:37:59,833 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reserve [2022-07-19 23:37:59,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-19 23:37:59,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-19 23:37:59,834 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-19 23:37:59,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-19 23:37:59,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 23:37:59,834 INFO L130 BoogieDeclarations]: Found specification of procedure skb_push [2022-07-19 23:37:59,834 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_push [2022-07-19 23:37:59,834 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_output_wakeup [2022-07-19 23:37:59,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_output_wakeup [2022-07-19 23:37:59,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-19 23:37:59,835 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-19 23:37:59,835 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2022-07-19 23:37:59,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2022-07-19 23:37:59,835 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-19 23:37:59,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-19 23:37:59,835 INFO L130 BoogieDeclarations]: Found specification of procedure spin_trylock_bh [2022-07-19 23:37:59,836 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_trylock_bh [2022-07-19 23:37:59,836 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-19 23:37:59,836 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-19 23:37:59,836 INFO L130 BoogieDeclarations]: Found specification of procedure skb_trim [2022-07-19 23:37:59,836 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_trim [2022-07-19 23:37:59,836 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-07-19 23:37:59,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-07-19 23:37:59,837 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_synctty_ioctl [2022-07-19 23:37:59,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_synctty_ioctl [2022-07-19 23:37:59,837 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-19 23:37:59,837 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-19 23:37:59,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 23:37:59,837 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-19 23:37:59,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-19 23:37:59,838 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2022-07-19 23:37:59,838 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2022-07-19 23:37:59,838 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_sync_close [2022-07-19 23:37:59,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_sync_close [2022-07-19 23:37:59,838 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-19 23:37:59,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-19 23:37:59,838 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-19 23:37:59,839 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-19 23:37:59,839 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_print_buffer [2022-07-19 23:37:59,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_print_buffer [2022-07-19 23:37:59,839 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-19 23:37:59,839 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-19 23:37:59,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 23:37:59,839 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-07-19 23:37:59,840 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-07-19 23:37:59,840 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-19 23:37:59,840 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-19 23:37:59,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 23:37:59,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 23:37:59,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 23:37:59,843 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-07-19 23:37:59,843 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-07-19 23:37:59,843 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_schedule [2022-07-19 23:37:59,844 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_schedule [2022-07-19 23:37:59,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 23:37:59,844 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-07-19 23:37:59,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-07-19 23:37:59,844 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec_and_test [2022-07-19 23:37:59,844 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec_and_test [2022-07-19 23:37:59,844 INFO L130 BoogieDeclarations]: Found specification of procedure sp_put [2022-07-19 23:37:59,845 INFO L138 BoogieDeclarations]: Found implementation of procedure sp_put [2022-07-19 23:37:59,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 23:37:59,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 23:37:59,846 INFO L130 BoogieDeclarations]: Found specification of procedure skb_queue_tail [2022-07-19 23:37:59,846 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_queue_tail [2022-07-19 23:37:59,846 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_sync_hangup [2022-07-19 23:37:59,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_sync_hangup [2022-07-19 23:37:59,846 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-19 23:37:59,846 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-19 23:37:59,846 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-07-19 23:37:59,847 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-07-19 23:37:59,847 INFO L130 BoogieDeclarations]: Found specification of procedure sp_get [2022-07-19 23:37:59,847 INFO L138 BoogieDeclarations]: Found implementation of procedure sp_get [2022-07-19 23:37:59,847 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-19 23:37:59,847 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-19 23:37:59,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 23:37:59,847 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2022-07-19 23:37:59,848 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2022-07-19 23:37:59,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-19 23:37:59,848 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-19 23:37:59,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-19 23:37:59,848 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-07-19 23:37:59,848 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-07-19 23:37:59,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 23:37:59,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 23:37:59,849 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_sync_push [2022-07-19 23:37:59,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_sync_push [2022-07-19 23:38:00,256 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 23:38:00,259 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 23:38:00,375 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-19 23:38:01,384 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 23:38:01,394 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 23:38:01,394 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-19 23:38:01,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:38:01 BoogieIcfgContainer [2022-07-19 23:38:01,397 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 23:38:01,398 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 23:38:01,398 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 23:38:01,403 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 23:38:01,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 11:37:57" (1/3) ... [2022-07-19 23:38:01,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74843546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:38:01, skipping insertion in model container [2022-07-19 23:38:01,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:37:59" (2/3) ... [2022-07-19 23:38:01,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74843546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:38:01, skipping insertion in model container [2022-07-19 23:38:01,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:38:01" (3/3) ... [2022-07-19 23:38:01,406 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-19 23:38:01,418 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 23:38:01,418 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 23:38:01,493 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 23:38:01,499 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@438b148f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2f132e9a [2022-07-19 23:38:01,500 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 23:38:01,508 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-19 23:38:01,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-19 23:38:01,528 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:38:01,528 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-19 23:38:01,529 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:38:01,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:38:01,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1758611482, now seen corresponding path program 1 times [2022-07-19 23:38:01,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:38:01,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059871880] [2022-07-19 23:38:01,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:38:01,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:38:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:01,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:38:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:01,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:38:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:01,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:38:01,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:01,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:38:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:01,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:38:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:01,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 23:38:01,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:01,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:38:01,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:01,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 23:38:01,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:01,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 23:38:01,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:01,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 23:38:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:01,997 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-19 23:38:01,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:38:01,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059871880] [2022-07-19 23:38:01,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059871880] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:38:01,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:38:01,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 23:38:02,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107421667] [2022-07-19 23:38:02,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:38:02,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 23:38:02,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:38:02,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 23:38:02,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 23:38:02,053 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-19 23:38:03,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:38:03,662 INFO L93 Difference]: Finished difference Result 2033 states and 2996 transitions. [2022-07-19 23:38:03,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 23:38:03,665 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-19 23:38:03,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:38:03,687 INFO L225 Difference]: With dead ends: 2033 [2022-07-19 23:38:03,687 INFO L226 Difference]: Without dead ends: 1378 [2022-07-19 23:38:03,697 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-19 23:38:03,700 INFO L413 NwaCegarLoop]: 979 mSDtfsCounter, 1248 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1336 SdHoareTripleChecker+Valid, 1944 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 331 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-19 23:38:03,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1336 Valid, 1944 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [331 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-19 23:38:03,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2022-07-19 23:38:03,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 1222. [2022-07-19 23:38:03,857 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-19 23:38:03,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1709 transitions. [2022-07-19 23:38:03,866 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1709 transitions. Word has length 78 [2022-07-19 23:38:03,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:38:03,867 INFO L495 AbstractCegarLoop]: Abstraction has 1222 states and 1709 transitions. [2022-07-19 23:38:03,868 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-19 23:38:03,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1709 transitions. [2022-07-19 23:38:03,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-19 23:38:03,872 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:38:03,872 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-19 23:38:03,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 23:38:03,873 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:38:03,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:38:03,873 INFO L85 PathProgramCache]: Analyzing trace with hash -152487068, now seen corresponding path program 1 times [2022-07-19 23:38:03,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:38:03,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595030762] [2022-07-19 23:38:03,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:38:03,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:38:03,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:04,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:38:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:04,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:38:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:04,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:38:04,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:04,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:38:04,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:04,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:38:04,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:04,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 23:38:04,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:04,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:38:04,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:04,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 23:38:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:04,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 23:38:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:04,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 23:38:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:04,137 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-19 23:38:04,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:38:04,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595030762] [2022-07-19 23:38:04,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595030762] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:38:04,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:38:04,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 23:38:04,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159054706] [2022-07-19 23:38:04,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:38:04,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 23:38:04,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:38:04,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 23:38:04,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 23:38:04,141 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-19 23:38:06,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:38:06,116 INFO L93 Difference]: Finished difference Result 3917 states and 5611 transitions. [2022-07-19 23:38:06,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 23:38:06,116 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-19 23:38:06,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:38:06,136 INFO L225 Difference]: With dead ends: 3917 [2022-07-19 23:38:06,137 INFO L226 Difference]: Without dead ends: 2713 [2022-07-19 23:38:06,140 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-19 23:38:06,142 INFO L413 NwaCegarLoop]: 1017 mSDtfsCounter, 1263 mSDsluCounter, 2252 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1355 SdHoareTripleChecker+Valid, 3269 SdHoareTripleChecker+Invalid, 1999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-19 23:38:06,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1355 Valid, 3269 Invalid, 1999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1674 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-19 23:38:06,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2713 states. [2022-07-19 23:38:06,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2713 to 2509. [2022-07-19 23:38:06,245 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-19 23:38:06,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2509 states to 2509 states and 3560 transitions. [2022-07-19 23:38:06,259 INFO L78 Accepts]: Start accepts. Automaton has 2509 states and 3560 transitions. Word has length 82 [2022-07-19 23:38:06,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:38:06,260 INFO L495 AbstractCegarLoop]: Abstraction has 2509 states and 3560 transitions. [2022-07-19 23:38:06,261 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-19 23:38:06,262 INFO L276 IsEmpty]: Start isEmpty. Operand 2509 states and 3560 transitions. [2022-07-19 23:38:06,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-19 23:38:06,273 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:38:06,273 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-19 23:38:06,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 23:38:06,274 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:38:06,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:38:06,274 INFO L85 PathProgramCache]: Analyzing trace with hash -950375967, now seen corresponding path program 1 times [2022-07-19 23:38:06,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:38:06,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53890996] [2022-07-19 23:38:06,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:38:06,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:38:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:06,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:38:06,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:06,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:38:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:06,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:38:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:06,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:38:06,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:06,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:38:06,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:06,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 23:38:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:06,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:38:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:06,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 23:38:06,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:06,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 23:38:06,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:06,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 23:38:06,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:06,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 23:38:06,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:06,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 23:38:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:06,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:38:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:06,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:06,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 23:38:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:06,537 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-19 23:38:06,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:38:06,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53890996] [2022-07-19 23:38:06,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53890996] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:38:06,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:38:06,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 23:38:06,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83857844] [2022-07-19 23:38:06,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:38:06,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 23:38:06,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:38:06,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 23:38:06,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-19 23:38:06,542 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-19 23:38:08,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:38:08,597 INFO L93 Difference]: Finished difference Result 6827 states and 9761 transitions. [2022-07-19 23:38:08,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 23:38:08,598 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-19 23:38:08,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:38:08,647 INFO L225 Difference]: With dead ends: 6827 [2022-07-19 23:38:08,647 INFO L226 Difference]: Without dead ends: 4342 [2022-07-19 23:38:08,656 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-19 23:38:08,662 INFO L413 NwaCegarLoop]: 871 mSDtfsCounter, 1615 mSDsluCounter, 1620 mSDsCounter, 0 mSdLazyCounter, 1304 mSolverCounterSat, 793 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1688 SdHoareTripleChecker+Valid, 2491 SdHoareTripleChecker+Invalid, 2097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 793 IncrementalHoareTripleChecker+Valid, 1304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-19 23:38:08,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1688 Valid, 2491 Invalid, 2097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [793 Valid, 1304 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-19 23:38:08,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4342 states. [2022-07-19 23:38:08,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4342 to 3931. [2022-07-19 23:38:08,808 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-19 23:38:08,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3931 states to 3931 states and 5549 transitions. [2022-07-19 23:38:08,829 INFO L78 Accepts]: Start accepts. Automaton has 3931 states and 5549 transitions. Word has length 128 [2022-07-19 23:38:08,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:38:08,833 INFO L495 AbstractCegarLoop]: Abstraction has 3931 states and 5549 transitions. [2022-07-19 23:38:08,833 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-19 23:38:08,833 INFO L276 IsEmpty]: Start isEmpty. Operand 3931 states and 5549 transitions. [2022-07-19 23:38:08,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-07-19 23:38:08,846 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:38:08,846 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-19 23:38:08,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 23:38:08,849 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:38:08,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:38:08,850 INFO L85 PathProgramCache]: Analyzing trace with hash -944835305, now seen corresponding path program 1 times [2022-07-19 23:38:08,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:38:08,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074421547] [2022-07-19 23:38:08,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:38:08,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:38:08,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:08,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:38:08,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:08,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:38:08,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:08,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:38:08,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:08,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:38:08,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:08,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:38:08,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:08,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 23:38:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:08,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:38:08,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:08,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 23:38:08,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:08,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 23:38:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:08,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 23:38:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:08,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 23:38:08,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:08,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:08,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:08,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:38:08,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:08,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 23:38:08,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:09,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:09,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:38:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:09,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 23:38:09,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:09,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 23:38:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:09,021 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-19 23:38:09,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:38:09,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074421547] [2022-07-19 23:38:09,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074421547] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:38:09,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:38:09,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 23:38:09,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253618662] [2022-07-19 23:38:09,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:38:09,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 23:38:09,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:38:09,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 23:38:09,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 23:38:09,023 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-19 23:38:10,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:38:10,868 INFO L93 Difference]: Finished difference Result 9990 states and 14092 transitions. [2022-07-19 23:38:10,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 23:38:10,868 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-19 23:38:10,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:38:10,900 INFO L225 Difference]: With dead ends: 9990 [2022-07-19 23:38:10,901 INFO L226 Difference]: Without dead ends: 6083 [2022-07-19 23:38:10,915 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-19 23:38:10,916 INFO L413 NwaCegarLoop]: 1194 mSDtfsCounter, 1046 mSDsluCounter, 1541 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 411 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1101 SdHoareTripleChecker+Valid, 2735 SdHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 411 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-19 23:38:10,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1101 Valid, 2735 Invalid, 1554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [411 Valid, 1143 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-19 23:38:10,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6083 states. [2022-07-19 23:38:11,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6083 to 5590. [2022-07-19 23:38:11,123 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-19 23:38:11,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5590 states to 5590 states and 7782 transitions. [2022-07-19 23:38:11,149 INFO L78 Accepts]: Start accepts. Automaton has 5590 states and 7782 transitions. Word has length 149 [2022-07-19 23:38:11,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:38:11,150 INFO L495 AbstractCegarLoop]: Abstraction has 5590 states and 7782 transitions. [2022-07-19 23:38:11,150 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-19 23:38:11,150 INFO L276 IsEmpty]: Start isEmpty. Operand 5590 states and 7782 transitions. [2022-07-19 23:38:11,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-19 23:38:11,160 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:38:11,160 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-19 23:38:11,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 23:38:11,161 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:38:11,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:38:11,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1643009203, now seen corresponding path program 1 times [2022-07-19 23:38:11,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:38:11,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787927675] [2022-07-19 23:38:11,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:38:11,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:38:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:11,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:38:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:11,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:38:11,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:11,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:38:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:11,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:38:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:11,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:38:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:11,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 23:38:11,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:11,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:38:11,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:11,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 23:38:11,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:11,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 23:38:11,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:11,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 23:38:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:11,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 23:38:11,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:11,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 23:38:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:11,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 23:38:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:11,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 23:38:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:11,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:38:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:11,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:11,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:11,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 23:38:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:11,366 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-19 23:38:11,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:38:11,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787927675] [2022-07-19 23:38:11,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787927675] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:38:11,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:38:11,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 23:38:11,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796222367] [2022-07-19 23:38:11,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:38:11,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 23:38:11,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:38:11,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 23:38:11,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-19 23:38:11,369 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-19 23:38:13,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:38:13,799 INFO L93 Difference]: Finished difference Result 14712 states and 20604 transitions. [2022-07-19 23:38:13,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 23:38:13,800 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-19 23:38:13,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:38:13,840 INFO L225 Difference]: With dead ends: 14712 [2022-07-19 23:38:13,841 INFO L226 Difference]: Without dead ends: 9157 [2022-07-19 23:38:13,853 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-19 23:38:13,854 INFO L413 NwaCegarLoop]: 897 mSDtfsCounter, 1619 mSDsluCounter, 2014 mSDsCounter, 0 mSdLazyCounter, 1834 mSolverCounterSat, 654 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1696 SdHoareTripleChecker+Valid, 2911 SdHoareTripleChecker+Invalid, 2488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 654 IncrementalHoareTripleChecker+Valid, 1834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-19 23:38:13,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1696 Valid, 2911 Invalid, 2488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [654 Valid, 1834 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-19 23:38:13,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9157 states. [2022-07-19 23:38:14,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9157 to 8330. [2022-07-19 23:38:14,153 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-19 23:38:14,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8330 states to 8330 states and 11483 transitions. [2022-07-19 23:38:14,222 INFO L78 Accepts]: Start accepts. Automaton has 8330 states and 11483 transitions. Word has length 151 [2022-07-19 23:38:14,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:38:14,224 INFO L495 AbstractCegarLoop]: Abstraction has 8330 states and 11483 transitions. [2022-07-19 23:38:14,224 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-19 23:38:14,225 INFO L276 IsEmpty]: Start isEmpty. Operand 8330 states and 11483 transitions. [2022-07-19 23:38:14,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-19 23:38:14,236 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:38:14,236 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-19 23:38:14,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 23:38:14,237 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:38:14,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:38:14,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1373098194, now seen corresponding path program 1 times [2022-07-19 23:38:14,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:38:14,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050485666] [2022-07-19 23:38:14,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:38:14,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:38:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:14,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:38:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:14,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:38:14,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:14,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:38:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:14,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:38:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:14,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:38:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:14,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 23:38:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:14,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:38:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:14,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 23:38:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:14,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 23:38:14,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:14,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 23:38:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:14,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 23:38:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:14,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 23:38:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:14,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 23:38:14,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:14,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:14,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:14,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 23:38:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:14,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:38:14,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:14,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:14,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 23:38:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:14,458 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-19 23:38:14,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:38:14,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050485666] [2022-07-19 23:38:14,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050485666] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:38:14,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:38:14,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 23:38:14,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546734225] [2022-07-19 23:38:14,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:38:14,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 23:38:14,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:38:14,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 23:38:14,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-19 23:38:14,461 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-19 23:38:16,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:38:16,210 INFO L93 Difference]: Finished difference Result 13560 states and 19023 transitions. [2022-07-19 23:38:16,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 23:38:16,211 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-19 23:38:16,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:38:16,269 INFO L225 Difference]: With dead ends: 13560 [2022-07-19 23:38:16,270 INFO L226 Difference]: Without dead ends: 9164 [2022-07-19 23:38:16,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-19 23:38:16,289 INFO L413 NwaCegarLoop]: 822 mSDtfsCounter, 530 mSDsluCounter, 2011 mSDsCounter, 0 mSdLazyCounter, 1322 mSolverCounterSat, 314 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 2833 SdHoareTripleChecker+Invalid, 1636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 314 IncrementalHoareTripleChecker+Valid, 1322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-19 23:38:16,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 2833 Invalid, 1636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [314 Valid, 1322 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-19 23:38:16,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9164 states. [2022-07-19 23:38:16,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9164 to 8350. [2022-07-19 23:38:16,626 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-19 23:38:16,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8350 states to 8350 states and 11503 transitions. [2022-07-19 23:38:16,653 INFO L78 Accepts]: Start accepts. Automaton has 8350 states and 11503 transitions. Word has length 156 [2022-07-19 23:38:16,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:38:16,654 INFO L495 AbstractCegarLoop]: Abstraction has 8350 states and 11503 transitions. [2022-07-19 23:38:16,654 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-19 23:38:16,654 INFO L276 IsEmpty]: Start isEmpty. Operand 8350 states and 11503 transitions. [2022-07-19 23:38:16,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-19 23:38:16,668 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:38:16,668 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-19 23:38:16,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 23:38:16,669 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:38:16,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:38:16,669 INFO L85 PathProgramCache]: Analyzing trace with hash 554198863, now seen corresponding path program 1 times [2022-07-19 23:38:16,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:38:16,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076456516] [2022-07-19 23:38:16,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:38:16,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:38:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:16,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:38:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:16,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:38:16,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:16,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:38:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:16,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:38:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:16,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:38:16,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:16,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 23:38:16,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:16,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:38:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:16,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 23:38:16,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:16,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 23:38:16,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:16,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 23:38:16,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:16,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 23:38:16,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:16,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 23:38:16,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:16,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 23:38:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:16,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:16,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:16,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 23:38:16,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:16,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:38:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:16,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:17,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 23:38:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:17,037 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-19 23:38:17,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:38:17,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076456516] [2022-07-19 23:38:17,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076456516] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:38:17,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:38:17,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-19 23:38:17,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823581678] [2022-07-19 23:38:17,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:38:17,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 23:38:17,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:38:17,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 23:38:17,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-19 23:38:17,040 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-19 23:38:20,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:38:20,557 INFO L93 Difference]: Finished difference Result 18695 states and 25902 transitions. [2022-07-19 23:38:20,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-19 23:38:20,558 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-19 23:38:20,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:38:20,602 INFO L225 Difference]: With dead ends: 18695 [2022-07-19 23:38:20,602 INFO L226 Difference]: Without dead ends: 10380 [2022-07-19 23:38:20,627 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-19 23:38:20,628 INFO L413 NwaCegarLoop]: 971 mSDtfsCounter, 3198 mSDsluCounter, 2713 mSDsCounter, 0 mSdLazyCounter, 3371 mSolverCounterSat, 1688 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3287 SdHoareTripleChecker+Valid, 3684 SdHoareTripleChecker+Invalid, 5059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1688 IncrementalHoareTripleChecker+Valid, 3371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-19 23:38:20,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3287 Valid, 3684 Invalid, 5059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1688 Valid, 3371 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-19 23:38:20,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10380 states. [2022-07-19 23:38:21,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10380 to 8726. [2022-07-19 23:38:21,035 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-19 23:38:21,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8726 states to 8726 states and 11885 transitions. [2022-07-19 23:38:21,063 INFO L78 Accepts]: Start accepts. Automaton has 8726 states and 11885 transitions. Word has length 158 [2022-07-19 23:38:21,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:38:21,064 INFO L495 AbstractCegarLoop]: Abstraction has 8726 states and 11885 transitions. [2022-07-19 23:38:21,064 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-19 23:38:21,064 INFO L276 IsEmpty]: Start isEmpty. Operand 8726 states and 11885 transitions. [2022-07-19 23:38:21,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-07-19 23:38:21,082 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:38:21,082 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-19 23:38:21,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 23:38:21,083 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:38:21,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:38:21,083 INFO L85 PathProgramCache]: Analyzing trace with hash -3224619, now seen corresponding path program 1 times [2022-07-19 23:38:21,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:38:21,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349060958] [2022-07-19 23:38:21,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:38:21,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:38:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:21,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:38:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:21,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:38:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:21,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:38:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:21,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:38:21,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:21,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:38:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:21,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 23:38:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:21,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:38:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:21,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 23:38:21,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:21,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 23:38:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:21,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 23:38:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:21,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 23:38:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:21,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 23:38:21,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:21,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 23:38:21,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:21,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:21,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:21,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-19 23:38:21,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:21,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-19 23:38:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:21,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:21,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:21,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:21,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-19 23:38:21,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:21,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:21,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:21,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-19 23:38:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:21,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:21,487 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-19 23:38:21,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:38:21,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349060958] [2022-07-19 23:38:21,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349060958] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:38:21,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:38:21,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 23:38:21,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700471549] [2022-07-19 23:38:21,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:38:21,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 23:38:21,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:38:21,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 23:38:21,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-19 23:38:21,489 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-19 23:38:23,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:38:23,234 INFO L93 Difference]: Finished difference Result 18475 states and 25394 transitions. [2022-07-19 23:38:23,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 23:38:23,235 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-19 23:38:23,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:38:23,275 INFO L225 Difference]: With dead ends: 18475 [2022-07-19 23:38:23,276 INFO L226 Difference]: Without dead ends: 9784 [2022-07-19 23:38:23,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-19 23:38:23,305 INFO L413 NwaCegarLoop]: 840 mSDtfsCounter, 426 mSDsluCounter, 2381 mSDsCounter, 0 mSdLazyCounter, 1605 mSolverCounterSat, 293 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 3221 SdHoareTripleChecker+Invalid, 1898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 1605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-19 23:38:23,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 3221 Invalid, 1898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 1605 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-19 23:38:23,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9784 states. [2022-07-19 23:38:23,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9784 to 8790. [2022-07-19 23:38:23,668 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-19 23:38:23,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8790 states to 8790 states and 11957 transitions. [2022-07-19 23:38:23,700 INFO L78 Accepts]: Start accepts. Automaton has 8790 states and 11957 transitions. Word has length 193 [2022-07-19 23:38:23,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:38:23,701 INFO L495 AbstractCegarLoop]: Abstraction has 8790 states and 11957 transitions. [2022-07-19 23:38:23,701 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-19 23:38:23,701 INFO L276 IsEmpty]: Start isEmpty. Operand 8790 states and 11957 transitions. [2022-07-19 23:38:23,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-07-19 23:38:23,720 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:38:23,724 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-19 23:38:23,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 23:38:23,725 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:38:23,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:38:23,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1088928772, now seen corresponding path program 1 times [2022-07-19 23:38:23,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:38:23,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296231192] [2022-07-19 23:38:23,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:38:23,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:38:23,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:23,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:38:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:23,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:38:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:23,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:38:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:23,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:38:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:23,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:38:23,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:23,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 23:38:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:23,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:38:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:23,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 23:38:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:23,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 23:38:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:23,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 23:38:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:23,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 23:38:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:23,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 23:38:23,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:23,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-19 23:38:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:23,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-19 23:38:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:23,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-19 23:38:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:23,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:23,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:23,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-19 23:38:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:23,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:23,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:23,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:38:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:23,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-19 23:38:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:23,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:23,970 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-19 23:38:23,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:38:23,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296231192] [2022-07-19 23:38:23,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296231192] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:38:23,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:38:23,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 23:38:23,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657456255] [2022-07-19 23:38:23,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:38:23,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 23:38:23,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:38:23,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 23:38:23,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 23:38:23,973 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-19 23:38:26,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:38:26,871 INFO L93 Difference]: Finished difference Result 22136 states and 30222 transitions. [2022-07-19 23:38:26,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 23:38:26,872 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-19 23:38:26,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:38:26,930 INFO L225 Difference]: With dead ends: 22136 [2022-07-19 23:38:26,930 INFO L226 Difference]: Without dead ends: 13381 [2022-07-19 23:38:26,961 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-19 23:38:26,963 INFO L413 NwaCegarLoop]: 1442 mSDtfsCounter, 1149 mSDsluCounter, 2433 mSDsCounter, 0 mSdLazyCounter, 2026 mSolverCounterSat, 353 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1190 SdHoareTripleChecker+Valid, 3875 SdHoareTripleChecker+Invalid, 2379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 353 IncrementalHoareTripleChecker+Valid, 2026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-19 23:38:26,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1190 Valid, 3875 Invalid, 2379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [353 Valid, 2026 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-19 23:38:26,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13381 states. [2022-07-19 23:38:27,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13381 to 8806. [2022-07-19 23:38:27,386 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-19 23:38:27,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8806 states to 8806 states and 11973 transitions. [2022-07-19 23:38:27,413 INFO L78 Accepts]: Start accepts. Automaton has 8806 states and 11973 transitions. Word has length 215 [2022-07-19 23:38:27,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:38:27,413 INFO L495 AbstractCegarLoop]: Abstraction has 8806 states and 11973 transitions. [2022-07-19 23:38:27,414 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-19 23:38:27,414 INFO L276 IsEmpty]: Start isEmpty. Operand 8806 states and 11973 transitions. [2022-07-19 23:38:27,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-07-19 23:38:27,434 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:38:27,435 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-19 23:38:27,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 23:38:27,435 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:38:27,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:38:27,436 INFO L85 PathProgramCache]: Analyzing trace with hash 2069474836, now seen corresponding path program 1 times [2022-07-19 23:38:27,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:38:27,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852199680] [2022-07-19 23:38:27,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:38:27,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:38:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:27,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:38:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:27,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:38:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:27,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:38:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:27,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:38:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:27,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:38:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:27,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 23:38:27,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:27,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:38:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:27,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 23:38:27,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:27,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 23:38:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:27,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 23:38:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:27,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 23:38:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:27,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 23:38:27,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:27,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 23:38:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:27,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:27,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:27,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-19 23:38:27,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:27,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-19 23:38:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:27,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:27,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:27,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:27,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:38:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:27,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-19 23:38:27,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:27,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:27,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:27,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-19 23:38:27,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:27,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:27,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:27,804 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-19 23:38:27,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:38:27,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852199680] [2022-07-19 23:38:27,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852199680] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:38:27,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416843828] [2022-07-19 23:38:27,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:38:27,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:38:27,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:38:27,807 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 23:38:27,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 23:38:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:28,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 1400 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-19 23:38:28,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:38:28,506 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-19 23:38:28,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 23:38:28,911 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-19 23:38:28,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416843828] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 23:38:28,912 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 23:38:28,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 9] total 20 [2022-07-19 23:38:28,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351791858] [2022-07-19 23:38:28,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 23:38:28,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-19 23:38:28,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:38:28,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-19 23:38:28,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2022-07-19 23:38:28,914 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-19 23:38:36,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:38:36,666 INFO L93 Difference]: Finished difference Result 31956 states and 44216 transitions. [2022-07-19 23:38:36,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-19 23:38:36,666 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-19 23:38:36,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:38:36,794 INFO L225 Difference]: With dead ends: 31956 [2022-07-19 23:38:36,794 INFO L226 Difference]: Without dead ends: 27104 [2022-07-19 23:38:36,819 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-19 23:38:36,820 INFO L413 NwaCegarLoop]: 1612 mSDtfsCounter, 9490 mSDsluCounter, 5831 mSDsCounter, 0 mSdLazyCounter, 7739 mSolverCounterSat, 4425 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9764 SdHoareTripleChecker+Valid, 7443 SdHoareTripleChecker+Invalid, 12164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4425 IncrementalHoareTripleChecker+Valid, 7739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-07-19 23:38:36,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9764 Valid, 7443 Invalid, 12164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4425 Valid, 7739 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-07-19 23:38:36,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27104 states. [2022-07-19 23:38:38,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27104 to 24845. [2022-07-19 23:38:38,074 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-19 23:38:38,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24845 states to 24845 states and 34183 transitions. [2022-07-19 23:38:38,169 INFO L78 Accepts]: Start accepts. Automaton has 24845 states and 34183 transitions. Word has length 200 [2022-07-19 23:38:38,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:38:38,170 INFO L495 AbstractCegarLoop]: Abstraction has 24845 states and 34183 transitions. [2022-07-19 23:38:38,171 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-19 23:38:38,171 INFO L276 IsEmpty]: Start isEmpty. Operand 24845 states and 34183 transitions. [2022-07-19 23:38:38,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-07-19 23:38:38,186 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:38:38,187 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-19 23:38:38,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 23:38:38,403 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-19 23:38:38,404 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:38:38,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:38:38,404 INFO L85 PathProgramCache]: Analyzing trace with hash -872421549, now seen corresponding path program 1 times [2022-07-19 23:38:38,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:38:38,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004142849] [2022-07-19 23:38:38,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:38:38,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:38:38,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:38,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:38:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:38,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:38:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:38,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:38:38,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:38,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:38:38,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:38,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:38:38,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:38,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 23:38:38,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:38,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:38:38,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:38,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 23:38:38,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:38,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 23:38:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:38,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 23:38:38,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:38,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 23:38:38,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:38,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 23:38:38,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:38,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 23:38:38,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:38,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:38,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-19 23:38:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:38,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-19 23:38:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:38,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:38,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:38,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:38:38,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:38,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-19 23:38:38,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:38,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:38,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:38,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-19 23:38:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:38,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:38,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:38,647 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-19 23:38:38,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:38:38,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004142849] [2022-07-19 23:38:38,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004142849] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:38:38,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:38:38,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 23:38:38,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198360792] [2022-07-19 23:38:38,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:38:38,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 23:38:38,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:38:38,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 23:38:38,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-19 23:38:38,650 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-19 23:38:40,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:38:40,778 INFO L93 Difference]: Finished difference Result 47218 states and 65947 transitions. [2022-07-19 23:38:40,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 23:38:40,779 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-19 23:38:40,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:38:41,124 INFO L225 Difference]: With dead ends: 47218 [2022-07-19 23:38:41,125 INFO L226 Difference]: Without dead ends: 26319 [2022-07-19 23:38:41,174 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-19 23:38:41,175 INFO L413 NwaCegarLoop]: 840 mSDtfsCounter, 443 mSDsluCounter, 1850 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.3s IncrementalHoareTripleChecker+Time [2022-07-19 23:38:41,175 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.3s Time] [2022-07-19 23:38:41,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26319 states. [2022-07-19 23:38:42,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26319 to 24829. [2022-07-19 23:38:42,205 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-19 23:38:42,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24829 states to 24829 states and 34109 transitions. [2022-07-19 23:38:42,287 INFO L78 Accepts]: Start accepts. Automaton has 24829 states and 34109 transitions. Word has length 202 [2022-07-19 23:38:42,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:38:42,288 INFO L495 AbstractCegarLoop]: Abstraction has 24829 states and 34109 transitions. [2022-07-19 23:38:42,288 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-19 23:38:42,288 INFO L276 IsEmpty]: Start isEmpty. Operand 24829 states and 34109 transitions. [2022-07-19 23:38:42,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-07-19 23:38:42,306 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:38:42,306 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-19 23:38:42,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 23:38:42,307 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:38:42,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:38:42,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1114922220, now seen corresponding path program 1 times [2022-07-19 23:38:42,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:38:42,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405237878] [2022-07-19 23:38:42,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:38:42,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:38:42,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:42,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:38:42,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:42,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:38:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:42,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:38:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:42,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:38:42,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:42,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:38:42,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:42,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 23:38:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:42,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:38:42,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:42,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 23:38:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:42,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 23:38:42,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:42,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 23:38:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:42,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 23:38:42,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:42,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 23:38:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:42,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 23:38:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:42,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:42,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:42,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-19 23:38:42,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:42,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-19 23:38:42,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:42,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:42,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:42,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:38:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:42,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-19 23:38:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:42,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:42,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-19 23:38:42,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:42,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:42,576 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-19 23:38:42,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:38:42,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405237878] [2022-07-19 23:38:42,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405237878] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:38:42,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:38:42,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 23:38:42,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161353910] [2022-07-19 23:38:42,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:38:42,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 23:38:42,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:38:42,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 23:38:42,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-19 23:38:42,579 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-19 23:38:45,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:38:45,488 INFO L93 Difference]: Finished difference Result 66761 states and 96168 transitions. [2022-07-19 23:38:45,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 23:38:45,488 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-19 23:38:45,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:38:45,678 INFO L225 Difference]: With dead ends: 66761 [2022-07-19 23:38:45,678 INFO L226 Difference]: Without dead ends: 41967 [2022-07-19 23:38:45,748 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-19 23:38:45,750 INFO L413 NwaCegarLoop]: 1408 mSDtfsCounter, 1366 mSDsluCounter, 2999 mSDsCounter, 0 mSdLazyCounter, 1606 mSolverCounterSat, 441 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1456 SdHoareTripleChecker+Valid, 4407 SdHoareTripleChecker+Invalid, 2047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 441 IncrementalHoareTripleChecker+Valid, 1606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-19 23:38:45,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1456 Valid, 4407 Invalid, 2047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [441 Valid, 1606 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-19 23:38:45,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41967 states. [2022-07-19 23:38:47,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41967 to 24889. [2022-07-19 23:38:47,292 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-19 23:38:47,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24889 states to 24889 states and 34169 transitions. [2022-07-19 23:38:47,372 INFO L78 Accepts]: Start accepts. Automaton has 24889 states and 34169 transitions. Word has length 204 [2022-07-19 23:38:47,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:38:47,373 INFO L495 AbstractCegarLoop]: Abstraction has 24889 states and 34169 transitions. [2022-07-19 23:38:47,373 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-19 23:38:47,373 INFO L276 IsEmpty]: Start isEmpty. Operand 24889 states and 34169 transitions. [2022-07-19 23:38:47,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-07-19 23:38:47,391 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:38:47,391 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-19 23:38:47,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 23:38:47,391 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:38:47,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:38:47,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1099484298, now seen corresponding path program 1 times [2022-07-19 23:38:47,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:38:47,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227185879] [2022-07-19 23:38:47,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:38:47,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:38:47,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:47,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:38:47,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:47,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:38:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:47,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:38:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:47,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:38:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:47,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:38:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:47,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 23:38:47,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:47,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:38:47,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:47,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 23:38:47,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:47,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 23:38:47,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:47,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 23:38:47,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:47,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 23:38:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:47,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 23:38:47,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:47,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 23:38:47,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:47,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:47,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:47,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-19 23:38:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:47,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-19 23:38:47,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:47,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:47,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:47,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:47,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:47,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:38:47,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:47,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-19 23:38:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:47,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:47,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:47,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-19 23:38:47,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:47,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-19 23:38:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:47,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:47,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:47,782 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-19 23:38:47,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:38:47,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227185879] [2022-07-19 23:38:47,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227185879] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:38:47,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:38:47,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 23:38:47,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704538470] [2022-07-19 23:38:47,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:38:47,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 23:38:47,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:38:47,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 23:38:47,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-19 23:38:47,785 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-19 23:38:49,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:38:49,779 INFO L93 Difference]: Finished difference Result 38316 states and 52807 transitions. [2022-07-19 23:38:49,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 23:38:49,780 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-19 23:38:49,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:38:49,833 INFO L225 Difference]: With dead ends: 38316 [2022-07-19 23:38:49,833 INFO L226 Difference]: Without dead ends: 13432 [2022-07-19 23:38:49,879 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-19 23:38:49,880 INFO L413 NwaCegarLoop]: 843 mSDtfsCounter, 657 mSDsluCounter, 2377 mSDsCounter, 0 mSdLazyCounter, 1609 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 3220 SdHoareTripleChecker+Invalid, 2042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 1609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-19 23:38:49,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 3220 Invalid, 2042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 1609 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-19 23:38:49,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13432 states. [2022-07-19 23:38:50,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13432 to 12493. [2022-07-19 23:38:50,492 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-19 23:38:50,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12493 states to 12493 states and 17189 transitions. [2022-07-19 23:38:50,522 INFO L78 Accepts]: Start accepts. Automaton has 12493 states and 17189 transitions. Word has length 208 [2022-07-19 23:38:50,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:38:50,523 INFO L495 AbstractCegarLoop]: Abstraction has 12493 states and 17189 transitions. [2022-07-19 23:38:50,523 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-19 23:38:50,523 INFO L276 IsEmpty]: Start isEmpty. Operand 12493 states and 17189 transitions. [2022-07-19 23:38:50,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-07-19 23:38:50,531 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:38:50,532 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-19 23:38:50,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-19 23:38:50,532 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:38:50,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:38:50,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1517373000, now seen corresponding path program 1 times [2022-07-19 23:38:50,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:38:50,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585606820] [2022-07-19 23:38:50,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:38:50,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:38:50,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:50,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:38:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:50,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:38:50,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:50,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:38:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:50,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:38:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:50,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:38:50,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:50,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 23:38:50,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:50,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:38:50,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:50,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 23:38:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:50,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 23:38:50,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:50,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 23:38:50,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:50,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 23:38:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:50,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 23:38:50,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:51,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 23:38:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:51,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:51,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:51,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-19 23:38:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:51,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-19 23:38:51,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:51,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:51,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:51,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:51,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:38:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:51,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-19 23:38:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:51,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:51,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-19 23:38:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:51,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-19 23:38:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:51,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:51,989 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-19 23:38:51,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:38:51,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585606820] [2022-07-19 23:38:51,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585606820] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:38:51,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472022880] [2022-07-19 23:38:51,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:38:51,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:38:51,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:38:51,992 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 23:38:51,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 23:38:52,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:52,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 1415 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-19 23:38:52,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:38:53,082 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-19 23:38:53,082 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 23:38:53,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472022880] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:38:53,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 23:38:53,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [33] total 41 [2022-07-19 23:38:53,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105878390] [2022-07-19 23:38:53,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:38:53,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-19 23:38:53,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:38:53,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-19 23:38:53,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1538, Unknown=0, NotChecked=0, Total=1640 [2022-07-19 23:38:53,085 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-19 23:38:54,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:38:54,225 INFO L93 Difference]: Finished difference Result 29309 states and 41475 transitions. [2022-07-19 23:38:54,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 23:38:54,226 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-19 23:38:54,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:38:54,299 INFO L225 Difference]: With dead ends: 29309 [2022-07-19 23:38:54,299 INFO L226 Difference]: Without dead ends: 16866 [2022-07-19 23:38:54,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 241 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=129, Invalid=1941, Unknown=0, NotChecked=0, Total=2070 [2022-07-19 23:38:54,336 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.2s IncrementalHoareTripleChecker+Time [2022-07-19 23:38:54,337 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.2s Time] [2022-07-19 23:38:54,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16866 states. [2022-07-19 23:38:55,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16866 to 12583. [2022-07-19 23:38:55,073 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-19 23:38:55,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12583 states to 12583 states and 17267 transitions. [2022-07-19 23:38:55,108 INFO L78 Accepts]: Start accepts. Automaton has 12583 states and 17267 transitions. Word has length 208 [2022-07-19 23:38:55,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:38:55,109 INFO L495 AbstractCegarLoop]: Abstraction has 12583 states and 17267 transitions. [2022-07-19 23:38:55,109 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-19 23:38:55,109 INFO L276 IsEmpty]: Start isEmpty. Operand 12583 states and 17267 transitions. [2022-07-19 23:38:55,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-07-19 23:38:55,114 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:38:55,114 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-19 23:38:55,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-19 23:38:55,316 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-19 23:38:55,316 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:38:55,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:38:55,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1833099563, now seen corresponding path program 1 times [2022-07-19 23:38:55,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:38:55,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409245485] [2022-07-19 23:38:55,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:38:55,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:38:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:55,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:38:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:55,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:38:55,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:55,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:38:55,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:55,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:38:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:55,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:38:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:55,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 23:38:55,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:55,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:38:55,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:55,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 23:38:55,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:55,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 23:38:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:55,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 23:38:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:55,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 23:38:55,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:55,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 23:38:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:55,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 23:38:55,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:55,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-19 23:38:55,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:55,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-19 23:38:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:55,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-19 23:38:55,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:55,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:55,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:55,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:55,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:55,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-19 23:38:55,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:55,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:55,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:55,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:55,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:38:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:55,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-19 23:38:55,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:55,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:55,562 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-19 23:38:55,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:38:55,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409245485] [2022-07-19 23:38:55,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409245485] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:38:55,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891596650] [2022-07-19 23:38:55,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:38:55,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:38:55,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:38:55,564 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 23:38:55,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 23:38:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:55,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 1518 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 23:38:55,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:38:56,036 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-19 23:38:56,036 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 23:38:56,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891596650] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:38:56,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 23:38:56,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2022-07-19 23:38:56,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482708088] [2022-07-19 23:38:56,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:38:56,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 23:38:56,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:38:56,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 23:38:56,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-19 23:38:56,038 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-19 23:38:57,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:38:57,076 INFO L93 Difference]: Finished difference Result 31184 states and 42945 transitions. [2022-07-19 23:38:57,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 23:38:57,077 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-19 23:38:57,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:38:57,146 INFO L225 Difference]: With dead ends: 31184 [2022-07-19 23:38:57,146 INFO L226 Difference]: Without dead ends: 18651 [2022-07-19 23:38:57,173 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-19 23:38:57,173 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-19 23:38:57,174 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-19 23:38:57,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18651 states. [2022-07-19 23:38:57,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18651 to 12593. [2022-07-19 23:38:57,906 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-19 23:38:57,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12593 states to 12593 states and 17277 transitions. [2022-07-19 23:38:57,937 INFO L78 Accepts]: Start accepts. Automaton has 12593 states and 17277 transitions. Word has length 226 [2022-07-19 23:38:57,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:38:57,937 INFO L495 AbstractCegarLoop]: Abstraction has 12593 states and 17277 transitions. [2022-07-19 23:38:57,938 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-19 23:38:57,938 INFO L276 IsEmpty]: Start isEmpty. Operand 12593 states and 17277 transitions. [2022-07-19 23:38:57,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2022-07-19 23:38:57,943 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:38:57,943 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-19 23:38:57,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-19 23:38:58,143 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-19 23:38:58,144 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:38:58,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:38:58,144 INFO L85 PathProgramCache]: Analyzing trace with hash -670216187, now seen corresponding path program 1 times [2022-07-19 23:38:58,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:38:58,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909051160] [2022-07-19 23:38:58,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:38:58,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:38:58,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:58,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:38:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:58,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:38:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:58,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:38:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:58,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:38:58,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:58,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:38:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:58,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 23:38:58,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:58,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:38:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:58,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 23:38:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:58,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 23:38:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:58,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 23:38:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:58,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 23:38:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:58,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 23:38:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:58,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 23:38:58,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:58,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:58,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-19 23:38:58,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:58,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-19 23:38:58,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:58,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:58,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:58,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:58,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:38:58,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:58,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-19 23:38:58,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:58,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-19 23:38:58,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:58,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-19 23:38:58,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:58,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-19 23:38:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:58,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:58,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-19 23:38:58,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:58,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:58,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-07-19 23:38:58,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:58,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:58,845 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-19 23:38:58,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:38:58,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909051160] [2022-07-19 23:38:58,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909051160] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:38:58,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:38:58,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-07-19 23:38:58,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716429493] [2022-07-19 23:38:58,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:38:58,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-19 23:38:58,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:38:58,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-19 23:38:58,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2022-07-19 23:38:58,848 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-19 23:39:04,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:39:04,519 INFO L93 Difference]: Finished difference Result 34036 states and 49217 transitions. [2022-07-19 23:39:04,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-19 23:39:04,520 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-19 23:39:04,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:39:04,603 INFO L225 Difference]: With dead ends: 34036 [2022-07-19 23:39:04,603 INFO L226 Difference]: Without dead ends: 21493 [2022-07-19 23:39:04,639 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-19 23:39:04,640 INFO L413 NwaCegarLoop]: 1359 mSDtfsCounter, 1752 mSDsluCounter, 12786 mSDsCounter, 0 mSdLazyCounter, 7697 mSolverCounterSat, 650 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1865 SdHoareTripleChecker+Valid, 14145 SdHoareTripleChecker+Invalid, 8347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 650 IncrementalHoareTripleChecker+Valid, 7697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-19 23:39:04,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1865 Valid, 14145 Invalid, 8347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [650 Valid, 7697 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-07-19 23:39:04,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21493 states. [2022-07-19 23:39:05,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21493 to 12673. [2022-07-19 23:39:05,564 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-19 23:39:05,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12673 states to 12673 states and 17374 transitions. [2022-07-19 23:39:05,598 INFO L78 Accepts]: Start accepts. Automaton has 12673 states and 17374 transitions. Word has length 237 [2022-07-19 23:39:05,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:39:05,599 INFO L495 AbstractCegarLoop]: Abstraction has 12673 states and 17374 transitions. [2022-07-19 23:39:05,599 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-19 23:39:05,599 INFO L276 IsEmpty]: Start isEmpty. Operand 12673 states and 17374 transitions. [2022-07-19 23:39:05,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2022-07-19 23:39:05,604 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:39:05,604 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-19 23:39:05,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-19 23:39:05,604 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:39:05,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:39:05,604 INFO L85 PathProgramCache]: Analyzing trace with hash -944975801, now seen corresponding path program 1 times [2022-07-19 23:39:05,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:39:05,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096797699] [2022-07-19 23:39:05,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:39:05,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:39:06,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 23:39:06,360 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 23:39:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 23:39:06,942 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 23:39:06,943 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 23:39:06,944 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 23:39:06,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-19 23:39:06,949 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-19 23:39:06,954 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 23:39:07,012 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-19 23:39:07,013 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-19 23:39:07,013 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-19 23:39:07,013 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-19 23:39:07,014 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-19 23:39:07,014 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-19 23:39:07,014 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-19 23:39:07,014 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-19 23:39:07,014 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-19 23:39:07,014 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-19 23:39:07,022 WARN L418 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == dest.base && #res.offset == dest.offset; is not ensure(true) [2022-07-19 23:39:07,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 11:39:07 BoogieIcfgContainer [2022-07-19 23:39:07,192 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 23:39:07,193 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 23:39:07,193 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 23:39:07,193 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 23:39:07,193 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:38:01" (3/4) ... [2022-07-19 23:39:07,196 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-19 23:39:07,196 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 23:39:07,197 INFO L158 Benchmark]: Toolchain (without parser) took 69250.53ms. Allocated memory was 109.1MB in the beginning and 4.7GB in the end (delta: 4.6GB). Free memory was 73.6MB in the beginning and 3.4GB in the end (delta: -3.4GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2022-07-19 23:39:07,197 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 109.1MB. Free memory is still 65.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 23:39:07,198 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1479.00ms. Allocated memory was 109.1MB in the beginning and 142.6MB in the end (delta: 33.6MB). Free memory was 73.3MB in the beginning and 78.9MB in the end (delta: -5.6MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. [2022-07-19 23:39:07,198 INFO L158 Benchmark]: Boogie Procedure Inliner took 153.22ms. Allocated memory is still 142.6MB. Free memory was 78.9MB in the beginning and 68.4MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-19 23:39:07,199 INFO L158 Benchmark]: Boogie Preprocessor took 162.02ms. Allocated memory is still 142.6MB. Free memory was 68.4MB in the beginning and 87.8MB in the end (delta: -19.4MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. [2022-07-19 23:39:07,199 INFO L158 Benchmark]: RCFGBuilder took 1651.99ms. Allocated memory was 142.6MB in the beginning and 220.2MB in the end (delta: 77.6MB). Free memory was 87.2MB in the beginning and 145.6MB in the end (delta: -58.4MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. [2022-07-19 23:39:07,199 INFO L158 Benchmark]: TraceAbstraction took 65793.56ms. Allocated memory was 220.2MB in the beginning and 4.7GB in the end (delta: 4.5GB). Free memory was 145.6MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2022-07-19 23:39:07,199 INFO L158 Benchmark]: Witness Printer took 3.80ms. Allocated memory is still 4.7GB. Free memory was 3.4GB in the beginning and 3.4GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 23:39:07,206 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 109.1MB. Free memory is still 65.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1479.00ms. Allocated memory was 109.1MB in the beginning and 142.6MB in the end (delta: 33.6MB). Free memory was 73.3MB in the beginning and 78.9MB in the end (delta: -5.6MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 153.22ms. Allocated memory is still 142.6MB. Free memory was 78.9MB in the beginning and 68.4MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 162.02ms. Allocated memory is still 142.6MB. Free memory was 68.4MB in the beginning and 87.8MB in the end (delta: -19.4MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1651.99ms. Allocated memory was 142.6MB in the beginning and 220.2MB in the end (delta: 77.6MB). Free memory was 87.2MB in the beginning and 145.6MB in the end (delta: -58.4MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. * TraceAbstraction took 65793.56ms. Allocated memory was 220.2MB in the beginning and 4.7GB in the end (delta: 4.5GB). Free memory was 145.6MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 3.80ms. Allocated memory is still 4.7GB. Free memory was 3.4GB in the beginning and 3.4GB 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={0:0}, set={24: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={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] [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={-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] [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: 65.5s, OverallIterations: 17, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 44.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28708 SdHoareTripleChecker+Valid, 32.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27571 mSDsluCounter, 82880 SdHoareTripleChecker+Invalid, 27.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 64695 mSDsCounter, 11589 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35342 IncrementalHoareTripleChecker+Invalid, 46931 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11589 mSolverCounterUnsat, 18185 mSDtfsCounter, 35342 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.1s 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.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 51055 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 3666 NumberOfCodeBlocks, 3666 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 3609 ConstructedInterpolants, 0 QuantifiedInterpolants, 9545 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-19 23:39:07,243 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-?-eb692b5 [2022-07-19 23:39:09,423 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 23:39:09,426 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 23:39:09,463 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 23:39:09,463 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 23:39:09,465 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 23:39:09,468 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 23:39:09,471 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 23:39:09,473 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 23:39:09,477 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 23:39:09,478 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 23:39:09,483 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 23:39:09,483 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 23:39:09,485 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 23:39:09,486 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 23:39:09,489 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 23:39:09,490 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 23:39:09,491 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 23:39:09,493 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 23:39:09,498 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 23:39:09,499 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 23:39:09,500 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 23:39:09,501 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 23:39:09,502 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 23:39:09,503 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 23:39:09,505 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 23:39:09,506 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 23:39:09,506 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 23:39:09,507 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 23:39:09,507 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 23:39:09,508 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 23:39:09,508 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 23:39:09,510 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 23:39:09,510 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 23:39:09,512 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 23:39:09,512 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 23:39:09,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 23:39:09,513 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 23:39:09,513 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 23:39:09,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 23:39:09,514 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 23:39:09,515 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 23:39:09,520 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-07-19 23:39:09,558 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 23:39:09,558 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 23:39:09,559 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 23:39:09,559 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 23:39:09,560 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 23:39:09,560 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 23:39:09,560 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 23:39:09,561 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 23:39:09,561 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 23:39:09,562 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 23:39:09,562 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 23:39:09,562 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 23:39:09,562 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 23:39:09,562 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 23:39:09,562 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-19 23:39:09,563 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-19 23:39:09,563 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-19 23:39:09,563 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 23:39:09,563 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 23:39:09,564 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 23:39:09,564 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 23:39:09,564 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 23:39:09,564 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 23:39:09,564 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 23:39:09,565 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 23:39:09,565 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 23:39:09,565 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 23:39:09,565 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-19 23:39:09,565 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-19 23:39:09,565 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 23:39:09,566 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 23:39:09,566 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 23:39:09,566 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-19 23:39:09,566 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-19 23:39:09,878 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 23:39:09,897 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 23:39:09,899 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 23:39:09,900 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 23:39:09,901 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 23:39:09,902 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-19 23:39:09,961 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4333bc73e/ba787810135d49e296c486fd5c110c2d/FLAGec2be45fe [2022-07-19 23:39:10,702 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 23:39:10,703 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-19 23:39:10,744 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4333bc73e/ba787810135d49e296c486fd5c110c2d/FLAGec2be45fe [2022-07-19 23:39:10,945 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4333bc73e/ba787810135d49e296c486fd5c110c2d [2022-07-19 23:39:10,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 23:39:10,949 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 23:39:10,952 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 23:39:10,952 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 23:39:10,955 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 23:39:10,956 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:39:10" (1/1) ... [2022-07-19 23:39:10,958 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cf0d92d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:39:10, skipping insertion in model container [2022-07-19 23:39:10,958 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:39:10" (1/1) ... [2022-07-19 23:39:10,965 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 23:39:11,052 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 23:39:12,032 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-19 23:39:12,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 23:39:12,406 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-19 23:39:12,482 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 23:39:12,655 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-19 23:39:12,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 23:39:12,769 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 23:39:12,919 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-19 23:39:12,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 23:39:13,084 INFO L208 MainTranslator]: Completed translation [2022-07-19 23:39:13,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:39:13 WrapperNode [2022-07-19 23:39:13,085 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 23:39:13,099 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 23:39:13,099 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 23:39:13,099 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 23:39:13,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:39:13" (1/1) ... [2022-07-19 23:39:13,200 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:39:13" (1/1) ... [2022-07-19 23:39:13,302 INFO L137 Inliner]: procedures = 190, calls = 448, calls flagged for inlining = 92, calls inlined = 85, statements flattened = 1716 [2022-07-19 23:39:13,302 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 23:39:13,303 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 23:39:13,304 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 23:39:13,304 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 23:39:13,312 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:39:13" (1/1) ... [2022-07-19 23:39:13,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:39:13" (1/1) ... [2022-07-19 23:39:13,339 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:39:13" (1/1) ... [2022-07-19 23:39:13,343 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:39:13" (1/1) ... [2022-07-19 23:39:13,420 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:39:13" (1/1) ... [2022-07-19 23:39:13,439 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:39:13" (1/1) ... [2022-07-19 23:39:13,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:39:13" (1/1) ... [2022-07-19 23:39:13,479 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 23:39:13,482 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 23:39:13,482 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 23:39:13,482 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 23:39:13,483 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:39:13" (1/1) ... [2022-07-19 23:39:13,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 23:39:13,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:39:13,512 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 23:39:13,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 23:39:13,558 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-19 23:39:13,559 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-19 23:39:13,559 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_alloc_skb_15 [2022-07-19 23:39:13,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_alloc_skb_15 [2022-07-19 23:39:13,559 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_sync_poll [2022-07-19 23:39:13,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_sync_poll [2022-07-19 23:39:13,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-19 23:39:13,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-07-19 23:39:13,560 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reserve [2022-07-19 23:39:13,560 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reserve [2022-07-19 23:39:13,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-19 23:39:13,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-19 23:39:13,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2022-07-19 23:39:13,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-19 23:39:13,561 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-19 23:39:13,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-19 23:39:13,561 INFO L130 BoogieDeclarations]: Found specification of procedure skb_push [2022-07-19 23:39:13,561 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_push [2022-07-19 23:39:13,561 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_output_wakeup [2022-07-19 23:39:13,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_output_wakeup [2022-07-19 23:39:13,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-19 23:39:13,562 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-19 23:39:13,562 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2022-07-19 23:39:13,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2022-07-19 23:39:13,562 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-19 23:39:13,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-19 23:39:13,563 INFO L130 BoogieDeclarations]: Found specification of procedure spin_trylock_bh [2022-07-19 23:39:13,563 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_trylock_bh [2022-07-19 23:39:13,563 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-19 23:39:13,564 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-19 23:39:13,564 INFO L130 BoogieDeclarations]: Found specification of procedure skb_trim [2022-07-19 23:39:13,564 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_trim [2022-07-19 23:39:13,564 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-07-19 23:39:13,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-07-19 23:39:13,564 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_synctty_ioctl [2022-07-19 23:39:13,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_synctty_ioctl [2022-07-19 23:39:13,565 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-19 23:39:13,565 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-19 23:39:13,565 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-19 23:39:13,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-19 23:39:13,565 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2022-07-19 23:39:13,566 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2022-07-19 23:39:13,566 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_sync_close [2022-07-19 23:39:13,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_sync_close [2022-07-19 23:39:13,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2022-07-19 23:39:13,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2022-07-19 23:39:13,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2022-07-19 23:39:13,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2022-07-19 23:39:13,567 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-19 23:39:13,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-19 23:39:13,568 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-19 23:39:13,568 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-19 23:39:13,569 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_print_buffer [2022-07-19 23:39:13,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_print_buffer [2022-07-19 23:39:13,569 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-19 23:39:13,569 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-19 23:39:13,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 23:39:13,570 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-07-19 23:39:13,570 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-07-19 23:39:13,570 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-19 23:39:13,570 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-19 23:39:13,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 23:39:13,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 23:39:13,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 23:39:13,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2022-07-19 23:39:13,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2022-07-19 23:39:13,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2022-07-19 23:39:13,572 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-07-19 23:39:13,572 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-07-19 23:39:13,572 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_schedule [2022-07-19 23:39:13,572 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_schedule [2022-07-19 23:39:13,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 23:39:13,573 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-07-19 23:39:13,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-07-19 23:39:13,573 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec_and_test [2022-07-19 23:39:13,573 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec_and_test [2022-07-19 23:39:13,573 INFO L130 BoogieDeclarations]: Found specification of procedure sp_put [2022-07-19 23:39:13,573 INFO L138 BoogieDeclarations]: Found implementation of procedure sp_put [2022-07-19 23:39:13,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-07-19 23:39:13,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-07-19 23:39:13,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 23:39:13,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-19 23:39:13,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 23:39:13,575 INFO L130 BoogieDeclarations]: Found specification of procedure skb_queue_tail [2022-07-19 23:39:13,575 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_queue_tail [2022-07-19 23:39:13,575 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_sync_hangup [2022-07-19 23:39:13,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_sync_hangup [2022-07-19 23:39:13,576 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-19 23:39:13,576 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-19 23:39:13,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-19 23:39:13,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-07-19 23:39:13,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2022-07-19 23:39:13,577 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-07-19 23:39:13,578 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-07-19 23:39:13,578 INFO L130 BoogieDeclarations]: Found specification of procedure sp_get [2022-07-19 23:39:13,578 INFO L138 BoogieDeclarations]: Found implementation of procedure sp_get [2022-07-19 23:39:13,578 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-19 23:39:13,578 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-19 23:39:13,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2022-07-19 23:39:13,579 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2022-07-19 23:39:13,579 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2022-07-19 23:39:13,579 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-19 23:39:13,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-19 23:39:13,579 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-07-19 23:39:13,579 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-07-19 23:39:13,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 23:39:13,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 23:39:13,580 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_sync_push [2022-07-19 23:39:13,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_sync_push [2022-07-19 23:39:14,092 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 23:39:14,108 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 23:39:14,257 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-19 23:39:21,038 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 23:39:21,053 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 23:39:21,058 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-19 23:39:21,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:39:21 BoogieIcfgContainer [2022-07-19 23:39:21,063 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 23:39:21,065 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 23:39:21,066 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 23:39:21,069 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 23:39:21,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 11:39:10" (1/3) ... [2022-07-19 23:39:21,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b50ab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:39:21, skipping insertion in model container [2022-07-19 23:39:21,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:39:13" (2/3) ... [2022-07-19 23:39:21,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b50ab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:39:21, skipping insertion in model container [2022-07-19 23:39:21,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:39:21" (3/3) ... [2022-07-19 23:39:21,076 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-19 23:39:21,090 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 23:39:21,091 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 23:39:21,176 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 23:39:21,182 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@6a25ccc8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@56e0121c [2022-07-19 23:39:21,183 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 23:39:21,192 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-19 23:39:21,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-19 23:39:21,210 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:39:21,211 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-19 23:39:21,212 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:39:21,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:39:21,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1758611482, now seen corresponding path program 1 times [2022-07-19 23:39:21,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 23:39:21,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [266523239] [2022-07-19 23:39:21,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:39:21,233 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 23:39:21,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 23:39:21,236 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-19 23:39:21,241 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-19 23:39:21,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:21,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 23:39:21,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:39:21,818 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-19 23:39:21,819 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 23:39:21,819 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 23:39:21,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [266523239] [2022-07-19 23:39:21,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [266523239] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:39:21,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:39:21,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 23:39:21,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084057766] [2022-07-19 23:39:21,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:39:21,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 23:39:21,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 23:39:21,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 23:39:21,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 23:39:21,865 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-19 23:39:22,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:39:22,088 INFO L93 Difference]: Finished difference Result 1877 states and 2724 transitions. [2022-07-19 23:39:22,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 23:39:22,090 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-19 23:39:22,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:39:22,109 INFO L225 Difference]: With dead ends: 1877 [2022-07-19 23:39:22,109 INFO L226 Difference]: Without dead ends: 1222 [2022-07-19 23:39:22,117 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-19 23:39:22,120 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-19 23:39:22,121 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-19 23:39:22,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2022-07-19 23:39:22,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1222. [2022-07-19 23:39:22,233 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-19 23:39:22,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1709 transitions. [2022-07-19 23:39:22,242 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1709 transitions. Word has length 78 [2022-07-19 23:39:22,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:39:22,243 INFO L495 AbstractCegarLoop]: Abstraction has 1222 states and 1709 transitions. [2022-07-19 23:39:22,244 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-19 23:39:22,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1709 transitions. [2022-07-19 23:39:22,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-19 23:39:22,247 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:39:22,248 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-19 23:39:22,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-19 23:39:22,463 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-19 23:39:22,464 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:39:22,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:39:22,465 INFO L85 PathProgramCache]: Analyzing trace with hash -152487068, now seen corresponding path program 1 times [2022-07-19 23:39:22,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 23:39:22,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1633329349] [2022-07-19 23:39:22,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:39:22,466 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 23:39:22,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 23:39:22,468 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-19 23:39:22,471 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-19 23:39:22,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:22,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 23:39:22,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:39:23,003 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-19 23:39:23,003 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 23:39:23,003 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 23:39:23,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1633329349] [2022-07-19 23:39:23,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1633329349] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:39:23,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:39:23,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 23:39:23,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19687644] [2022-07-19 23:39:23,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:39:23,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 23:39:23,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 23:39:23,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 23:39:23,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 23:39:23,006 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-19 23:39:23,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:39:23,282 INFO L93 Difference]: Finished difference Result 3615 states and 5103 transitions. [2022-07-19 23:39:23,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 23:39:23,283 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-19 23:39:23,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:39:23,297 INFO L225 Difference]: With dead ends: 3615 [2022-07-19 23:39:23,298 INFO L226 Difference]: Without dead ends: 2411 [2022-07-19 23:39:23,302 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-19 23:39:23,304 INFO L413 NwaCegarLoop]: 1060 mSDtfsCounter, 863 mSDsluCounter, 2979 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 4039 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 23:39:23,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 4039 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 23:39:23,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2411 states. [2022-07-19 23:39:23,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2411 to 2403. [2022-07-19 23:39:23,425 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-19 23:39:23,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2403 states to 2403 states and 3398 transitions. [2022-07-19 23:39:23,441 INFO L78 Accepts]: Start accepts. Automaton has 2403 states and 3398 transitions. Word has length 82 [2022-07-19 23:39:23,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:39:23,442 INFO L495 AbstractCegarLoop]: Abstraction has 2403 states and 3398 transitions. [2022-07-19 23:39:23,442 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-19 23:39:23,442 INFO L276 IsEmpty]: Start isEmpty. Operand 2403 states and 3398 transitions. [2022-07-19 23:39:23,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-19 23:39:23,450 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:39:23,450 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-19 23:39:23,470 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-19 23:39:23,666 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-19 23:39:23,667 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:39:23,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:39:23,667 INFO L85 PathProgramCache]: Analyzing trace with hash -950375967, now seen corresponding path program 1 times [2022-07-19 23:39:23,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 23:39:23,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1077652314] [2022-07-19 23:39:23,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:39:23,669 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 23:39:23,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 23:39:23,671 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-19 23:39:23,673 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-19 23:39:24,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:24,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 23:39:24,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:39:24,167 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-19 23:39:24,168 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 23:39:24,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 23:39:24,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1077652314] [2022-07-19 23:39:24,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1077652314] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:39:24,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:39:24,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 23:39:24,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472598867] [2022-07-19 23:39:24,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:39:24,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 23:39:24,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 23:39:24,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 23:39:24,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 23:39:24,171 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-19 23:39:24,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:39:24,441 INFO L93 Difference]: Finished difference Result 6105 states and 8595 transitions. [2022-07-19 23:39:24,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 23:39:24,442 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-19 23:39:24,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:39:24,463 INFO L225 Difference]: With dead ends: 6105 [2022-07-19 23:39:24,464 INFO L226 Difference]: Without dead ends: 3726 [2022-07-19 23:39:24,473 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-19 23:39:24,474 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-19 23:39:24,474 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-19 23:39:24,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3726 states. [2022-07-19 23:39:24,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3726 to 3713. [2022-07-19 23:39:24,637 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-19 23:39:24,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3713 states to 3713 states and 5214 transitions. [2022-07-19 23:39:24,661 INFO L78 Accepts]: Start accepts. Automaton has 3713 states and 5214 transitions. Word has length 128 [2022-07-19 23:39:24,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:39:24,662 INFO L495 AbstractCegarLoop]: Abstraction has 3713 states and 5214 transitions. [2022-07-19 23:39:24,662 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-19 23:39:24,662 INFO L276 IsEmpty]: Start isEmpty. Operand 3713 states and 5214 transitions. [2022-07-19 23:39:24,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-07-19 23:39:24,671 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:39:24,672 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-19 23:39:24,693 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-19 23:39:24,893 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-19 23:39:24,893 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:39:24,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:39:24,894 INFO L85 PathProgramCache]: Analyzing trace with hash -944835305, now seen corresponding path program 1 times [2022-07-19 23:39:24,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 23:39:24,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [587075295] [2022-07-19 23:39:24,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:39:24,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 23:39:24,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 23:39:24,897 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-19 23:39:24,899 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-19 23:39:25,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:25,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 23:39:25,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:39:25,451 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-19 23:39:25,451 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 23:39:25,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 23:39:25,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [587075295] [2022-07-19 23:39:25,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [587075295] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:39:25,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:39:25,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 23:39:25,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531743643] [2022-07-19 23:39:25,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:39:25,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 23:39:25,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 23:39:25,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 23:39:25,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 23:39:25,454 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-19 23:39:25,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:39:25,649 INFO L93 Difference]: Finished difference Result 9002 states and 12550 transitions. [2022-07-19 23:39:25,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 23:39:25,650 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-19 23:39:25,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:39:25,718 INFO L225 Difference]: With dead ends: 9002 [2022-07-19 23:39:25,718 INFO L226 Difference]: Without dead ends: 5313 [2022-07-19 23:39:25,728 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-19 23:39:25,729 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-19 23:39:25,729 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-19 23:39:25,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5313 states. [2022-07-19 23:39:25,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5313 to 5304. [2022-07-19 23:39:25,907 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-19 23:39:25,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5304 states to 5304 states and 7353 transitions. [2022-07-19 23:39:25,932 INFO L78 Accepts]: Start accepts. Automaton has 5304 states and 7353 transitions. Word has length 149 [2022-07-19 23:39:25,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:39:25,933 INFO L495 AbstractCegarLoop]: Abstraction has 5304 states and 7353 transitions. [2022-07-19 23:39:25,933 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-19 23:39:25,933 INFO L276 IsEmpty]: Start isEmpty. Operand 5304 states and 7353 transitions. [2022-07-19 23:39:25,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-19 23:39:25,943 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:39:25,944 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-19 23:39:25,965 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-19 23:39:26,162 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-19 23:39:26,163 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:39:26,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:39:26,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1643009203, now seen corresponding path program 1 times [2022-07-19 23:39:26,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 23:39:26,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1866809630] [2022-07-19 23:39:26,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:39:26,164 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 23:39:26,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 23:39:26,167 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-19 23:39:26,169 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-19 23:39:26,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:26,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 23:39:26,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:39:26,732 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-19 23:39:26,733 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 23:39:26,733 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 23:39:26,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1866809630] [2022-07-19 23:39:26,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1866809630] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:39:26,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:39:26,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 23:39:26,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222162861] [2022-07-19 23:39:26,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:39:26,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 23:39:26,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 23:39:26,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 23:39:26,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 23:39:26,735 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-19 23:39:26,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:39:26,960 INFO L93 Difference]: Finished difference Result 8032 states and 11140 transitions. [2022-07-19 23:39:26,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 23:39:26,961 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-19 23:39:26,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:39:26,980 INFO L225 Difference]: With dead ends: 8032 [2022-07-19 23:39:26,980 INFO L226 Difference]: Without dead ends: 2743 [2022-07-19 23:39:26,996 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-19 23:39:26,997 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.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 23:39:26,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 3534 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 23:39:27,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2743 states. [2022-07-19 23:39:27,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2743 to 2697. [2022-07-19 23:39:27,088 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-19 23:39:27,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2697 states to 2697 states and 3739 transitions. [2022-07-19 23:39:27,100 INFO L78 Accepts]: Start accepts. Automaton has 2697 states and 3739 transitions. Word has length 151 [2022-07-19 23:39:27,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:39:27,102 INFO L495 AbstractCegarLoop]: Abstraction has 2697 states and 3739 transitions. [2022-07-19 23:39:27,102 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-19 23:39:27,102 INFO L276 IsEmpty]: Start isEmpty. Operand 2697 states and 3739 transitions. [2022-07-19 23:39:27,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-19 23:39:27,110 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:39:27,111 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-19 23:39:27,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-19 23:39:27,328 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-19 23:39:27,329 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:39:27,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:39:27,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1883248949, now seen corresponding path program 1 times [2022-07-19 23:39:27,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 23:39:27,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [690121313] [2022-07-19 23:39:27,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:39:27,330 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 23:39:27,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 23:39:27,333 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-19 23:39:27,335 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-19 23:39:27,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:27,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 23:39:27,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:39:27,883 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-19 23:39:27,884 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 23:39:27,884 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 23:39:27,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [690121313] [2022-07-19 23:39:27,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [690121313] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:39:27,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:39:27,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 23:39:27,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553849413] [2022-07-19 23:39:27,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:39:27,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 23:39:27,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 23:39:27,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 23:39:27,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 23:39:27,886 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-19 23:39:28,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:39:28,200 INFO L93 Difference]: Finished difference Result 6649 states and 9223 transitions. [2022-07-19 23:39:28,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 23:39:28,201 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-19 23:39:28,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:39:28,223 INFO L225 Difference]: With dead ends: 6649 [2022-07-19 23:39:28,223 INFO L226 Difference]: Without dead ends: 4002 [2022-07-19 23:39:28,235 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-19 23:39:28,237 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-19 23:39:28,237 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-19 23:39:28,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4002 states. [2022-07-19 23:39:28,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4002 to 3985. [2022-07-19 23:39:28,407 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-19 23:39:28,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3985 states to 3985 states and 5480 transitions. [2022-07-19 23:39:28,428 INFO L78 Accepts]: Start accepts. Automaton has 3985 states and 5480 transitions. Word has length 151 [2022-07-19 23:39:28,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:39:28,429 INFO L495 AbstractCegarLoop]: Abstraction has 3985 states and 5480 transitions. [2022-07-19 23:39:28,430 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-19 23:39:28,430 INFO L276 IsEmpty]: Start isEmpty. Operand 3985 states and 5480 transitions. [2022-07-19 23:39:28,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-19 23:39:28,438 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:39:28,438 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-19 23:39:28,458 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-19 23:39:28,655 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-19 23:39:28,656 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:39:28,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:39:28,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1042738156, now seen corresponding path program 1 times [2022-07-19 23:39:28,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 23:39:28,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1524399575] [2022-07-19 23:39:28,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:39:28,657 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 23:39:28,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 23:39:28,659 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-19 23:39:28,662 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-19 23:39:29,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:29,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 23:39:29,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:39:29,189 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-19 23:39:29,189 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 23:39:29,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 23:39:29,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1524399575] [2022-07-19 23:39:29,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1524399575] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:39:29,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:39:29,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 23:39:29,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026746767] [2022-07-19 23:39:29,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:39:29,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 23:39:29,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 23:39:29,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 23:39:29,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 23:39:29,192 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-19 23:39:29,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:39:29,292 INFO L93 Difference]: Finished difference Result 5989 states and 8307 transitions. [2022-07-19 23:39:29,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 23:39:29,293 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-19 23:39:29,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:39:29,315 INFO L225 Difference]: With dead ends: 5989 [2022-07-19 23:39:29,315 INFO L226 Difference]: Without dead ends: 4005 [2022-07-19 23:39:29,325 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-19 23:39:29,325 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-19 23:39:29,326 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-19 23:39:29,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4005 states. [2022-07-19 23:39:29,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4005 to 4005. [2022-07-19 23:39:29,442 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-19 23:39:29,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4005 states to 4005 states and 5500 transitions. [2022-07-19 23:39:29,502 INFO L78 Accepts]: Start accepts. Automaton has 4005 states and 5500 transitions. Word has length 156 [2022-07-19 23:39:29,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:39:29,502 INFO L495 AbstractCegarLoop]: Abstraction has 4005 states and 5500 transitions. [2022-07-19 23:39:29,503 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-19 23:39:29,503 INFO L276 IsEmpty]: Start isEmpty. Operand 4005 states and 5500 transitions. [2022-07-19 23:39:29,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-19 23:39:29,513 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:39:29,513 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-19 23:39:29,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-07-19 23:39:29,732 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-19 23:39:29,732 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:39:29,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:39:29,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1404375923, now seen corresponding path program 1 times [2022-07-19 23:39:29,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 23:39:29,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [904574243] [2022-07-19 23:39:29,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:39:29,734 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 23:39:29,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 23:39:29,736 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-19 23:39:29,738 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-19 23:39:30,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:30,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-19 23:39:30,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:39:30,522 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-19 23:39:30,522 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 23:39:30,522 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 23:39:30,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [904574243] [2022-07-19 23:39:30,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [904574243] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:39:30,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:39:30,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 23:39:30,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571227660] [2022-07-19 23:39:30,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:39:30,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 23:39:30,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 23:39:30,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 23:39:30,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 23:39:30,524 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-19 23:39:35,174 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-19 23:39:37,183 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-19 23:39:39,400 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-19 23:39:41,409 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-19 23:39:43,417 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-19 23:39:46,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:39:46,565 INFO L93 Difference]: Finished difference Result 8583 states and 11834 transitions. [2022-07-19 23:39:46,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 23:39:46,566 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-19 23:39:46,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:39:46,588 INFO L225 Difference]: With dead ends: 8583 [2022-07-19 23:39:46,589 INFO L226 Difference]: Without dead ends: 4628 [2022-07-19 23:39:46,601 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-19 23:39:46,601 INFO L413 NwaCegarLoop]: 954 mSDtfsCounter, 1324 mSDsluCounter, 1890 mSDsCounter, 0 mSdLazyCounter, 1521 mSolverCounterSat, 410 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1432 SdHoareTripleChecker+Valid, 2844 SdHoareTripleChecker+Invalid, 1936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 410 IncrementalHoareTripleChecker+Valid, 1521 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.7s IncrementalHoareTripleChecker+Time [2022-07-19 23:39:46,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1432 Valid, 2844 Invalid, 1936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [410 Valid, 1521 Invalid, 5 Unknown, 0 Unchecked, 15.7s Time] [2022-07-19 23:39:46,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4628 states. [2022-07-19 23:39:46,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4628 to 4413. [2022-07-19 23:39:46,755 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-19 23:39:46,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4413 states to 4413 states and 6013 transitions. [2022-07-19 23:39:46,782 INFO L78 Accepts]: Start accepts. Automaton has 4413 states and 6013 transitions. Word has length 158 [2022-07-19 23:39:46,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:39:46,783 INFO L495 AbstractCegarLoop]: Abstraction has 4413 states and 6013 transitions. [2022-07-19 23:39:46,783 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-19 23:39:46,784 INFO L276 IsEmpty]: Start isEmpty. Operand 4413 states and 6013 transitions. [2022-07-19 23:39:46,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-07-19 23:39:46,795 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:39:46,795 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-19 23:39:46,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-19 23:39:47,016 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-19 23:39:47,016 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:39:47,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:39:47,017 INFO L85 PathProgramCache]: Analyzing trace with hash 484822487, now seen corresponding path program 1 times [2022-07-19 23:39:47,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 23:39:47,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1023008104] [2022-07-19 23:39:47,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:39:47,018 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 23:39:47,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 23:39:47,019 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-19 23:39:47,020 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-19 23:39:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:47,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-19 23:39:47,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:39:47,868 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-19 23:39:47,869 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-19 23:39:47,947 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-19 23:39:47,947 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 23:39:47,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 23:39:47,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1023008104] [2022-07-19 23:39:47,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1023008104] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:39:47,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:39:47,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 23:39:47,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458053133] [2022-07-19 23:39:47,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:39:47,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 23:39:47,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 23:39:47,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 23:39:47,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-19 23:39:47,949 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-19 23:39:53,662 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-19 23:39:55,675 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-19 23:39:57,693 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-19 23:39:59,704 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-19 23:40:01,716 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-19 23:40:03,723 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-19 23:40:05,817 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 23:40:07,843 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-19 23:40:09,710 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 23:40:11,731 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-19 23:40:13,190 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 23:40:14,247 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 23:40:17,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:40:17,575 INFO L93 Difference]: Finished difference Result 8878 states and 12123 transitions. [2022-07-19 23:40:17,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 23:40:17,581 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-19 23:40:17,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:40:17,620 INFO L225 Difference]: With dead ends: 8878 [2022-07-19 23:40:17,620 INFO L226 Difference]: Without dead ends: 4515 [2022-07-19 23:40:17,632 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-19 23:40:17,634 INFO L413 NwaCegarLoop]: 874 mSDtfsCounter, 128 mSDsluCounter, 5712 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 29 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 6586 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.1s IncrementalHoareTripleChecker+Time [2022-07-19 23:40:17,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 6586 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 420 Invalid, 8 Unknown, 0 Unchecked, 29.1s Time] [2022-07-19 23:40:17,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4515 states. [2022-07-19 23:40:17,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4515 to 4443. [2022-07-19 23:40:17,751 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-19 23:40:17,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4443 states to 4443 states and 6049 transitions. [2022-07-19 23:40:17,765 INFO L78 Accepts]: Start accepts. Automaton has 4443 states and 6049 transitions. Word has length 193 [2022-07-19 23:40:17,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:40:17,766 INFO L495 AbstractCegarLoop]: Abstraction has 4443 states and 6049 transitions. [2022-07-19 23:40:17,766 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-19 23:40:17,766 INFO L276 IsEmpty]: Start isEmpty. Operand 4443 states and 6049 transitions. [2022-07-19 23:40:17,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-07-19 23:40:17,776 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:40:17,776 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-19 23:40:17,796 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-19 23:40:17,995 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-19 23:40:17,995 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:40:17,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:40:17,996 INFO L85 PathProgramCache]: Analyzing trace with hash -7803687, now seen corresponding path program 1 times [2022-07-19 23:40:17,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 23:40:17,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892030505] [2022-07-19 23:40:17,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:40:17,997 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 23:40:17,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 23:40:17,998 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-19 23:40:18,016 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-19 23:40:18,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:18,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 23:40:18,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:40:18,551 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-19 23:40:18,552 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 23:40:18,552 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 23:40:18,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892030505] [2022-07-19 23:40:18,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1892030505] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:40:18,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:40:18,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 23:40:18,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10484862] [2022-07-19 23:40:18,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:40:18,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 23:40:18,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 23:40:18,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 23:40:18,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 23:40:18,553 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-19 23:40:18,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:40:18,713 INFO L93 Difference]: Finished difference Result 8886 states and 12152 transitions. [2022-07-19 23:40:18,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 23:40:18,713 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-19 23:40:18,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:40:18,730 INFO L225 Difference]: With dead ends: 8886 [2022-07-19 23:40:18,731 INFO L226 Difference]: Without dead ends: 4493 [2022-07-19 23:40:18,742 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-19 23:40:18,743 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-19 23:40:18,744 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-19 23:40:18,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4493 states. [2022-07-19 23:40:18,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4493 to 4475. [2022-07-19 23:40:18,860 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-19 23:40:18,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4475 states to 4475 states and 6089 transitions. [2022-07-19 23:40:18,875 INFO L78 Accepts]: Start accepts. Automaton has 4475 states and 6089 transitions. Word has length 193 [2022-07-19 23:40:18,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:40:18,876 INFO L495 AbstractCegarLoop]: Abstraction has 4475 states and 6089 transitions. [2022-07-19 23:40:18,876 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-19 23:40:18,876 INFO L276 IsEmpty]: Start isEmpty. Operand 4475 states and 6089 transitions. [2022-07-19 23:40:18,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-07-19 23:40:18,887 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:40:18,888 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-19 23:40:18,946 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-19 23:40:19,103 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-19 23:40:19,104 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:40:19,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:40:19,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1515483270, now seen corresponding path program 1 times [2022-07-19 23:40:19,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 23:40:19,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1692198692] [2022-07-19 23:40:19,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:40:19,105 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 23:40:19,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 23:40:19,107 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-19 23:40:19,110 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-19 23:40:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:19,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 23:40:19,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:40:19,607 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-19 23:40:19,608 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 23:40:19,608 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 23:40:19,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1692198692] [2022-07-19 23:40:19,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1692198692] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:40:19,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:40:19,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 23:40:19,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707312283] [2022-07-19 23:40:19,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:40:19,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 23:40:19,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 23:40:19,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 23:40:19,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 23:40:19,611 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-19 23:40:20,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:40:20,077 INFO L93 Difference]: Finished difference Result 10570 states and 14339 transitions. [2022-07-19 23:40:20,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 23:40:20,081 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-19 23:40:20,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:40:20,101 INFO L225 Difference]: With dead ends: 10570 [2022-07-19 23:40:20,102 INFO L226 Difference]: Without dead ends: 6145 [2022-07-19 23:40:20,118 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-19 23:40:20,118 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.3s IncrementalHoareTripleChecker+Time [2022-07-19 23:40:20,119 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.3s Time] [2022-07-19 23:40:20,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6145 states. [2022-07-19 23:40:20,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6145 to 4483. [2022-07-19 23:40:20,277 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-19 23:40:20,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4483 states to 4483 states and 6097 transitions. [2022-07-19 23:40:20,293 INFO L78 Accepts]: Start accepts. Automaton has 4483 states and 6097 transitions. Word has length 215 [2022-07-19 23:40:20,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:40:20,294 INFO L495 AbstractCegarLoop]: Abstraction has 4483 states and 6097 transitions. [2022-07-19 23:40:20,294 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-19 23:40:20,294 INFO L276 IsEmpty]: Start isEmpty. Operand 4483 states and 6097 transitions. [2022-07-19 23:40:20,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-07-19 23:40:20,303 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:40:20,303 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-19 23:40:20,323 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-19 23:40:20,523 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-19 23:40:20,524 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:40:20,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:40:20,524 INFO L85 PathProgramCache]: Analyzing trace with hash -592633712, now seen corresponding path program 1 times [2022-07-19 23:40:20,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 23:40:20,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690781919] [2022-07-19 23:40:20,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:40:20,525 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 23:40:20,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 23:40:20,526 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-19 23:40:20,527 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-19 23:40:20,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:20,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 820 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-19 23:40:20,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:40:21,583 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-19 23:40:21,584 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 23:40:21,584 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 23:40:21,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690781919] [2022-07-19 23:40:21,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1690781919] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:40:21,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:40:21,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-19 23:40:21,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318720974] [2022-07-19 23:40:21,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:40:21,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 23:40:21,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 23:40:21,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 23:40:21,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-19 23:40:21,586 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-19 23:40:22,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:40:22,453 INFO L93 Difference]: Finished difference Result 10681 states and 14957 transitions. [2022-07-19 23:40:22,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 23:40:22,454 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-19 23:40:22,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:40:22,478 INFO L225 Difference]: With dead ends: 10681 [2022-07-19 23:40:22,478 INFO L226 Difference]: Without dead ends: 6248 [2022-07-19 23:40:22,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-07-19 23:40:22,498 INFO L413 NwaCegarLoop]: 1378 mSDtfsCounter, 362 mSDsluCounter, 13282 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-07-19 23:40:22,500 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.5s Time] [2022-07-19 23:40:22,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6248 states. [2022-07-19 23:40:22,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6248 to 4525. [2022-07-19 23:40:22,668 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-19 23:40:22,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4525 states to 4525 states and 6135 transitions. [2022-07-19 23:40:22,684 INFO L78 Accepts]: Start accepts. Automaton has 4525 states and 6135 transitions. Word has length 200 [2022-07-19 23:40:22,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:40:22,686 INFO L495 AbstractCegarLoop]: Abstraction has 4525 states and 6135 transitions. [2022-07-19 23:40:22,687 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-19 23:40:22,687 INFO L276 IsEmpty]: Start isEmpty. Operand 4525 states and 6135 transitions. [2022-07-19 23:40:22,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-07-19 23:40:22,696 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:40:22,697 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-19 23:40:22,720 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-19 23:40:22,919 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-19 23:40:22,920 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:40:22,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:40:22,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1833099563, now seen corresponding path program 1 times [2022-07-19 23:40:22,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 23:40:22,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1148276577] [2022-07-19 23:40:22,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:40:22,921 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 23:40:22,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 23:40:22,922 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-19 23:40:22,923 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-19 23:40:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:23,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 898 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 23:40:23,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:40:23,605 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-19 23:40:23,605 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 23:40:23,605 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 23:40:23,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1148276577] [2022-07-19 23:40:23,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1148276577] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:40:23,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:40:23,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 23:40:23,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297416747] [2022-07-19 23:40:23,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:40:23,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 23:40:23,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 23:40:23,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 23:40:23,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 23:40:23,607 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-19 23:40:24,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:40:24,392 INFO L93 Difference]: Finished difference Result 10696 states and 14455 transitions. [2022-07-19 23:40:24,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 23:40:24,392 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-19 23:40:24,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:40:24,416 INFO L225 Difference]: With dead ends: 10696 [2022-07-19 23:40:24,416 INFO L226 Difference]: Without dead ends: 6221 [2022-07-19 23:40:24,428 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-19 23:40:24,430 INFO L413 NwaCegarLoop]: 1510 mSDtfsCounter, 1212 mSDsluCounter, 3340 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-07-19 23:40:24,430 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.6s Time] [2022-07-19 23:40:24,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6221 states. [2022-07-19 23:40:24,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6221 to 4529. [2022-07-19 23:40:24,661 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-19 23:40:24,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4529 states to 4529 states and 6139 transitions. [2022-07-19 23:40:24,673 INFO L78 Accepts]: Start accepts. Automaton has 4529 states and 6139 transitions. Word has length 226 [2022-07-19 23:40:24,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:40:24,675 INFO L495 AbstractCegarLoop]: Abstraction has 4529 states and 6139 transitions. [2022-07-19 23:40:24,675 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-19 23:40:24,675 INFO L276 IsEmpty]: Start isEmpty. Operand 4529 states and 6139 transitions. [2022-07-19 23:40:24,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2022-07-19 23:40:24,686 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:40:24,686 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-19 23:40:24,709 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-19 23:40:24,908 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-19 23:40:24,908 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:40:24,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:40:24,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1966699871, now seen corresponding path program 1 times [2022-07-19 23:40:24,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 23:40:24,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [166757376] [2022-07-19 23:40:24,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:40:24,910 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 23:40:24,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 23:40:24,911 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-19 23:40:24,912 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-19 23:40:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:25,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 1014 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-19 23:40:25,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:40:26,285 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-19 23:40:26,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 23:40:27,688 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-19 23:40:27,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 23:40:27,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [166757376] [2022-07-19 23:40:27,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [166757376] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 23:40:27,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 23:40:27,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2022-07-19 23:40:27,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593754336] [2022-07-19 23:40:27,689 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 23:40:27,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-19 23:40:27,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 23:40:27,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-19 23:40:27,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-07-19 23:40:27,691 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-19 23:40:32,639 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-19 23:40:34,648 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-19 23:40:36,657 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-19 23:40:39,560 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-19 23:40:41,575 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-19 23:40:43,581 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-19 23:40:45,620 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-19 23:40:47,634 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-19 23:40:57,822 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-19 23:40:59,845 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-19 23:41:01,858 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-19 23:41:03,866 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-19 23:41:05,907 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-19 23:41:07,918 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-19 23:41:09,929 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-19 23:41:13,188 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-19 23:41:15,204 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-19 23:41:17,213 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-19 23:41:19,226 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-19 23:41:21,244 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-19 23:41:23,258 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-19 23:41:26,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:41:26,896 INFO L93 Difference]: Finished difference Result 13740 states and 19055 transitions. [2022-07-19 23:41:26,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-19 23:41:26,897 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-19 23:41:26,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:41:26,928 INFO L225 Difference]: With dead ends: 13740 [2022-07-19 23:41:26,929 INFO L226 Difference]: Without dead ends: 11260 [2022-07-19 23:41:26,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 456 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=204, Invalid=552, Unknown=0, NotChecked=0, Total=756 [2022-07-19 23:41:26,939 INFO L413 NwaCegarLoop]: 1514 mSDtfsCounter, 7072 mSDsluCounter, 5200 mSDsCounter, 0 mSdLazyCounter, 4845 mSolverCounterSat, 2418 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 56.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7277 SdHoareTripleChecker+Valid, 6714 SdHoareTripleChecker+Invalid, 7284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2418 IncrementalHoareTripleChecker+Valid, 4845 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 58.1s IncrementalHoareTripleChecker+Time [2022-07-19 23:41:26,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7277 Valid, 6714 Invalid, 7284 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2418 Valid, 4845 Invalid, 21 Unknown, 0 Unchecked, 58.1s Time] [2022-07-19 23:41:26,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11260 states. [2022-07-19 23:41:27,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11260 to 11074. [2022-07-19 23:41:27,354 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-19 23:41:27,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11074 states to 11074 states and 15161 transitions. [2022-07-19 23:41:27,385 INFO L78 Accepts]: Start accepts. Automaton has 11074 states and 15161 transitions. Word has length 233 [2022-07-19 23:41:27,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:41:27,385 INFO L495 AbstractCegarLoop]: Abstraction has 11074 states and 15161 transitions. [2022-07-19 23:41:27,386 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-19 23:41:27,386 INFO L276 IsEmpty]: Start isEmpty. Operand 11074 states and 15161 transitions. [2022-07-19 23:41:27,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2022-07-19 23:41:27,394 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:41:27,394 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-19 23:41:27,419 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-19 23:41:27,615 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-19 23:41:27,616 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:41:27,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:41:27,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1802197632, now seen corresponding path program 1 times [2022-07-19 23:41:27,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 23:41:27,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1818375833] [2022-07-19 23:41:27,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:41:27,617 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 23:41:27,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 23:41:27,618 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-19 23:41:27,620 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-19 23:41:28,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:28,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 1018 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 23:41:28,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:41:28,269 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-19 23:41:28,269 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 23:41:28,269 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 23:41:28,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1818375833] [2022-07-19 23:41:28,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1818375833] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:41:28,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:41:28,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 23:41:28,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123007352] [2022-07-19 23:41:28,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:41:28,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 23:41:28,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 23:41:28,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 23:41:28,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 23:41:28,271 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-19 23:41:28,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:41:28,667 INFO L93 Difference]: Finished difference Result 20193 states and 27862 transitions. [2022-07-19 23:41:28,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 23:41:28,668 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-19 23:41:28,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:41:28,701 INFO L225 Difference]: With dead ends: 20193 [2022-07-19 23:41:28,701 INFO L226 Difference]: Without dead ends: 11164 [2022-07-19 23:41:28,721 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-19 23:41:28,721 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-19 23:41:28,722 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-19 23:41:28,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11164 states. [2022-07-19 23:41:29,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11164 to 11104. [2022-07-19 23:41:29,163 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-19 23:41:29,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11104 states to 11104 states and 15201 transitions. [2022-07-19 23:41:29,191 INFO L78 Accepts]: Start accepts. Automaton has 11104 states and 15201 transitions. Word has length 235 [2022-07-19 23:41:29,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:41:29,192 INFO L495 AbstractCegarLoop]: Abstraction has 11104 states and 15201 transitions. [2022-07-19 23:41:29,193 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-19 23:41:29,193 INFO L276 IsEmpty]: Start isEmpty. Operand 11104 states and 15201 transitions. [2022-07-19 23:41:29,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2022-07-19 23:41:29,200 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:41:29,201 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-19 23:41:29,228 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-19 23:41:29,425 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-19 23:41:29,426 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:41:29,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:41:29,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1056928775, now seen corresponding path program 1 times [2022-07-19 23:41:29,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 23:41:29,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [684898528] [2022-07-19 23:41:29,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:41:29,428 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 23:41:29,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 23:41:29,429 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-19 23:41:29,431 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-19 23:41:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:30,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 1020 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-19 23:41:30,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:41:31,190 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-19 23:41:31,190 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 23:41:31,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 23:41:31,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [684898528] [2022-07-19 23:41:31,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [684898528] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:41:31,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:41:31,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-19 23:41:31,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145592384] [2022-07-19 23:41:31,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:41:31,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-19 23:41:31,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 23:41:31,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-19 23:41:31,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2022-07-19 23:41:31,193 INFO L87 Difference]: Start difference. First operand 11104 states and 15201 transitions. Second operand has 15 states, 15 states have (on average 9.533333333333333) internal successors, (143), 11 states have internal predecessors, (143), 4 states have call successors, (29), 2 states have call predecessors, (29), 6 states have return successors, (28), 8 states have call predecessors, (28), 4 states have call successors, (28)