./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--wan--hdlc_fr.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_fr.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 6b3de547936c1646f60b80d97a1625774e2d4a48db257d02bb1b2f3a0d43e91e --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 12:36:59,494 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 12:36:59,497 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 12:36:59,544 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 12:36:59,545 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 12:36:59,546 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 12:36:59,548 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 12:36:59,550 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 12:36:59,552 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 12:36:59,556 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 12:36:59,557 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 12:36:59,559 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 12:36:59,559 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 12:36:59,561 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 12:36:59,562 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 12:36:59,566 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 12:36:59,567 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 12:36:59,568 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 12:36:59,570 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 12:36:59,576 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 12:36:59,578 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 12:36:59,579 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 12:36:59,580 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 12:36:59,580 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 12:36:59,582 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 12:36:59,589 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 12:36:59,589 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 12:36:59,589 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 12:36:59,591 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 12:36:59,591 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 12:36:59,592 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 12:36:59,593 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 12:36:59,594 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 12:36:59,595 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 12:36:59,595 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 12:36:59,596 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 12:36:59,596 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 12:36:59,597 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 12:36:59,598 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 12:36:59,598 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 12:36:59,599 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 12:36:59,601 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 12:36:59,602 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 12:36:59,630 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 12:36:59,630 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 12:36:59,631 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 12:36:59,631 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 12:36:59,632 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 12:36:59,632 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 12:36:59,632 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 12:36:59,632 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 12:36:59,633 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 12:36:59,634 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 12:36:59,634 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 12:36:59,634 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 12:36:59,634 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 12:36:59,634 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 12:36:59,634 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 12:36:59,635 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 12:36:59,635 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 12:36:59,635 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 12:36:59,635 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 12:36:59,635 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 12:36:59,636 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 12:36:59,636 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 12:36:59,636 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 12:36:59,636 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 12:36:59,636 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 12:36:59,637 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 12:36:59,637 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 12:36:59,637 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 12:36:59,637 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 12:36:59,637 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 12:36:59,638 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 -> 6b3de547936c1646f60b80d97a1625774e2d4a48db257d02bb1b2f3a0d43e91e [2022-07-12 12:36:59,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 12:36:59,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 12:36:59,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 12:36:59,930 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 12:36:59,931 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 12:36:59,932 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--wan--hdlc_fr.ko-entry_point.cil.out.i [2022-07-12 12:36:59,992 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fbf76806/4f6b538224ed472592687bcec71132ce/FLAGf6ca4c561 [2022-07-12 12:37:00,645 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 12:37:00,645 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--wan--hdlc_fr.ko-entry_point.cil.out.i [2022-07-12 12:37:00,687 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fbf76806/4f6b538224ed472592687bcec71132ce/FLAGf6ca4c561 [2022-07-12 12:37:00,766 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fbf76806/4f6b538224ed472592687bcec71132ce [2022-07-12 12:37:00,769 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 12:37:00,770 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 12:37:00,774 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 12:37:00,774 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 12:37:00,777 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 12:37:00,778 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 12:37:00" (1/1) ... [2022-07-12 12:37:00,779 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@382aeb3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:37:00, skipping insertion in model container [2022-07-12 12:37:00,779 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 12:37:00" (1/1) ... [2022-07-12 12:37:00,785 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 12:37:00,896 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 12:37:01,632 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--wan--hdlc_fr.ko-entry_point.cil.out.i[154748,154761] [2022-07-12 12:37:02,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 12:37:02,266 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 12:37:02,365 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--wan--hdlc_fr.ko-entry_point.cil.out.i[154748,154761] [2022-07-12 12:37:02,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 12:37:02,693 INFO L208 MainTranslator]: Completed translation [2022-07-12 12:37:02,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:37:02 WrapperNode [2022-07-12 12:37:02,696 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 12:37:02,697 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 12:37:02,697 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 12:37:02,697 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 12:37:02,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:37:02" (1/1) ... [2022-07-12 12:37:02,787 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:37:02" (1/1) ... [2022-07-12 12:37:02,918 INFO L137 Inliner]: procedures = 174, calls = 1111, calls flagged for inlining = 78, calls inlined = 75, statements flattened = 3508 [2022-07-12 12:37:02,919 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 12:37:02,920 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 12:37:02,920 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 12:37:02,920 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 12:37:02,928 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:37:02" (1/1) ... [2022-07-12 12:37:02,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:37:02" (1/1) ... [2022-07-12 12:37:02,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:37:02" (1/1) ... [2022-07-12 12:37:02,960 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:37:02" (1/1) ... [2022-07-12 12:37:03,056 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:37:02" (1/1) ... [2022-07-12 12:37:03,077 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:37:02" (1/1) ... [2022-07-12 12:37:03,095 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:37:02" (1/1) ... [2022-07-12 12:37:03,159 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 12:37:03,160 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 12:37:03,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 12:37:03,161 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 12:37:03,172 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:37:02" (1/1) ... [2022-07-12 12:37:03,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 12:37:03,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:37:03,211 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 12:37:03,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 12:37:03,246 INFO L130 BoogieDeclarations]: Found specification of procedure dlci_to_q922 [2022-07-12 12:37:03,246 INFO L138 BoogieDeclarations]: Found implementation of procedure dlci_to_q922 [2022-07-12 12:37:03,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 12:37:03,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 12:37:03,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 12:37:03,247 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 12:37:03,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 12:37:03,247 INFO L130 BoogieDeclarations]: Found specification of procedure dev_queue_xmit [2022-07-12 12:37:03,247 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_queue_xmit [2022-07-12 12:37:03,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 12:37:03,247 INFO L130 BoogieDeclarations]: Found specification of procedure state [2022-07-12 12:37:03,248 INFO L138 BoogieDeclarations]: Found implementation of procedure state [2022-07-12 12:37:03,248 INFO L130 BoogieDeclarations]: Found specification of procedure fr_hard_header [2022-07-12 12:37:03,248 INFO L138 BoogieDeclarations]: Found implementation of procedure fr_hard_header [2022-07-12 12:37:03,248 INFO L130 BoogieDeclarations]: Found specification of procedure find_pvc [2022-07-12 12:37:03,248 INFO L138 BoogieDeclarations]: Found implementation of procedure find_pvc [2022-07-12 12:37:03,248 INFO L130 BoogieDeclarations]: Found specification of procedure dev_to_hdlc [2022-07-12 12:37:03,248 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_to_hdlc [2022-07-12 12:37:03,249 INFO L130 BoogieDeclarations]: Found specification of procedure skb_push [2022-07-12 12:37:03,249 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_push [2022-07-12 12:37:03,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-12 12:37:03,249 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-12 12:37:03,249 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2022-07-12 12:37:03,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2022-07-12 12:37:03,249 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_off [2022-07-12 12:37:03,250 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_off [2022-07-12 12:37:03,250 INFO L130 BoogieDeclarations]: Found specification of procedure pvc_carrier [2022-07-12 12:37:03,250 INFO L138 BoogieDeclarations]: Found implementation of procedure pvc_carrier [2022-07-12 12:37:03,250 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 12:37:03,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 12:37:03,250 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_disconnect_2 [2022-07-12 12:37:03,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_disconnect_2 [2022-07-12 12:37:03,251 INFO L130 BoogieDeclarations]: Found specification of procedure dev_close [2022-07-12 12:37:03,251 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_close [2022-07-12 12:37:03,251 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-07-12 12:37:03,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-07-12 12:37:03,251 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-12 12:37:03,251 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-12 12:37:03,251 INFO L130 BoogieDeclarations]: Found specification of procedure fr_rx [2022-07-12 12:37:03,252 INFO L138 BoogieDeclarations]: Found implementation of procedure fr_rx [2022-07-12 12:37:03,252 INFO L130 BoogieDeclarations]: Found specification of procedure pvc_ioctl [2022-07-12 12:37:03,252 INFO L138 BoogieDeclarations]: Found implementation of procedure pvc_ioctl [2022-07-12 12:37:03,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 12:37:03,252 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-07-12 12:37:03,252 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-07-12 12:37:03,252 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-12 12:37:03,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-12 12:37:03,253 INFO L130 BoogieDeclarations]: Found specification of procedure fr_ioctl [2022-07-12 12:37:03,253 INFO L138 BoogieDeclarations]: Found implementation of procedure fr_ioctl [2022-07-12 12:37:03,253 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2022-07-12 12:37:03,253 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2022-07-12 12:37:03,253 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_ok [2022-07-12 12:37:03,253 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_ok [2022-07-12 12:37:03,254 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_on [2022-07-12 12:37:03,254 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_on [2022-07-12 12:37:03,254 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 12:37:03,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 12:37:03,254 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_netdev_mqs [2022-07-12 12:37:03,254 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_netdev_mqs [2022-07-12 12:37:03,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-12 12:37:03,255 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-12 12:37:03,255 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 12:37:03,255 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 12:37:03,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 12:37:03,255 INFO L130 BoogieDeclarations]: Found specification of procedure hdlc_change_mtu [2022-07-12 12:37:03,255 INFO L138 BoogieDeclarations]: Found implementation of procedure hdlc_change_mtu [2022-07-12 12:37:03,255 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_any [2022-07-12 12:37:03,256 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_any [2022-07-12 12:37:03,256 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2022-07-12 12:37:03,256 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2022-07-12 12:37:03,256 INFO L130 BoogieDeclarations]: Found specification of procedure fr_log_dlci_active [2022-07-12 12:37:03,256 INFO L138 BoogieDeclarations]: Found implementation of procedure fr_log_dlci_active [2022-07-12 12:37:03,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 12:37:03,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 12:37:03,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 12:37:03,257 INFO L130 BoogieDeclarations]: Found specification of procedure delete_unused_pvcs [2022-07-12 12:37:03,257 INFO L138 BoogieDeclarations]: Found implementation of procedure delete_unused_pvcs [2022-07-12 12:37:03,257 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2022-07-12 12:37:03,257 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2022-07-12 12:37:03,257 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-07-12 12:37:03,257 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-07-12 12:37:03,258 INFO L130 BoogieDeclarations]: Found specification of procedure pvc_is_used [2022-07-12 12:37:03,258 INFO L138 BoogieDeclarations]: Found implementation of procedure pvc_is_used [2022-07-12 12:37:03,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 12:37:03,258 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-07-12 12:37:03,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-07-12 12:37:03,258 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2022-07-12 12:37:03,258 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2022-07-12 12:37:03,259 INFO L130 BoogieDeclarations]: Found specification of procedure fr_set_link_state [2022-07-12 12:37:03,259 INFO L138 BoogieDeclarations]: Found implementation of procedure fr_set_link_state [2022-07-12 12:37:03,259 INFO L130 BoogieDeclarations]: Found specification of procedure fr_lmi_send [2022-07-12 12:37:03,259 INFO L138 BoogieDeclarations]: Found implementation of procedure fr_lmi_send [2022-07-12 12:37:03,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 12:37:03,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 12:37:03,259 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-12 12:37:03,260 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-12 12:37:03,260 INFO L130 BoogieDeclarations]: Found specification of procedure capable [2022-07-12 12:37:03,260 INFO L138 BoogieDeclarations]: Found implementation of procedure capable [2022-07-12 12:37:03,260 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-07-12 12:37:03,260 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-07-12 12:37:03,260 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-07-12 12:37:03,261 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-07-12 12:37:03,261 INFO L130 BoogieDeclarations]: Found specification of procedure get_dev_p [2022-07-12 12:37:03,261 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dev_p [2022-07-12 12:37:03,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 12:37:03,261 INFO L130 BoogieDeclarations]: Found specification of procedure linkwatch_fire_event [2022-07-12 12:37:03,261 INFO L138 BoogieDeclarations]: Found implementation of procedure linkwatch_fire_event [2022-07-12 12:37:03,261 INFO L130 BoogieDeclarations]: Found specification of procedure add_pvc [2022-07-12 12:37:03,262 INFO L138 BoogieDeclarations]: Found implementation of procedure add_pvc [2022-07-12 12:37:03,262 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdevice [2022-07-12 12:37:03,262 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdevice [2022-07-12 12:37:03,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-12 12:37:03,262 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-12 12:37:03,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-12 12:37:03,262 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-07-12 12:37:03,263 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-07-12 12:37:03,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 12:37:03,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 12:37:03,850 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 12:37:03,857 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 12:37:04,017 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 12:37:06,261 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 12:37:06,282 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 12:37:06,282 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-12 12:37:06,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:37:06 BoogieIcfgContainer [2022-07-12 12:37:06,287 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 12:37:06,289 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 12:37:06,289 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 12:37:06,298 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 12:37:06,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 12:37:00" (1/3) ... [2022-07-12 12:37:06,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eb319e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 12:37:06, skipping insertion in model container [2022-07-12 12:37:06,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:37:02" (2/3) ... [2022-07-12 12:37:06,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eb319e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 12:37:06, skipping insertion in model container [2022-07-12 12:37:06,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:37:06" (3/3) ... [2022-07-12 12:37:06,303 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_fr.ko-entry_point.cil.out.i [2022-07-12 12:37:06,316 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 12:37:06,316 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 12:37:06,377 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 12:37:06,383 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@7190418, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@11e8bfaa [2022-07-12 12:37:06,383 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 12:37:06,391 INFO L276 IsEmpty]: Start isEmpty. Operand has 1162 states, 845 states have (on average 1.3775147928994083) internal successors, (1164), 861 states have internal predecessors, (1164), 265 states have call successors, (265), 51 states have call predecessors, (265), 50 states have return successors, (261), 260 states have call predecessors, (261), 261 states have call successors, (261) [2022-07-12 12:37:06,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 12:37:06,401 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:37:06,402 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:37:06,402 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:37:06,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:37:06,406 INFO L85 PathProgramCache]: Analyzing trace with hash 16503480, now seen corresponding path program 1 times [2022-07-12 12:37:06,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:37:06,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975797169] [2022-07-12 12:37:06,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:37:06,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:37:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:06,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:37:06,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:06,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:37:06,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:06,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:37:06,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:06,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:37:06,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:06,840 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-12 12:37:06,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:37:06,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975797169] [2022-07-12 12:37:06,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975797169] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:37:06,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:37:06,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 12:37:06,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303197657] [2022-07-12 12:37:06,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:37:06,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 12:37:06,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:37:06,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 12:37:06,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 12:37:06,876 INFO L87 Difference]: Start difference. First operand has 1162 states, 845 states have (on average 1.3775147928994083) internal successors, (1164), 861 states have internal predecessors, (1164), 265 states have call successors, (265), 51 states have call predecessors, (265), 50 states have return successors, (261), 260 states have call predecessors, (261), 261 states have call successors, (261) Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 12:37:10,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:37:10,639 INFO L93 Difference]: Finished difference Result 3724 states and 5603 transitions. [2022-07-12 12:37:10,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 12:37:10,642 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2022-07-12 12:37:10,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:37:10,691 INFO L225 Difference]: With dead ends: 3724 [2022-07-12 12:37:10,691 INFO L226 Difference]: Without dead ends: 2551 [2022-07-12 12:37:10,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-12 12:37:10,720 INFO L413 NwaCegarLoop]: 1882 mSDtfsCounter, 2215 mSDsluCounter, 1900 mSDsCounter, 0 mSdLazyCounter, 1482 mSolverCounterSat, 762 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2434 SdHoareTripleChecker+Valid, 3782 SdHoareTripleChecker+Invalid, 2244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 762 IncrementalHoareTripleChecker+Valid, 1482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-12 12:37:10,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2434 Valid, 3782 Invalid, 2244 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [762 Valid, 1482 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-07-12 12:37:10,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2551 states. [2022-07-12 12:37:10,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2551 to 2273. [2022-07-12 12:37:10,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2273 states, 1659 states have (on average 1.3664858348402653) internal successors, (2267), 1679 states have internal predecessors, (2267), 515 states have call successors, (515), 99 states have call predecessors, (515), 98 states have return successors, (514), 512 states have call predecessors, (514), 514 states have call successors, (514) [2022-07-12 12:37:10,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2273 states to 2273 states and 3296 transitions. [2022-07-12 12:37:10,987 INFO L78 Accepts]: Start accepts. Automaton has 2273 states and 3296 transitions. Word has length 41 [2022-07-12 12:37:10,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:37:10,988 INFO L495 AbstractCegarLoop]: Abstraction has 2273 states and 3296 transitions. [2022-07-12 12:37:10,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 12:37:10,989 INFO L276 IsEmpty]: Start isEmpty. Operand 2273 states and 3296 transitions. [2022-07-12 12:37:10,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 12:37:10,992 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:37:10,993 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:37:10,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 12:37:10,993 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:37:10,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:37:10,994 INFO L85 PathProgramCache]: Analyzing trace with hash 202884705, now seen corresponding path program 1 times [2022-07-12 12:37:10,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:37:10,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241846977] [2022-07-12 12:37:10,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:37:10,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:37:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:11,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:37:11,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:11,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:37:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:11,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:37:11,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:11,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:37:11,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:11,127 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-12 12:37:11,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:37:11,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241846977] [2022-07-12 12:37:11,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241846977] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:37:11,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:37:11,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:37:11,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559103024] [2022-07-12 12:37:11,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:37:11,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:37:11,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:37:11,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:37:11,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:37:11,137 INFO L87 Difference]: Start difference. First operand 2273 states and 3296 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 12:37:14,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:37:14,336 INFO L93 Difference]: Finished difference Result 4811 states and 7034 transitions. [2022-07-12 12:37:14,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 12:37:14,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2022-07-12 12:37:14,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:37:14,359 INFO L225 Difference]: With dead ends: 4811 [2022-07-12 12:37:14,359 INFO L226 Difference]: Without dead ends: 2550 [2022-07-12 12:37:14,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 12:37:14,378 INFO L413 NwaCegarLoop]: 2043 mSDtfsCounter, 2220 mSDsluCounter, 2179 mSDsCounter, 0 mSdLazyCounter, 1488 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2401 SdHoareTripleChecker+Valid, 4222 SdHoareTripleChecker+Invalid, 2140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 1488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-12 12:37:14,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2401 Valid, 4222 Invalid, 2140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 1488 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-12 12:37:14,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2550 states. [2022-07-12 12:37:14,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2550 to 2272. [2022-07-12 12:37:14,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2272 states, 1658 states have (on average 1.3648974668275031) internal successors, (2263), 1678 states have internal predecessors, (2263), 515 states have call successors, (515), 99 states have call predecessors, (515), 98 states have return successors, (514), 512 states have call predecessors, (514), 514 states have call successors, (514) [2022-07-12 12:37:14,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 3292 transitions. [2022-07-12 12:37:14,511 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 3292 transitions. Word has length 44 [2022-07-12 12:37:14,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:37:14,512 INFO L495 AbstractCegarLoop]: Abstraction has 2272 states and 3292 transitions. [2022-07-12 12:37:14,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 12:37:14,512 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 3292 transitions. [2022-07-12 12:37:14,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-12 12:37:14,546 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:37:14,546 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2022-07-12 12:37:14,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 12:37:14,547 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:37:14,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:37:14,547 INFO L85 PathProgramCache]: Analyzing trace with hash -94841370, now seen corresponding path program 1 times [2022-07-12 12:37:14,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:37:14,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477891938] [2022-07-12 12:37:14,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:37:14,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:37:14,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:14,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:37:14,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:14,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:37:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:14,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:37:14,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:14,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:37:14,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:14,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:37:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:14,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:37:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:14,764 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-12 12:37:14,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:37:14,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477891938] [2022-07-12 12:37:14,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477891938] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:37:14,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:37:14,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 12:37:14,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675331978] [2022-07-12 12:37:14,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:37:14,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 12:37:14,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:37:14,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 12:37:14,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 12:37:14,767 INFO L87 Difference]: Start difference. First operand 2272 states and 3292 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 12:37:19,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:37:19,466 INFO L93 Difference]: Finished difference Result 7337 states and 10822 transitions. [2022-07-12 12:37:19,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:37:19,467 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), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 66 [2022-07-12 12:37:19,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:37:19,501 INFO L225 Difference]: With dead ends: 7337 [2022-07-12 12:37:19,501 INFO L226 Difference]: Without dead ends: 5072 [2022-07-12 12:37:19,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 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-12 12:37:19,519 INFO L413 NwaCegarLoop]: 1883 mSDtfsCounter, 2202 mSDsluCounter, 4526 mSDsCounter, 0 mSdLazyCounter, 3079 mSolverCounterSat, 749 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2422 SdHoareTripleChecker+Valid, 6409 SdHoareTripleChecker+Invalid, 3828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 749 IncrementalHoareTripleChecker+Valid, 3079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-12 12:37:19,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2422 Valid, 6409 Invalid, 3828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [749 Valid, 3079 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-07-12 12:37:19,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5072 states. [2022-07-12 12:37:19,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5072 to 4554. [2022-07-12 12:37:19,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4554 states, 3324 states have (on average 1.3655234657039712) internal successors, (4539), 3368 states have internal predecessors, (4539), 1025 states have call successors, (1025), 197 states have call predecessors, (1025), 204 states have return successors, (1084), 1024 states have call predecessors, (1084), 1024 states have call successors, (1084) [2022-07-12 12:37:19,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4554 states to 4554 states and 6648 transitions. [2022-07-12 12:37:19,777 INFO L78 Accepts]: Start accepts. Automaton has 4554 states and 6648 transitions. Word has length 66 [2022-07-12 12:37:19,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:37:19,780 INFO L495 AbstractCegarLoop]: Abstraction has 4554 states and 6648 transitions. [2022-07-12 12:37:19,781 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), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 12:37:19,781 INFO L276 IsEmpty]: Start isEmpty. Operand 4554 states and 6648 transitions. [2022-07-12 12:37:19,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-12 12:37:19,794 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:37:19,794 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:37:19,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 12:37:19,796 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:37:19,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:37:19,796 INFO L85 PathProgramCache]: Analyzing trace with hash -248182647, now seen corresponding path program 1 times [2022-07-12 12:37:19,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:37:19,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879580635] [2022-07-12 12:37:19,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:37:19,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:37:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:20,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:37:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:20,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:37:20,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:20,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:37:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:20,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:37:20,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:20,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:37:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:20,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:37:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:20,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:37:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:20,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:20,091 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-12 12:37:20,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:37:20,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879580635] [2022-07-12 12:37:20,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879580635] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:37:20,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:37:20,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:37:20,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974393125] [2022-07-12 12:37:20,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:37:20,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:37:20,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:37:20,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:37:20,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:37:20,095 INFO L87 Difference]: Start difference. First operand 4554 states and 6648 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-12 12:37:26,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:37:26,544 INFO L93 Difference]: Finished difference Result 15534 states and 23138 transitions. [2022-07-12 12:37:26,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 12:37:26,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 103 [2022-07-12 12:37:26,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:37:26,629 INFO L225 Difference]: With dead ends: 15534 [2022-07-12 12:37:26,630 INFO L226 Difference]: Without dead ends: 10992 [2022-07-12 12:37:26,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 12:37:26,663 INFO L413 NwaCegarLoop]: 2706 mSDtfsCounter, 2575 mSDsluCounter, 2653 mSDsCounter, 0 mSdLazyCounter, 3735 mSolverCounterSat, 1256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2783 SdHoareTripleChecker+Valid, 5359 SdHoareTripleChecker+Invalid, 4991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1256 IncrementalHoareTripleChecker+Valid, 3735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-07-12 12:37:26,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2783 Valid, 5359 Invalid, 4991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1256 Valid, 3735 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2022-07-12 12:37:26,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10992 states. [2022-07-12 12:37:27,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10992 to 9020. [2022-07-12 12:37:27,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9020 states, 6596 states have (on average 1.3635536688902365) internal successors, (8994), 6698 states have internal predecessors, (8994), 2007 states have call successors, (2007), 389 states have call predecessors, (2007), 416 states have return successors, (2153), 2004 states have call predecessors, (2153), 2006 states have call successors, (2153) [2022-07-12 12:37:27,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9020 states to 9020 states and 13154 transitions. [2022-07-12 12:37:27,260 INFO L78 Accepts]: Start accepts. Automaton has 9020 states and 13154 transitions. Word has length 103 [2022-07-12 12:37:27,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:37:27,261 INFO L495 AbstractCegarLoop]: Abstraction has 9020 states and 13154 transitions. [2022-07-12 12:37:27,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-12 12:37:27,262 INFO L276 IsEmpty]: Start isEmpty. Operand 9020 states and 13154 transitions. [2022-07-12 12:37:27,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-12 12:37:27,277 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:37:27,277 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:37:27,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 12:37:27,278 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:37:27,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:37:27,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1651725426, now seen corresponding path program 1 times [2022-07-12 12:37:27,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:37:27,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540680831] [2022-07-12 12:37:27,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:37:27,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:37:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:27,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:37:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:27,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:37:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:27,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:37:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:27,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:37:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:27,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 12:37:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:27,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:27,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 12:37:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:27,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:37:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:27,430 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-12 12:37:27,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:37:27,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540680831] [2022-07-12 12:37:27,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540680831] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:37:27,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:37:27,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:37:27,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424476246] [2022-07-12 12:37:27,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:37:27,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:37:27,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:37:27,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:37:27,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:37:27,434 INFO L87 Difference]: Start difference. First operand 9020 states and 13154 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-12 12:37:33,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:37:33,296 INFO L93 Difference]: Finished difference Result 19708 states and 29148 transitions. [2022-07-12 12:37:33,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 12:37:33,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 95 [2022-07-12 12:37:33,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:37:33,426 INFO L225 Difference]: With dead ends: 19708 [2022-07-12 12:37:33,426 INFO L226 Difference]: Without dead ends: 10700 [2022-07-12 12:37:33,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 12:37:33,470 INFO L413 NwaCegarLoop]: 1848 mSDtfsCounter, 3137 mSDsluCounter, 2006 mSDsCounter, 0 mSdLazyCounter, 3058 mSolverCounterSat, 1627 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3346 SdHoareTripleChecker+Valid, 3854 SdHoareTripleChecker+Invalid, 4685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1627 IncrementalHoareTripleChecker+Valid, 3058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-07-12 12:37:33,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3346 Valid, 3854 Invalid, 4685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1627 Valid, 3058 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-07-12 12:37:33,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10700 states. [2022-07-12 12:37:33,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10700 to 8736. [2022-07-12 12:37:33,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8736 states, 6368 states have (on average 1.3613379396984924) internal successors, (8669), 6472 states have internal predecessors, (8669), 1957 states have call successors, (1957), 383 states have call predecessors, (1957), 410 states have return successors, (2098), 1952 states have call predecessors, (2098), 1956 states have call successors, (2098) [2022-07-12 12:37:34,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8736 states to 8736 states and 12724 transitions. [2022-07-12 12:37:34,006 INFO L78 Accepts]: Start accepts. Automaton has 8736 states and 12724 transitions. Word has length 95 [2022-07-12 12:37:34,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:37:34,006 INFO L495 AbstractCegarLoop]: Abstraction has 8736 states and 12724 transitions. [2022-07-12 12:37:34,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-12 12:37:34,007 INFO L276 IsEmpty]: Start isEmpty. Operand 8736 states and 12724 transitions. [2022-07-12 12:37:34,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-12 12:37:34,024 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:37:34,025 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 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] [2022-07-12 12:37:34,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 12:37:34,025 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:37:34,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:37:34,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1725212051, now seen corresponding path program 1 times [2022-07-12 12:37:34,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:37:34,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901202717] [2022-07-12 12:37:34,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:37:34,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:37:34,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:34,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:37:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:34,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:37:34,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:34,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:37:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:34,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:37:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:34,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:37:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:34,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:37:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:34,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 12:37:34,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:34,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:34,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:34,209 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-07-12 12:37:34,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:37:34,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901202717] [2022-07-12 12:37:34,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901202717] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:37:34,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:37:34,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:37:34,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104450282] [2022-07-12 12:37:34,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:37:34,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:37:34,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:37:34,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:37:34,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:37:34,213 INFO L87 Difference]: Start difference. First operand 8736 states and 12724 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-12 12:37:40,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:37:40,286 INFO L93 Difference]: Finished difference Result 19998 states and 29670 transitions. [2022-07-12 12:37:40,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 12:37:40,290 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 117 [2022-07-12 12:37:40,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:37:40,356 INFO L225 Difference]: With dead ends: 19998 [2022-07-12 12:37:40,356 INFO L226 Difference]: Without dead ends: 13371 [2022-07-12 12:37:40,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 12:37:40,382 INFO L413 NwaCegarLoop]: 2871 mSDtfsCounter, 2477 mSDsluCounter, 2839 mSDsCounter, 0 mSdLazyCounter, 3862 mSolverCounterSat, 1208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2689 SdHoareTripleChecker+Valid, 5710 SdHoareTripleChecker+Invalid, 5070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1208 IncrementalHoareTripleChecker+Valid, 3862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-07-12 12:37:40,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2689 Valid, 5710 Invalid, 5070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1208 Valid, 3862 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-07-12 12:37:40,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13371 states. [2022-07-12 12:37:40,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13371 to 10917. [2022-07-12 12:37:41,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10917 states, 7963 states have (on average 1.361170413160869) internal successors, (10839), 8094 states have internal predecessors, (10839), 2438 states have call successors, (2438), 481 states have call predecessors, (2438), 515 states have return successors, (2613), 2431 states have call predecessors, (2613), 2437 states have call successors, (2613) [2022-07-12 12:37:41,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10917 states to 10917 states and 15890 transitions. [2022-07-12 12:37:41,051 INFO L78 Accepts]: Start accepts. Automaton has 10917 states and 15890 transitions. Word has length 117 [2022-07-12 12:37:41,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:37:41,051 INFO L495 AbstractCegarLoop]: Abstraction has 10917 states and 15890 transitions. [2022-07-12 12:37:41,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-12 12:37:41,052 INFO L276 IsEmpty]: Start isEmpty. Operand 10917 states and 15890 transitions. [2022-07-12 12:37:41,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-12 12:37:41,071 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:37:41,071 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 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] [2022-07-12 12:37:41,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 12:37:41,072 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:37:41,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:37:41,072 INFO L85 PathProgramCache]: Analyzing trace with hash -159171181, now seen corresponding path program 1 times [2022-07-12 12:37:41,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:37:41,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271637685] [2022-07-12 12:37:41,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:37:41,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:37:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:41,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:37:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:41,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:37:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:41,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:37:41,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:41,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:37:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:41,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:37:41,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:41,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:37:41,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:41,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 12:37:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:41,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:41,252 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-07-12 12:37:41,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:37:41,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271637685] [2022-07-12 12:37:41,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271637685] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:37:41,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:37:41,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 12:37:41,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326782382] [2022-07-12 12:37:41,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:37:41,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 12:37:41,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:37:41,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 12:37:41,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 12:37:41,255 INFO L87 Difference]: Start difference. First operand 10917 states and 15890 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-12 12:37:49,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:37:49,247 INFO L93 Difference]: Finished difference Result 27579 states and 40872 transitions. [2022-07-12 12:37:49,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 12:37:49,252 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 122 [2022-07-12 12:37:49,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:37:49,347 INFO L225 Difference]: With dead ends: 27579 [2022-07-12 12:37:49,348 INFO L226 Difference]: Without dead ends: 18771 [2022-07-12 12:37:49,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-12 12:37:49,387 INFO L413 NwaCegarLoop]: 2911 mSDtfsCounter, 2587 mSDsluCounter, 4673 mSDsCounter, 0 mSdLazyCounter, 5522 mSolverCounterSat, 1417 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2728 SdHoareTripleChecker+Valid, 7584 SdHoareTripleChecker+Invalid, 6939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1417 IncrementalHoareTripleChecker+Valid, 5522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-07-12 12:37:49,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2728 Valid, 7584 Invalid, 6939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1417 Valid, 5522 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2022-07-12 12:37:49,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18771 states. [2022-07-12 12:37:50,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18771 to 10921. [2022-07-12 12:37:50,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10921 states, 7967 states have (on average 1.3609890799548137) internal successors, (10843), 8098 states have internal predecessors, (10843), 2438 states have call successors, (2438), 481 states have call predecessors, (2438), 515 states have return successors, (2613), 2431 states have call predecessors, (2613), 2437 states have call successors, (2613) [2022-07-12 12:37:50,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10921 states to 10921 states and 15894 transitions. [2022-07-12 12:37:50,170 INFO L78 Accepts]: Start accepts. Automaton has 10921 states and 15894 transitions. Word has length 122 [2022-07-12 12:37:50,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:37:50,171 INFO L495 AbstractCegarLoop]: Abstraction has 10921 states and 15894 transitions. [2022-07-12 12:37:50,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-12 12:37:50,172 INFO L276 IsEmpty]: Start isEmpty. Operand 10921 states and 15894 transitions. [2022-07-12 12:37:50,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-12 12:37:50,193 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:37:50,193 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 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] [2022-07-12 12:37:50,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 12:37:50,193 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:37:50,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:37:50,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1619034978, now seen corresponding path program 1 times [2022-07-12 12:37:50,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:37:50,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605222752] [2022-07-12 12:37:50,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:37:50,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:37:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:50,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:37:50,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:50,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:37:50,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:50,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:37:50,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:50,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:37:50,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:50,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:37:50,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:50,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:37:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:50,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 12:37:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:50,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:50,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:50,379 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-07-12 12:37:50,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:37:50,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605222752] [2022-07-12 12:37:50,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605222752] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:37:50,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:37:50,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:37:50,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965668305] [2022-07-12 12:37:50,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:37:50,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:37:50,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:37:50,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:37:50,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:37:50,382 INFO L87 Difference]: Start difference. First operand 10921 states and 15894 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-12 12:37:54,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:37:54,480 INFO L93 Difference]: Finished difference Result 19044 states and 28439 transitions. [2022-07-12 12:37:54,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 12:37:54,480 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 132 [2022-07-12 12:37:54,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:37:54,555 INFO L225 Difference]: With dead ends: 19044 [2022-07-12 12:37:54,555 INFO L226 Difference]: Without dead ends: 13373 [2022-07-12 12:37:54,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 12:37:54,589 INFO L413 NwaCegarLoop]: 1540 mSDtfsCounter, 1010 mSDsluCounter, 2026 mSDsCounter, 0 mSdLazyCounter, 2395 mSolverCounterSat, 709 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1054 SdHoareTripleChecker+Valid, 3566 SdHoareTripleChecker+Invalid, 3104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 709 IncrementalHoareTripleChecker+Valid, 2395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-12 12:37:54,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1054 Valid, 3566 Invalid, 3104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [709 Valid, 2395 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-07-12 12:37:54,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13373 states. [2022-07-12 12:37:55,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13373 to 10931. [2022-07-12 12:37:55,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10931 states, 7977 states have (on average 1.3605365425598597) internal successors, (10853), 8108 states have internal predecessors, (10853), 2438 states have call successors, (2438), 481 states have call predecessors, (2438), 515 states have return successors, (2613), 2431 states have call predecessors, (2613), 2437 states have call successors, (2613) [2022-07-12 12:37:55,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10931 states to 10931 states and 15904 transitions. [2022-07-12 12:37:55,361 INFO L78 Accepts]: Start accepts. Automaton has 10931 states and 15904 transitions. Word has length 132 [2022-07-12 12:37:55,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:37:55,362 INFO L495 AbstractCegarLoop]: Abstraction has 10931 states and 15904 transitions. [2022-07-12 12:37:55,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-12 12:37:55,363 INFO L276 IsEmpty]: Start isEmpty. Operand 10931 states and 15904 transitions. [2022-07-12 12:37:55,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-12 12:37:55,382 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:37:55,382 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 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] [2022-07-12 12:37:55,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 12:37:55,382 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:37:55,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:37:55,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1510120385, now seen corresponding path program 1 times [2022-07-12 12:37:55,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:37:55,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888287612] [2022-07-12 12:37:55,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:37:55,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:37:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:55,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:37:55,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:55,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:37:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:55,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:37:55,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:55,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:37:55,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:55,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:37:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:55,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:37:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:55,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 12:37:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:55,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:55,621 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-07-12 12:37:55,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:37:55,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888287612] [2022-07-12 12:37:55,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888287612] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:37:55,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:37:55,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 12:37:55,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23239762] [2022-07-12 12:37:55,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:37:55,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 12:37:55,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:37:55,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 12:37:55,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-12 12:37:55,624 INFO L87 Difference]: Start difference. First operand 10931 states and 15904 transitions. Second operand has 9 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-12 12:38:07,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:38:07,215 INFO L93 Difference]: Finished difference Result 27272 states and 40484 transitions. [2022-07-12 12:38:07,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 12:38:07,220 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 134 [2022-07-12 12:38:07,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:38:07,314 INFO L225 Difference]: With dead ends: 27272 [2022-07-12 12:38:07,314 INFO L226 Difference]: Without dead ends: 16353 [2022-07-12 12:38:07,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2022-07-12 12:38:07,477 INFO L413 NwaCegarLoop]: 1820 mSDtfsCounter, 5469 mSDsluCounter, 5110 mSDsCounter, 0 mSdLazyCounter, 9178 mSolverCounterSat, 3183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5762 SdHoareTripleChecker+Valid, 6930 SdHoareTripleChecker+Invalid, 12361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3183 IncrementalHoareTripleChecker+Valid, 9178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2022-07-12 12:38:07,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5762 Valid, 6930 Invalid, 12361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3183 Valid, 9178 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time] [2022-07-12 12:38:07,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16353 states. [2022-07-12 12:38:08,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16353 to 12266. [2022-07-12 12:38:08,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12266 states, 8957 states have (on average 1.353466562465111) internal successors, (12123), 9118 states have internal predecessors, (12123), 2688 states have call successors, (2688), 576 states have call predecessors, (2688), 620 states have return successors, (2913), 2681 states have call predecessors, (2913), 2687 states have call successors, (2913) [2022-07-12 12:38:08,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12266 states to 12266 states and 17724 transitions. [2022-07-12 12:38:08,222 INFO L78 Accepts]: Start accepts. Automaton has 12266 states and 17724 transitions. Word has length 134 [2022-07-12 12:38:08,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:38:08,223 INFO L495 AbstractCegarLoop]: Abstraction has 12266 states and 17724 transitions. [2022-07-12 12:38:08,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-12 12:38:08,224 INFO L276 IsEmpty]: Start isEmpty. Operand 12266 states and 17724 transitions. [2022-07-12 12:38:08,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-07-12 12:38:08,265 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:38:08,265 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 7, 7, 7, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:38:08,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 12:38:08,266 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:38:08,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:38:08,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1419893241, now seen corresponding path program 1 times [2022-07-12 12:38:08,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:38:08,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850454475] [2022-07-12 12:38:08,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:38:08,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:38:08,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:08,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:38:08,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:08,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:38:08,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:08,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:38:08,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:08,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:38:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:08,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:38:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:08,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:38:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:08,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:38:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:08,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 12:38:08,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:08,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:38:08,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:08,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 12:38:08,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:08,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 12:38:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:08,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 12:38:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:08,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 12:38:08,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:08,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 12:38:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:08,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 12:38:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:08,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:08,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:08,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:38:08,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:08,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 12:38:08,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:08,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 12:38:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:08,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 12:38:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:08,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:08,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:08,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 12:38:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:08,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 12:38:08,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:08,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 12:38:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:08,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-12 12:38:08,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:08,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-12 12:38:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:08,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-12 12:38:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:08,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-12 12:38:08,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:08,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-12 12:38:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:08,585 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2022-07-12 12:38:08,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:38:08,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850454475] [2022-07-12 12:38:08,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850454475] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:38:08,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:38:08,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:38:08,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069430293] [2022-07-12 12:38:08,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:38:08,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:38:08,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:38:08,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:38:08,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:38:08,588 INFO L87 Difference]: Start difference. First operand 12266 states and 17724 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (30), 4 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-12 12:38:11,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:38:11,795 INFO L93 Difference]: Finished difference Result 27785 states and 40884 transitions. [2022-07-12 12:38:11,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 12:38:11,796 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (30), 4 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 208 [2022-07-12 12:38:11,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:38:11,875 INFO L225 Difference]: With dead ends: 27785 [2022-07-12 12:38:11,875 INFO L226 Difference]: Without dead ends: 15531 [2022-07-12 12:38:11,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:38:11,924 INFO L413 NwaCegarLoop]: 1642 mSDtfsCounter, 885 mSDsluCounter, 1864 mSDsCounter, 0 mSdLazyCounter, 1370 mSolverCounterSat, 640 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 3506 SdHoareTripleChecker+Invalid, 2010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 640 IncrementalHoareTripleChecker+Valid, 1370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-12 12:38:11,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 3506 Invalid, 2010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [640 Valid, 1370 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-12 12:38:11,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15531 states. [2022-07-12 12:38:12,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15531 to 13416. [2022-07-12 12:38:12,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13416 states, 9907 states have (on average 1.3498536388412234) internal successors, (13373), 10098 states have internal predecessors, (13373), 2888 states have call successors, (2888), 576 states have call predecessors, (2888), 620 states have return successors, (3158), 2891 states have call predecessors, (3158), 2887 states have call successors, (3158) [2022-07-12 12:38:12,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13416 states to 13416 states and 19419 transitions. [2022-07-12 12:38:12,833 INFO L78 Accepts]: Start accepts. Automaton has 13416 states and 19419 transitions. Word has length 208 [2022-07-12 12:38:12,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:38:12,834 INFO L495 AbstractCegarLoop]: Abstraction has 13416 states and 19419 transitions. [2022-07-12 12:38:12,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (30), 4 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-12 12:38:12,834 INFO L276 IsEmpty]: Start isEmpty. Operand 13416 states and 19419 transitions. [2022-07-12 12:38:12,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-07-12 12:38:12,882 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:38:12,882 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 7, 7, 7, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:38:12,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 12:38:12,883 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:38:12,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:38:12,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1308316105, now seen corresponding path program 1 times [2022-07-12 12:38:12,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:38:12,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054812546] [2022-07-12 12:38:12,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:38:12,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:38:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:13,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:38:13,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:13,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:38:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:13,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:38:13,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:13,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:38:13,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:13,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:38:13,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:13,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:38:13,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:13,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:38:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:13,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 12:38:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:13,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:38:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:13,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 12:38:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:13,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 12:38:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:13,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 12:38:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:13,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 12:38:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:13,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 12:38:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:13,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 12:38:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:13,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:13,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:38:13,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:13,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 12:38:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:13,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 12:38:13,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:13,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 12:38:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:13,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:13,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 12:38:13,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:13,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 12:38:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:13,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 12:38:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:13,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-12 12:38:13,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:13,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-12 12:38:13,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:13,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-12 12:38:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:13,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-12 12:38:13,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:13,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-12 12:38:13,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:13,254 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2022-07-12 12:38:13,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:38:13,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054812546] [2022-07-12 12:38:13,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054812546] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:38:13,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:38:13,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 12:38:13,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38369479] [2022-07-12 12:38:13,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:38:13,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 12:38:13,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:38:13,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 12:38:13,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 12:38:13,257 INFO L87 Difference]: Start difference. First operand 13416 states and 19419 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (30), 4 states have call predecessors, (30), 3 states have return successors, (29), 3 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-12 12:38:18,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:38:18,226 INFO L93 Difference]: Finished difference Result 28720 states and 42214 transitions. [2022-07-12 12:38:18,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 12:38:18,227 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (30), 4 states have call predecessors, (30), 3 states have return successors, (29), 3 states have call predecessors, (29), 2 states have call successors, (29) Word has length 208 [2022-07-12 12:38:18,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:38:18,306 INFO L225 Difference]: With dead ends: 28720 [2022-07-12 12:38:18,306 INFO L226 Difference]: Without dead ends: 15316 [2022-07-12 12:38:18,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-12 12:38:18,364 INFO L413 NwaCegarLoop]: 1611 mSDtfsCounter, 424 mSDsluCounter, 4766 mSDsCounter, 0 mSdLazyCounter, 3135 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 6377 SdHoareTripleChecker+Invalid, 3431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 3135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-12 12:38:18,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 6377 Invalid, 3431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 3135 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-07-12 12:38:18,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15316 states. [2022-07-12 12:38:19,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15316 to 13456. [2022-07-12 12:38:19,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13456 states, 9937 states have (on average 1.3487974237697493) internal successors, (13403), 10128 states have internal predecessors, (13403), 2888 states have call successors, (2888), 576 states have call predecessors, (2888), 630 states have return successors, (3182), 2901 states have call predecessors, (3182), 2887 states have call successors, (3182) [2022-07-12 12:38:19,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13456 states to 13456 states and 19473 transitions. [2022-07-12 12:38:19,158 INFO L78 Accepts]: Start accepts. Automaton has 13456 states and 19473 transitions. Word has length 208 [2022-07-12 12:38:19,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:38:19,159 INFO L495 AbstractCegarLoop]: Abstraction has 13456 states and 19473 transitions. [2022-07-12 12:38:19,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (30), 4 states have call predecessors, (30), 3 states have return successors, (29), 3 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-12 12:38:19,159 INFO L276 IsEmpty]: Start isEmpty. Operand 13456 states and 19473 transitions. [2022-07-12 12:38:19,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-07-12 12:38:19,191 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:38:19,191 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 7, 7, 6, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:38:19,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 12:38:19,192 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:38:19,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:38:19,192 INFO L85 PathProgramCache]: Analyzing trace with hash 2081494971, now seen corresponding path program 1 times [2022-07-12 12:38:19,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:38:19,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478243361] [2022-07-12 12:38:19,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:38:19,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:38:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:19,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:38:19,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:19,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:38:19,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:19,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:38:19,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:19,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:38:19,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:19,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:38:19,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:19,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:38:19,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:19,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:38:19,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:19,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 12:38:19,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:19,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:38:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:19,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 12:38:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:19,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 12:38:19,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:19,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 12:38:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:19,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 12:38:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:19,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 12:38:19,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:19,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 12:38:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:19,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:19,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:19,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:38:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:19,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 12:38:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:19,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 12:38:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:19,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 12:38:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:19,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:19,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:20,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:38:20,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:20,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-12 12:38:20,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:20,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 12:38:20,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:20,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 12:38:20,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:20,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-12 12:38:20,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:20,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-12 12:38:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:20,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-12 12:38:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:20,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-12 12:38:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:20,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 12:38:20,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:20,158 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2022-07-12 12:38:20,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:38:20,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478243361] [2022-07-12 12:38:20,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478243361] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:38:20,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:38:20,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-12 12:38:20,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180531840] [2022-07-12 12:38:20,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:38:20,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 12:38:20,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:38:20,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 12:38:20,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2022-07-12 12:38:20,161 INFO L87 Difference]: Start difference. First operand 13456 states and 19473 transitions. Second operand has 16 states, 15 states have (on average 6.8) internal successors, (102), 11 states have internal predecessors, (102), 3 states have call successors, (31), 4 states have call predecessors, (31), 5 states have return successors, (30), 5 states have call predecessors, (30), 3 states have call successors, (30) [2022-07-12 12:38:29,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:38:29,370 INFO L93 Difference]: Finished difference Result 30395 states and 44714 transitions. [2022-07-12 12:38:29,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 12:38:29,371 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.8) internal successors, (102), 11 states have internal predecessors, (102), 3 states have call successors, (31), 4 states have call predecessors, (31), 5 states have return successors, (30), 5 states have call predecessors, (30), 3 states have call successors, (30) Word has length 215 [2022-07-12 12:38:29,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:38:29,438 INFO L225 Difference]: With dead ends: 30395 [2022-07-12 12:38:29,438 INFO L226 Difference]: Without dead ends: 16951 [2022-07-12 12:38:29,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2022-07-12 12:38:29,484 INFO L413 NwaCegarLoop]: 1710 mSDtfsCounter, 504 mSDsluCounter, 15556 mSDsCounter, 0 mSdLazyCounter, 7998 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 17266 SdHoareTripleChecker+Invalid, 8297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 7998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-07-12 12:38:29,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 17266 Invalid, 8297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 7998 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2022-07-12 12:38:29,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16951 states. [2022-07-12 12:38:30,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16951 to 13536. [2022-07-12 12:38:30,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13536 states, 10007 states have (on average 1.3433596482462276) internal successors, (13443), 10188 states have internal predecessors, (13443), 2888 states have call successors, (2888), 576 states have call predecessors, (2888), 640 states have return successors, (3202), 2921 states have call predecessors, (3202), 2887 states have call successors, (3202) [2022-07-12 12:38:30,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13536 states to 13536 states and 19533 transitions. [2022-07-12 12:38:30,314 INFO L78 Accepts]: Start accepts. Automaton has 13536 states and 19533 transitions. Word has length 215 [2022-07-12 12:38:30,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:38:30,315 INFO L495 AbstractCegarLoop]: Abstraction has 13536 states and 19533 transitions. [2022-07-12 12:38:30,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.8) internal successors, (102), 11 states have internal predecessors, (102), 3 states have call successors, (31), 4 states have call predecessors, (31), 5 states have return successors, (30), 5 states have call predecessors, (30), 3 states have call successors, (30) [2022-07-12 12:38:30,315 INFO L276 IsEmpty]: Start isEmpty. Operand 13536 states and 19533 transitions. [2022-07-12 12:38:30,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2022-07-12 12:38:30,342 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:38:30,343 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 7, 7, 6, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:38:30,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 12:38:30,343 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:38:30,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:38:30,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1853804592, now seen corresponding path program 1 times [2022-07-12 12:38:30,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:38:30,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264252026] [2022-07-12 12:38:30,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:38:30,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:38:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:38:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:38:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:38:30,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:38:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:38:30,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:38:30,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 12:38:30,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:38:30,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:38:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:38:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 12:38:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 12:38:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 12:38:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 12:38:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:38:30,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 12:38:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 12:38:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 12:38:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:38:30,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 12:38:30,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 12:38:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 12:38:30,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:30,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:38:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 12:38:30,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 12:38:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:38:30,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 12:38:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 12:38:30,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 12:38:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 12:38:30,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 12:38:30,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-12 12:38:30,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,829 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2022-07-12 12:38:30,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:38:30,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264252026] [2022-07-12 12:38:30,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264252026] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:38:30,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:38:30,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 12:38:30,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608017128] [2022-07-12 12:38:30,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:38:30,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 12:38:30,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:38:30,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 12:38:30,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 12:38:30,832 INFO L87 Difference]: Start difference. First operand 13536 states and 19533 transitions. Second operand has 7 states, 7 states have (on average 26.714285714285715) internal successors, (187), 4 states have internal predecessors, (187), 3 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2022-07-12 12:38:39,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:38:39,452 INFO L93 Difference]: Finished difference Result 45858 states and 67578 transitions. [2022-07-12 12:38:39,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 12:38:39,452 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 26.714285714285715) internal successors, (187), 4 states have internal predecessors, (187), 3 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) Word has length 309 [2022-07-12 12:38:39,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:38:39,567 INFO L225 Difference]: With dead ends: 45858 [2022-07-12 12:38:39,567 INFO L226 Difference]: Without dead ends: 32334 [2022-07-12 12:38:39,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-07-12 12:38:39,624 INFO L413 NwaCegarLoop]: 2244 mSDtfsCounter, 2275 mSDsluCounter, 5204 mSDsCounter, 0 mSdLazyCounter, 5144 mSolverCounterSat, 911 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2496 SdHoareTripleChecker+Valid, 7448 SdHoareTripleChecker+Invalid, 6055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 911 IncrementalHoareTripleChecker+Valid, 5144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-07-12 12:38:39,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2496 Valid, 7448 Invalid, 6055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [911 Valid, 5144 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2022-07-12 12:38:39,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32334 states. [2022-07-12 12:38:40,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32334 to 25796. [2022-07-12 12:38:40,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25796 states, 19254 states have (on average 1.3418510439389217) internal successors, (25836), 19600 states have internal predecessors, (25836), 5291 states have call successors, (5291), 1121 states have call predecessors, (5291), 1250 states have return successors, (5856), 5374 states have call predecessors, (5856), 5290 states have call successors, (5856) [2022-07-12 12:38:40,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25796 states to 25796 states and 36983 transitions. [2022-07-12 12:38:40,986 INFO L78 Accepts]: Start accepts. Automaton has 25796 states and 36983 transitions. Word has length 309 [2022-07-12 12:38:40,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:38:40,987 INFO L495 AbstractCegarLoop]: Abstraction has 25796 states and 36983 transitions. [2022-07-12 12:38:40,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.714285714285715) internal successors, (187), 4 states have internal predecessors, (187), 3 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2022-07-12 12:38:40,987 INFO L276 IsEmpty]: Start isEmpty. Operand 25796 states and 36983 transitions. [2022-07-12 12:38:41,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2022-07-12 12:38:41,026 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:38:41,026 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 7, 7, 6, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:38:41,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 12:38:41,027 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:38:41,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:38:41,027 INFO L85 PathProgramCache]: Analyzing trace with hash 209812636, now seen corresponding path program 1 times [2022-07-12 12:38:41,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:38:41,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703593133] [2022-07-12 12:38:41,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:38:41,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:38:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:41,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:38:41,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:41,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:38:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:41,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:38:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:41,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:38:41,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:41,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:38:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:41,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:38:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:41,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 12:38:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:41,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:41,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:41,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:38:41,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:41,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:38:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:41,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:38:41,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:41,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 12:38:41,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:41,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 12:38:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:41,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 12:38:41,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:41,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 12:38:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:41,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:38:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:41,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 12:38:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:41,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 12:38:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:41,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 12:38:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:41,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:41,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:38:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:41,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 12:38:41,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:41,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 12:38:41,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:41,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 12:38:41,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:41,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:41,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:38:41,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:41,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 12:38:41,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:41,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 12:38:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:41,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:38:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:41,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 12:38:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:41,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 12:38:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:41,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 12:38:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:41,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 12:38:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:41,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 12:38:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:41,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-12 12:38:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:41,457 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2022-07-12 12:38:41,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:38:41,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703593133] [2022-07-12 12:38:41,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703593133] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:38:41,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:38:41,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 12:38:41,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803009263] [2022-07-12 12:38:41,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:38:41,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 12:38:41,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:38:41,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 12:38:41,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 12:38:41,460 INFO L87 Difference]: Start difference. First operand 25796 states and 36983 transitions. Second operand has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 3 states have internal predecessors, (185), 2 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2022-07-12 12:38:47,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:38:47,343 INFO L93 Difference]: Finished difference Result 60524 states and 88845 transitions. [2022-07-12 12:38:47,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:38:47,344 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 3 states have internal predecessors, (185), 2 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 309 [2022-07-12 12:38:47,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:38:47,484 INFO L225 Difference]: With dead ends: 60524 [2022-07-12 12:38:47,484 INFO L226 Difference]: Without dead ends: 34740 [2022-07-12 12:38:47,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:38:47,557 INFO L413 NwaCegarLoop]: 1631 mSDtfsCounter, 1198 mSDsluCounter, 2471 mSDsCounter, 0 mSdLazyCounter, 2163 mSolverCounterSat, 723 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1309 SdHoareTripleChecker+Valid, 4102 SdHoareTripleChecker+Invalid, 2886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 723 IncrementalHoareTripleChecker+Valid, 2163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-12 12:38:47,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1309 Valid, 4102 Invalid, 2886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [723 Valid, 2163 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-07-12 12:38:47,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34740 states. [2022-07-12 12:38:48,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34740 to 26996. [2022-07-12 12:38:49,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26996 states, 20254 states have (on average 1.3526217043546953) internal successors, (27396), 20620 states have internal predecessors, (27396), 5491 states have call successors, (5491), 1121 states have call predecessors, (5491), 1250 states have return successors, (6056), 5574 states have call predecessors, (6056), 5490 states have call successors, (6056) [2022-07-12 12:38:49,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26996 states to 26996 states and 38943 transitions. [2022-07-12 12:38:49,102 INFO L78 Accepts]: Start accepts. Automaton has 26996 states and 38943 transitions. Word has length 309 [2022-07-12 12:38:49,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:38:49,102 INFO L495 AbstractCegarLoop]: Abstraction has 26996 states and 38943 transitions. [2022-07-12 12:38:49,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 3 states have internal predecessors, (185), 2 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2022-07-12 12:38:49,102 INFO L276 IsEmpty]: Start isEmpty. Operand 26996 states and 38943 transitions. [2022-07-12 12:38:49,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2022-07-12 12:38:49,269 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:38:49,270 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 7, 7, 6, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:38:49,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 12:38:49,270 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:38:49,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:38:49,271 INFO L85 PathProgramCache]: Analyzing trace with hash -429672610, now seen corresponding path program 1 times [2022-07-12 12:38:49,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:38:49,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538900050] [2022-07-12 12:38:49,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:38:49,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:38:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:38:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:38:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:38:49,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:38:49,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:38:49,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:38:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 12:38:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:38:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:38:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:38:49,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 12:38:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 12:38:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 12:38:49,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 12:38:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:38:49,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 12:38:49,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 12:38:49,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 12:38:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:49,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:38:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 12:38:49,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 12:38:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 12:38:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:38:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 12:38:49,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 12:38:49,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:38:49,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 12:38:49,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 12:38:49,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 12:38:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 12:38:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 12:38:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-12 12:38:49,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,764 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2022-07-12 12:38:49,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:38:49,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538900050] [2022-07-12 12:38:49,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538900050] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:38:49,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:38:49,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 12:38:49,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560033643] [2022-07-12 12:38:49,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:38:49,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 12:38:49,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:38:49,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 12:38:49,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 12:38:49,767 INFO L87 Difference]: Start difference. First operand 26996 states and 38943 transitions. Second operand has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 3 states have internal predecessors, (185), 3 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2022-07-12 12:38:55,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:38:55,749 INFO L93 Difference]: Finished difference Result 61744 states and 90795 transitions. [2022-07-12 12:38:55,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:38:55,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 3 states have internal predecessors, (185), 3 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) Word has length 309 [2022-07-12 12:38:55,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:38:55,878 INFO L225 Difference]: With dead ends: 61744 [2022-07-12 12:38:55,878 INFO L226 Difference]: Without dead ends: 34760 [2022-07-12 12:38:55,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:38:55,961 INFO L413 NwaCegarLoop]: 1560 mSDtfsCounter, 714 mSDsluCounter, 2866 mSDsCounter, 0 mSdLazyCounter, 2803 mSolverCounterSat, 363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 4426 SdHoareTripleChecker+Invalid, 3166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 363 IncrementalHoareTripleChecker+Valid, 2803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-12 12:38:55,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 4426 Invalid, 3166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [363 Valid, 2803 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-07-12 12:38:55,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34760 states. [2022-07-12 12:38:57,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34760 to 27596. [2022-07-12 12:38:57,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27596 states, 20794 states have (on average 1.3588535154371453) internal successors, (28256), 21160 states have internal predecessors, (28256), 5551 states have call successors, (5551), 1121 states have call predecessors, (5551), 1250 states have return successors, (6116), 5634 states have call predecessors, (6116), 5550 states have call successors, (6116) [2022-07-12 12:38:57,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27596 states to 27596 states and 39923 transitions. [2022-07-12 12:38:57,428 INFO L78 Accepts]: Start accepts. Automaton has 27596 states and 39923 transitions. Word has length 309 [2022-07-12 12:38:57,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:38:57,429 INFO L495 AbstractCegarLoop]: Abstraction has 27596 states and 39923 transitions. [2022-07-12 12:38:57,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 3 states have internal predecessors, (185), 3 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2022-07-12 12:38:57,430 INFO L276 IsEmpty]: Start isEmpty. Operand 27596 states and 39923 transitions. [2022-07-12 12:38:57,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2022-07-12 12:38:57,465 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:38:57,466 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 7, 7, 6, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:38:57,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 12:38:57,466 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:38:57,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:38:57,466 INFO L85 PathProgramCache]: Analyzing trace with hash -145687072, now seen corresponding path program 1 times [2022-07-12 12:38:57,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:38:57,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090966943] [2022-07-12 12:38:57,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:38:57,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:38:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:57,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:38:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:57,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:38:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:57,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:38:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:57,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:38:57,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:57,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:38:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:57,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:38:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:57,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 12:38:57,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:57,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:57,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:38:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:57,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:38:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:57,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:38:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:57,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 12:38:57,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:57,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 12:38:57,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:57,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 12:38:57,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:57,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 12:38:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:57,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:38:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:57,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 12:38:57,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:57,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 12:38:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:57,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 12:38:57,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:57,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:57,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:38:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:57,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 12:38:57,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:57,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 12:38:57,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:57,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 12:38:57,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:57,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:57,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:38:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:57,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 12:38:57,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:57,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 12:38:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:57,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:38:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:57,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 12:38:57,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:57,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 12:38:57,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:57,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 12:38:57,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:57,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 12:38:57,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:57,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 12:38:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:57,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-12 12:38:57,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:57,909 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2022-07-12 12:38:57,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:38:57,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090966943] [2022-07-12 12:38:57,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090966943] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:38:57,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:38:57,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 12:38:57,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908871007] [2022-07-12 12:38:57,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:38:57,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 12:38:57,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:38:57,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 12:38:57,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 12:38:57,915 INFO L87 Difference]: Start difference. First operand 27596 states and 39923 transitions. Second operand has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 3 states have internal predecessors, (185), 3 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2022-07-12 12:39:03,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:39:03,513 INFO L93 Difference]: Finished difference Result 62004 states and 91175 transitions. [2022-07-12 12:39:03,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:39:03,514 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 3 states have internal predecessors, (185), 3 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) Word has length 309 [2022-07-12 12:39:03,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:39:03,639 INFO L225 Difference]: With dead ends: 62004 [2022-07-12 12:39:03,639 INFO L226 Difference]: Without dead ends: 34420 [2022-07-12 12:39:03,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:39:03,848 INFO L413 NwaCegarLoop]: 1583 mSDtfsCounter, 1093 mSDsluCounter, 2339 mSDsCounter, 0 mSdLazyCounter, 2062 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1192 SdHoareTripleChecker+Valid, 3922 SdHoareTripleChecker+Invalid, 2758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 2062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-12 12:39:03,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1192 Valid, 3922 Invalid, 2758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 2062 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-07-12 12:39:03,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34420 states. [2022-07-12 12:39:05,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34420 to 27596. [2022-07-12 12:39:05,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27596 states, 20794 states have (on average 1.3550062518034047) internal successors, (28176), 21160 states have internal predecessors, (28176), 5551 states have call successors, (5551), 1121 states have call predecessors, (5551), 1250 states have return successors, (6116), 5634 states have call predecessors, (6116), 5550 states have call successors, (6116) [2022-07-12 12:39:05,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27596 states to 27596 states and 39843 transitions. [2022-07-12 12:39:05,392 INFO L78 Accepts]: Start accepts. Automaton has 27596 states and 39843 transitions. Word has length 309 [2022-07-12 12:39:05,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:39:05,393 INFO L495 AbstractCegarLoop]: Abstraction has 27596 states and 39843 transitions. [2022-07-12 12:39:05,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 3 states have internal predecessors, (185), 3 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2022-07-12 12:39:05,393 INFO L276 IsEmpty]: Start isEmpty. Operand 27596 states and 39843 transitions. [2022-07-12 12:39:05,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2022-07-12 12:39:05,435 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:39:05,435 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 7, 7, 6, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:39:05,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 12:39:05,436 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:39:05,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:39:05,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1138629090, now seen corresponding path program 1 times [2022-07-12 12:39:05,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:39:05,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118090951] [2022-07-12 12:39:05,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:39:05,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:39:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:39:05,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:39:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:39:05,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:39:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:39:05,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:39:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:39:05,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:39:05,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 12:39:05,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 12:39:05,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 12:39:05,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 12:39:05,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 12:39:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 12:39:05,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 12:39:05,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 12:39:05,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 12:39:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:05,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:39:05,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 12:39:05,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 12:39:05,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 12:39:05,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:39:05,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 12:39:05,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 12:39:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:39:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 12:39:05,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 12:39:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 12:39:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 12:39:05,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 12:39:05,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-07-12 12:39:05,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-07-12 12:39:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-07-12 12:39:05,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,874 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2022-07-12 12:39:05,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:39:05,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118090951] [2022-07-12 12:39:05,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118090951] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:39:05,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:39:05,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 12:39:05,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175582904] [2022-07-12 12:39:05,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:39:05,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 12:39:05,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:39:05,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 12:39:05,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:39:05,877 INFO L87 Difference]: Start difference. First operand 27596 states and 39843 transitions. Second operand has 8 states, 8 states have (on average 23.0) internal successors, (184), 5 states have internal predecessors, (184), 2 states have call successors, (37), 5 states have call predecessors, (37), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-07-12 12:39:13,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:39:13,998 INFO L93 Difference]: Finished difference Result 62559 states and 91271 transitions. [2022-07-12 12:39:13,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 12:39:13,998 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 23.0) internal successors, (184), 5 states have internal predecessors, (184), 2 states have call successors, (37), 5 states have call predecessors, (37), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 314 [2022-07-12 12:39:13,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:39:14,157 INFO L225 Difference]: With dead ends: 62559 [2022-07-12 12:39:14,157 INFO L226 Difference]: Without dead ends: 34975 [2022-07-12 12:39:14,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2022-07-12 12:39:14,254 INFO L413 NwaCegarLoop]: 1919 mSDtfsCounter, 2188 mSDsluCounter, 5299 mSDsCounter, 0 mSdLazyCounter, 4297 mSolverCounterSat, 1385 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2346 SdHoareTripleChecker+Valid, 7218 SdHoareTripleChecker+Invalid, 5682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1385 IncrementalHoareTripleChecker+Valid, 4297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-07-12 12:39:14,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2346 Valid, 7218 Invalid, 5682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1385 Valid, 4297 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-07-12 12:39:14,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34975 states. [2022-07-12 12:39:15,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34975 to 29188. [2022-07-12 12:39:15,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29188 states, 21983 states have (on average 1.3436291679934496) internal successors, (29537), 22387 states have internal predecessors, (29537), 5795 states have call successors, (5795), 1251 states have call predecessors, (5795), 1409 states have return successors, (6448), 5915 states have call predecessors, (6448), 5794 states have call successors, (6448) [2022-07-12 12:39:16,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29188 states to 29188 states and 41780 transitions. [2022-07-12 12:39:16,030 INFO L78 Accepts]: Start accepts. Automaton has 29188 states and 41780 transitions. Word has length 314 [2022-07-12 12:39:16,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:39:16,031 INFO L495 AbstractCegarLoop]: Abstraction has 29188 states and 41780 transitions. [2022-07-12 12:39:16,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 23.0) internal successors, (184), 5 states have internal predecessors, (184), 2 states have call successors, (37), 5 states have call predecessors, (37), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-07-12 12:39:16,031 INFO L276 IsEmpty]: Start isEmpty. Operand 29188 states and 41780 transitions. [2022-07-12 12:39:16,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2022-07-12 12:39:16,068 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:39:16,069 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 7, 7, 6, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:39:16,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 12:39:16,069 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:39:16,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:39:16,070 INFO L85 PathProgramCache]: Analyzing trace with hash -733109948, now seen corresponding path program 1 times [2022-07-12 12:39:16,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:39:16,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600669510] [2022-07-12 12:39:16,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:39:16,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:39:16,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:16,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:39:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:16,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:39:16,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:16,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:39:16,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:16,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:39:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:16,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:39:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:16,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:39:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:16,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 12:39:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:16,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:16,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:39:16,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:16,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:39:16,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:16,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:39:16,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:16,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 12:39:16,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:16,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 12:39:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:16,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 12:39:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:16,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 12:39:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:16,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 12:39:16,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:16,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 12:39:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:16,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 12:39:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:16,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 12:39:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:16,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 12:39:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:16,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:16,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:39:16,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:16,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 12:39:16,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:16,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 12:39:16,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:16,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 12:39:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:16,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:16,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:16,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:39:16,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:16,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 12:39:16,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:16,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 12:39:16,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:16,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:39:16,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:16,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 12:39:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:16,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 12:39:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:16,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 12:39:16,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:16,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 12:39:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:16,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 12:39:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:16,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-07-12 12:39:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:16,664 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2022-07-12 12:39:16,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:39:16,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600669510] [2022-07-12 12:39:16,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600669510] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:39:16,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:39:16,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 12:39:16,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958592231] [2022-07-12 12:39:16,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:39:16,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 12:39:16,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:39:16,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 12:39:16,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 12:39:16,666 INFO L87 Difference]: Start difference. First operand 29188 states and 41780 transitions. Second operand has 6 states, 6 states have (on average 31.0) internal successors, (186), 3 states have internal predecessors, (186), 2 states have call successors, (37), 5 states have call predecessors, (37), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-07-12 12:39:23,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:39:23,099 INFO L93 Difference]: Finished difference Result 64166 states and 93583 transitions. [2022-07-12 12:39:23,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 12:39:23,100 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.0) internal successors, (186), 3 states have internal predecessors, (186), 2 states have call successors, (37), 5 states have call predecessors, (37), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 314 [2022-07-12 12:39:23,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:39:23,218 INFO L225 Difference]: With dead ends: 64166 [2022-07-12 12:39:23,218 INFO L226 Difference]: Without dead ends: 34990 [2022-07-12 12:39:23,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-07-12 12:39:23,296 INFO L413 NwaCegarLoop]: 1519 mSDtfsCounter, 652 mSDsluCounter, 2813 mSDsCounter, 0 mSdLazyCounter, 2730 mSolverCounterSat, 388 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 4332 SdHoareTripleChecker+Invalid, 3118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 388 IncrementalHoareTripleChecker+Valid, 2730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-07-12 12:39:23,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 4332 Invalid, 3118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [388 Valid, 2730 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-07-12 12:39:23,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34990 states. [2022-07-12 12:39:24,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34990 to 29227. [2022-07-12 12:39:24,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29227 states, 22009 states have (on average 1.3414512244990686) internal successors, (29524), 22413 states have internal predecessors, (29524), 5808 states have call successors, (5808), 1251 states have call predecessors, (5808), 1409 states have return successors, (6461), 5928 states have call predecessors, (6461), 5807 states have call successors, (6461) [2022-07-12 12:39:24,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29227 states to 29227 states and 41793 transitions. [2022-07-12 12:39:24,989 INFO L78 Accepts]: Start accepts. Automaton has 29227 states and 41793 transitions. Word has length 314 [2022-07-12 12:39:24,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:39:24,990 INFO L495 AbstractCegarLoop]: Abstraction has 29227 states and 41793 transitions. [2022-07-12 12:39:24,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.0) internal successors, (186), 3 states have internal predecessors, (186), 2 states have call successors, (37), 5 states have call predecessors, (37), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-07-12 12:39:24,990 INFO L276 IsEmpty]: Start isEmpty. Operand 29227 states and 41793 transitions. [2022-07-12 12:39:25,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2022-07-12 12:39:25,032 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:39:25,032 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 7, 7, 6, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:39:25,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 12:39:25,033 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:39:25,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:39:25,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1928465655, now seen corresponding path program 1 times [2022-07-12 12:39:25,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:39:25,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715235593] [2022-07-12 12:39:25,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:39:25,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:39:25,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:26,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:39:26,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:26,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:39:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:26,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:39:26,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:26,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:39:26,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:26,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:39:26,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:26,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:39:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:26,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 12:39:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:26,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:26,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:39:26,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:26,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:39:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:26,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:39:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:26,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 12:39:26,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:26,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 12:39:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:26,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 12:39:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:26,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 12:39:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:26,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 12:39:26,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:26,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 12:39:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:26,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 12:39:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:26,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 12:39:26,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:26,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 12:39:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:26,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:26,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:39:26,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:26,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 12:39:26,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:26,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 12:39:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:26,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 12:39:26,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:26,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:26,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:26,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:39:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:26,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 12:39:26,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:26,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 12:39:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:27,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:39:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:27,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 12:39:27,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:27,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 12:39:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:27,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-12 12:39:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:27,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 12:39:27,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:27,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 12:39:27,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:27,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-12 12:39:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:27,238 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2022-07-12 12:39:27,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:39:27,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715235593] [2022-07-12 12:39:27,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715235593] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:39:27,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860435012] [2022-07-12 12:39:27,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:39:27,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:39:27,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:39:27,242 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:39:27,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 12:39:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:28,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 2485 conjuncts, 136 conjunts are in the unsatisfiable core [2022-07-12 12:39:28,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:39:51,729 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 12:39:51,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 103 [2022-07-12 12:39:51,762 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 12:39:51,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 85 [2022-07-12 12:39:51,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-07-12 12:39:52,010 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 164 proven. 5 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2022-07-12 12:39:52,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 12:39:53,344 INFO L356 Elim1Store]: treesize reduction 8, result has 70.4 percent of original size [2022-07-12 12:39:53,345 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 37 treesize of output 32 [2022-07-12 12:39:53,391 INFO L356 Elim1Store]: treesize reduction 6, result has 60.0 percent of original size [2022-07-12 12:39:53,391 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 15 treesize of output 13 [2022-07-12 12:39:53,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 12:39:53,399 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-07-12 12:39:53,557 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 8 proven. 67 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2022-07-12 12:39:53,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860435012] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 12:39:53,557 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 12:39:53,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 18] total 51 [2022-07-12 12:39:53,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735641797] [2022-07-12 12:39:53,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 12:39:53,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-12 12:39:53,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:39:53,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-12 12:39:53,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2410, Unknown=5, NotChecked=0, Total=2550 [2022-07-12 12:39:53,561 INFO L87 Difference]: Start difference. First operand 29227 states and 41793 transitions. Second operand has 51 states, 46 states have (on average 8.565217391304348) internal successors, (394), 37 states have internal predecessors, (394), 14 states have call successors, (98), 8 states have call predecessors, (98), 12 states have return successors, (91), 16 states have call predecessors, (91), 14 states have call successors, (91)