./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--touchscreen--usbtouchscreen.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--touchscreen--usbtouchscreen.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 5c13092b5fe0ffbf7fbf1fe31d493be6a68ca2455b811b10fd7983ff470e432f --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 00:01:07,497 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 00:01:07,499 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 00:01:07,526 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 00:01:07,527 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 00:01:07,528 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 00:01:07,530 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 00:01:07,533 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 00:01:07,535 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 00:01:07,538 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 00:01:07,538 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 00:01:07,540 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 00:01:07,540 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 00:01:07,542 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 00:01:07,543 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 00:01:07,544 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 00:01:07,545 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 00:01:07,546 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 00:01:07,548 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 00:01:07,551 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 00:01:07,552 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 00:01:07,553 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 00:01:07,553 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 00:01:07,554 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 00:01:07,555 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 00:01:07,560 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 00:01:07,561 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 00:01:07,561 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 00:01:07,561 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 00:01:07,562 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 00:01:07,562 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 00:01:07,562 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 00:01:07,563 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 00:01:07,563 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 00:01:07,563 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 00:01:07,564 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 00:01:07,564 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 00:01:07,564 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 00:01:07,564 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 00:01:07,564 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 00:01:07,565 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 00:01:07,580 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 00:01:07,580 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-14 00:01:07,616 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 00:01:07,616 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 00:01:07,617 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 00:01:07,617 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 00:01:07,617 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 00:01:07,617 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 00:01:07,618 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 00:01:07,618 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 00:01:07,618 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 00:01:07,619 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 00:01:07,619 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 00:01:07,619 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 00:01:07,619 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 00:01:07,619 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 00:01:07,620 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 00:01:07,620 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 00:01:07,620 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 00:01:07,620 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 00:01:07,620 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 00:01:07,620 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 00:01:07,620 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 00:01:07,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 00:01:07,621 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 00:01:07,621 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 00:01:07,621 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 00:01:07,621 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 00:01:07,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 00:01:07,621 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-14 00:01:07,622 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-14 00:01:07,622 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 00:01:07,622 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 -> 5c13092b5fe0ffbf7fbf1fe31d493be6a68ca2455b811b10fd7983ff470e432f [2022-07-14 00:01:07,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 00:01:07,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 00:01:07,836 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 00:01:07,837 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 00:01:07,839 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 00:01:07,839 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--touchscreen--usbtouchscreen.ko-entry_point.cil.out.i [2022-07-14 00:01:07,902 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a455be2dc/f9cb9552990e477e866d89fe9bb1d972/FLAG95aa215cd [2022-07-14 00:01:08,459 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 00:01:08,459 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--touchscreen--usbtouchscreen.ko-entry_point.cil.out.i [2022-07-14 00:01:08,488 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a455be2dc/f9cb9552990e477e866d89fe9bb1d972/FLAG95aa215cd [2022-07-14 00:01:08,916 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a455be2dc/f9cb9552990e477e866d89fe9bb1d972 [2022-07-14 00:01:08,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 00:01:08,919 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 00:01:08,922 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 00:01:08,922 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 00:01:08,924 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 00:01:08,925 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:01:08" (1/1) ... [2022-07-14 00:01:08,926 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@707f6654 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:01:08, skipping insertion in model container [2022-07-14 00:01:08,926 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:01:08" (1/1) ... [2022-07-14 00:01:08,930 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 00:01:08,997 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 00:01:09,432 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.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--touchscreen--usbtouchscreen.ko-entry_point.cil.out.i[108030,108043] [2022-07-14 00:01:09,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 00:01:09,844 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 00:01:09,913 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.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--touchscreen--usbtouchscreen.ko-entry_point.cil.out.i[108030,108043] [2022-07-14 00:01:10,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 00:01:10,160 INFO L208 MainTranslator]: Completed translation [2022-07-14 00:01:10,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:01:10 WrapperNode [2022-07-14 00:01:10,162 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 00:01:10,163 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 00:01:10,163 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 00:01:10,164 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 00:01:10,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:01:10" (1/1) ... [2022-07-14 00:01:10,237 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:01:10" (1/1) ... [2022-07-14 00:01:10,384 INFO L137 Inliner]: procedures = 178, calls = 1868, calls flagged for inlining = 81, calls inlined = 81, statements flattened = 3566 [2022-07-14 00:01:10,385 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 00:01:10,386 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 00:01:10,386 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 00:01:10,386 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 00:01:10,392 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:01:10" (1/1) ... [2022-07-14 00:01:10,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:01:10" (1/1) ... [2022-07-14 00:01:10,422 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:01:10" (1/1) ... [2022-07-14 00:01:10,423 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:01:10" (1/1) ... [2022-07-14 00:01:10,502 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:01:10" (1/1) ... [2022-07-14 00:01:10,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:01:10" (1/1) ... [2022-07-14 00:01:10,571 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:01:10" (1/1) ... [2022-07-14 00:01:10,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 00:01:10,605 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 00:01:10,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 00:01:10,606 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 00:01:10,606 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:01:10" (1/1) ... [2022-07-14 00:01:10,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 00:01:10,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:01:10,633 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-14 00:01:10,651 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-14 00:01:10,661 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~int [2022-07-14 00:01:10,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~int [2022-07-14 00:01:10,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-14 00:01:10,662 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_3 [2022-07-14 00:01:10,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_3 [2022-07-14 00:01:10,662 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_8 [2022-07-14 00:01:10,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_8 [2022-07-14 00:01:10,662 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_5 [2022-07-14 00:01:10,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_5 [2022-07-14 00:01:10,663 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_6 [2022-07-14 00:01:10,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_6 [2022-07-14 00:01:10,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-14 00:01:10,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-14 00:01:10,663 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2022-07-14 00:01:10,663 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2022-07-14 00:01:10,663 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-14 00:01:10,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-14 00:01:10,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 00:01:10,664 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_20 [2022-07-14 00:01:10,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_20 [2022-07-14 00:01:10,664 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2022-07-14 00:01:10,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2022-07-14 00:01:10,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-14 00:01:10,665 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-14 00:01:10,665 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-14 00:01:10,665 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-14 00:01:10,665 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-14 00:01:10,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-14 00:01:10,665 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2022-07-14 00:01:10,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2022-07-14 00:01:10,665 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-14 00:01:10,666 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-14 00:01:10,666 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~VOID [2022-07-14 00:01:10,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~VOID [2022-07-14 00:01:10,666 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-14 00:01:10,666 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-14 00:01:10,666 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_resume [2022-07-14 00:01:10,666 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_resume [2022-07-14 00:01:10,666 INFO L130 BoogieDeclarations]: Found specification of procedure kstrdup [2022-07-14 00:01:10,667 INFO L138 BoogieDeclarations]: Found implementation of procedure kstrdup [2022-07-14 00:01:10,667 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2022-07-14 00:01:10,667 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2022-07-14 00:01:10,667 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_reset_resume [2022-07-14 00:01:10,667 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_reset_resume [2022-07-14 00:01:10,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 00:01:10,667 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-14 00:01:10,668 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-14 00:01:10,668 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-14 00:01:10,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-14 00:01:10,668 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2022-07-14 00:01:10,668 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2022-07-14 00:01:10,669 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-14 00:01:10,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-14 00:01:10,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-14 00:01:10,669 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-14 00:01:10,670 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-14 00:01:10,670 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-14 00:01:10,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 00:01:10,670 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2022-07-14 00:01:10,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2022-07-14 00:01:10,671 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_free_buffers [2022-07-14 00:01:10,671 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_free_buffers [2022-07-14 00:01:10,671 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_disconnect [2022-07-14 00:01:10,671 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_disconnect [2022-07-14 00:01:10,672 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_22 [2022-07-14 00:01:10,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_22 [2022-07-14 00:01:10,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 00:01:10,672 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-14 00:01:10,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-14 00:01:10,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 00:01:10,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 00:01:10,673 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2022-07-14 00:01:10,673 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2022-07-14 00:01:10,673 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-07-14 00:01:10,673 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-07-14 00:01:10,673 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-14 00:01:10,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-14 00:01:10,674 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-14 00:01:10,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-14 00:01:10,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 00:01:10,674 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2022-07-14 00:01:10,674 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2022-07-14 00:01:10,674 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_14 [2022-07-14 00:01:10,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_14 [2022-07-14 00:01:10,674 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_16 [2022-07-14 00:01:10,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_16 [2022-07-14 00:01:10,675 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_get_interface [2022-07-14 00:01:10,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_get_interface [2022-07-14 00:01:10,675 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_probe [2022-07-14 00:01:10,675 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_probe [2022-07-14 00:01:10,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 00:01:10,676 INFO L130 BoogieDeclarations]: Found specification of procedure input_get_drvdata [2022-07-14 00:01:10,676 INFO L138 BoogieDeclarations]: Found implementation of procedure input_get_drvdata [2022-07-14 00:01:10,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 00:01:10,676 INFO L130 BoogieDeclarations]: Found specification of procedure input_unregister_device [2022-07-14 00:01:10,677 INFO L138 BoogieDeclarations]: Found implementation of procedure input_unregister_device [2022-07-14 00:01:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_open [2022-07-14 00:01:10,677 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_open [2022-07-14 00:01:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_12 [2022-07-14 00:01:10,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_12 [2022-07-14 00:01:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-14 00:01:10,678 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-14 00:01:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-14 00:01:10,678 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-14 00:01:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-07-14 00:01:10,678 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-07-14 00:01:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_irq [2022-07-14 00:01:10,679 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_irq [2022-07-14 00:01:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-14 00:01:10,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-14 00:01:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_process_pkt [2022-07-14 00:01:10,679 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_process_pkt [2022-07-14 00:01:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2022-07-14 00:01:10,680 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2022-07-14 00:01:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_put_interface [2022-07-14 00:01:10,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_put_interface [2022-07-14 00:01:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2022-07-14 00:01:10,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2022-07-14 00:01:10,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 00:01:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure nexio_read_data [2022-07-14 00:01:10,683 INFO L138 BoogieDeclarations]: Found implementation of procedure nexio_read_data [2022-07-14 00:01:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2022-07-14 00:01:10,683 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2022-07-14 00:01:10,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-14 00:01:10,685 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-14 00:01:10,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-14 00:01:10,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 00:01:10,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 00:01:10,689 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_abs [2022-07-14 00:01:10,690 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_abs [2022-07-14 00:01:10,690 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_process_multi [2022-07-14 00:01:10,690 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_process_multi [2022-07-14 00:01:11,177 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 00:01:11,180 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 00:01:11,405 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-14 00:01:13,234 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2022-07-14 00:01:13,760 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 00:01:13,778 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 00:01:13,778 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-14 00:01:13,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:01:13 BoogieIcfgContainer [2022-07-14 00:01:13,781 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 00:01:13,783 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 00:01:13,783 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 00:01:13,786 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 00:01:13,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 12:01:08" (1/3) ... [2022-07-14 00:01:13,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ffa8888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:01:13, skipping insertion in model container [2022-07-14 00:01:13,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:01:10" (2/3) ... [2022-07-14 00:01:13,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ffa8888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:01:13, skipping insertion in model container [2022-07-14 00:01:13,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:01:13" (3/3) ... [2022-07-14 00:01:13,788 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--input--touchscreen--usbtouchscreen.ko-entry_point.cil.out.i [2022-07-14 00:01:13,798 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 00:01:13,798 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-14 00:01:13,857 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 00:01:13,862 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@301a9380, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3fe85070 [2022-07-14 00:01:13,863 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-14 00:01:13,868 INFO L276 IsEmpty]: Start isEmpty. Operand has 969 states, 704 states have (on average 1.359375) internal successors, (957), 723 states have internal predecessors, (957), 207 states have call successors, (207), 58 states have call predecessors, (207), 56 states have return successors, (201), 199 states have call predecessors, (201), 201 states have call successors, (201) [2022-07-14 00:01:13,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-14 00:01:13,875 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:01:13,875 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:01:13,876 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:01:13,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:01:13,879 INFO L85 PathProgramCache]: Analyzing trace with hash -84985716, now seen corresponding path program 1 times [2022-07-14 00:01:13,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:01:13,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484056491] [2022-07-14 00:01:13,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:01:13,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:01:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:14,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:01:14,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:14,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 00:01:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:14,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 00:01:14,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:01:14,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484056491] [2022-07-14 00:01:14,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484056491] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:01:14,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:01:14,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 00:01:14,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766246672] [2022-07-14 00:01:14,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:01:14,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:01:14,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:01:14,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:01:14,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:01:14,382 INFO L87 Difference]: Start difference. First operand has 969 states, 704 states have (on average 1.359375) internal successors, (957), 723 states have internal predecessors, (957), 207 states have call successors, (207), 58 states have call predecessors, (207), 56 states have return successors, (201), 199 states have call predecessors, (201), 201 states have call successors, (201) Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 00:01:21,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:01:21,683 INFO L93 Difference]: Finished difference Result 3568 states and 5311 transitions. [2022-07-14 00:01:21,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 00:01:21,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-07-14 00:01:21,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:01:21,733 INFO L225 Difference]: With dead ends: 3568 [2022-07-14 00:01:21,733 INFO L226 Difference]: Without dead ends: 2580 [2022-07-14 00:01:21,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:01:21,754 INFO L413 NwaCegarLoop]: 1556 mSDtfsCounter, 3111 mSDsluCounter, 2179 mSDsCounter, 0 mSdLazyCounter, 2298 mSolverCounterSat, 1585 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3295 SdHoareTripleChecker+Valid, 3735 SdHoareTripleChecker+Invalid, 3883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1585 IncrementalHoareTripleChecker+Valid, 2298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-07-14 00:01:21,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3295 Valid, 3735 Invalid, 3883 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1585 Valid, 2298 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2022-07-14 00:01:21,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2580 states. [2022-07-14 00:01:21,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2580 to 1879. [2022-07-14 00:01:21,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1879 states, 1375 states have (on average 1.3447272727272728) internal successors, (1849), 1392 states have internal predecessors, (1849), 393 states have call successors, (393), 111 states have call predecessors, (393), 110 states have return successors, (387), 383 states have call predecessors, (387), 387 states have call successors, (387) [2022-07-14 00:01:21,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 2629 transitions. [2022-07-14 00:01:21,943 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 2629 transitions. Word has length 28 [2022-07-14 00:01:21,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:01:21,944 INFO L495 AbstractCegarLoop]: Abstraction has 1879 states and 2629 transitions. [2022-07-14 00:01:21,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 00:01:21,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 2629 transitions. [2022-07-14 00:01:21,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-14 00:01:21,952 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:01:21,952 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:01:21,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 00:01:21,953 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:01:21,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:01:21,954 INFO L85 PathProgramCache]: Analyzing trace with hash 818955978, now seen corresponding path program 1 times [2022-07-14 00:01:21,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:01:21,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144287871] [2022-07-14 00:01:21,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:01:21,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:01:22,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:22,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:01:22,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:22,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 00:01:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:22,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 00:01:22,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:22,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 00:01:22,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:01:22,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144287871] [2022-07-14 00:01:22,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144287871] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:01:22,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:01:22,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 00:01:22,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204272370] [2022-07-14 00:01:22,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:01:22,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:01:22,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:01:22,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:01:22,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:01:22,213 INFO L87 Difference]: Start difference. First operand 1879 states and 2629 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 00:01:26,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:01:26,536 INFO L93 Difference]: Finished difference Result 2603 states and 3754 transitions. [2022-07-14 00:01:26,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 00:01:26,537 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2022-07-14 00:01:26,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:01:26,551 INFO L225 Difference]: With dead ends: 2603 [2022-07-14 00:01:26,552 INFO L226 Difference]: Without dead ends: 2590 [2022-07-14 00:01:26,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:01:26,558 INFO L413 NwaCegarLoop]: 1214 mSDtfsCounter, 2244 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 1001 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2371 SdHoareTripleChecker+Valid, 2256 SdHoareTripleChecker+Invalid, 2095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1001 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-07-14 00:01:26,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2371 Valid, 2256 Invalid, 2095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1001 Valid, 1094 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-07-14 00:01:26,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2590 states. [2022-07-14 00:01:26,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2590 to 1879. [2022-07-14 00:01:26,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1879 states, 1375 states have (on average 1.344) internal successors, (1848), 1392 states have internal predecessors, (1848), 393 states have call successors, (393), 111 states have call predecessors, (393), 110 states have return successors, (387), 383 states have call predecessors, (387), 387 states have call successors, (387) [2022-07-14 00:01:26,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 2628 transitions. [2022-07-14 00:01:26,640 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 2628 transitions. Word has length 38 [2022-07-14 00:01:26,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:01:26,641 INFO L495 AbstractCegarLoop]: Abstraction has 1879 states and 2628 transitions. [2022-07-14 00:01:26,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 00:01:26,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 2628 transitions. [2022-07-14 00:01:26,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-14 00:01:26,644 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:01:26,645 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:01:26,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 00:01:26,645 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:01:26,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:01:26,646 INFO L85 PathProgramCache]: Analyzing trace with hash 876214280, now seen corresponding path program 1 times [2022-07-14 00:01:26,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:01:26,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73302389] [2022-07-14 00:01:26,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:01:26,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:01:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:26,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:01:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:26,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 00:01:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:26,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 00:01:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:26,929 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 00:01:26,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:01:26,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73302389] [2022-07-14 00:01:26,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73302389] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:01:26,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:01:26,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 00:01:26,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24345550] [2022-07-14 00:01:26,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:01:26,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:01:26,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:01:26,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:01:26,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:01:26,932 INFO L87 Difference]: Start difference. First operand 1879 states and 2628 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 00:01:34,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:01:34,516 INFO L93 Difference]: Finished difference Result 7002 states and 10466 transitions. [2022-07-14 00:01:34,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 00:01:34,516 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2022-07-14 00:01:34,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:01:34,552 INFO L225 Difference]: With dead ends: 7002 [2022-07-14 00:01:34,552 INFO L226 Difference]: Without dead ends: 5137 [2022-07-14 00:01:34,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:01:34,566 INFO L413 NwaCegarLoop]: 1487 mSDtfsCounter, 3239 mSDsluCounter, 2163 mSDsCounter, 0 mSdLazyCounter, 2327 mSolverCounterSat, 1638 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3399 SdHoareTripleChecker+Valid, 3650 SdHoareTripleChecker+Invalid, 3965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1638 IncrementalHoareTripleChecker+Valid, 2327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-07-14 00:01:34,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3399 Valid, 3650 Invalid, 3965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1638 Valid, 2327 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2022-07-14 00:01:34,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5137 states. [2022-07-14 00:01:34,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5137 to 4286. [2022-07-14 00:01:34,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4286 states, 3139 states have (on average 1.3284485504937877) internal successors, (4170), 3172 states have internal predecessors, (4170), 851 states have call successors, (851), 220 states have call predecessors, (851), 295 states have return successors, (1211), 909 states have call predecessors, (1211), 845 states have call successors, (1211) [2022-07-14 00:01:34,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4286 states to 4286 states and 6232 transitions. [2022-07-14 00:01:34,788 INFO L78 Accepts]: Start accepts. Automaton has 4286 states and 6232 transitions. Word has length 38 [2022-07-14 00:01:34,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:01:34,789 INFO L495 AbstractCegarLoop]: Abstraction has 4286 states and 6232 transitions. [2022-07-14 00:01:34,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 00:01:34,790 INFO L276 IsEmpty]: Start isEmpty. Operand 4286 states and 6232 transitions. [2022-07-14 00:01:34,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-14 00:01:34,792 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:01:34,793 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:01:34,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 00:01:34,793 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:01:34,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:01:34,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1392341914, now seen corresponding path program 1 times [2022-07-14 00:01:34,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:01:34,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122653779] [2022-07-14 00:01:34,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:01:34,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:01:34,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:34,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:01:34,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:34,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 00:01:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:34,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 00:01:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:34,987 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 00:01:34,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:01:34,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122653779] [2022-07-14 00:01:34,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122653779] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:01:34,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:01:34,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 00:01:34,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326576647] [2022-07-14 00:01:34,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:01:34,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:01:34,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:01:34,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:01:34,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:01:34,989 INFO L87 Difference]: Start difference. First operand 4286 states and 6232 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 00:01:37,473 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:01:40,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:01:40,624 INFO L93 Difference]: Finished difference Result 5128 states and 7662 transitions. [2022-07-14 00:01:40,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 00:01:40,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2022-07-14 00:01:40,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:01:40,652 INFO L225 Difference]: With dead ends: 5128 [2022-07-14 00:01:40,652 INFO L226 Difference]: Without dead ends: 5125 [2022-07-14 00:01:40,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:01:40,656 INFO L413 NwaCegarLoop]: 1185 mSDtfsCounter, 2264 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 1061 mSolverCounterSat, 1024 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2392 SdHoareTripleChecker+Valid, 2155 SdHoareTripleChecker+Invalid, 2085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1024 IncrementalHoareTripleChecker+Valid, 1061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-07-14 00:01:40,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2392 Valid, 2155 Invalid, 2085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1024 Valid, 1061 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-07-14 00:01:40,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5125 states. [2022-07-14 00:01:40,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5125 to 4285. [2022-07-14 00:01:40,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4285 states, 3139 states have (on average 1.3281299776999045) internal successors, (4169), 3171 states have internal predecessors, (4169), 850 states have call successors, (850), 220 states have call predecessors, (850), 295 states have return successors, (1211), 909 states have call predecessors, (1211), 845 states have call successors, (1211) [2022-07-14 00:01:40,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4285 states to 4285 states and 6230 transitions. [2022-07-14 00:01:40,834 INFO L78 Accepts]: Start accepts. Automaton has 4285 states and 6230 transitions. Word has length 39 [2022-07-14 00:01:40,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:01:40,834 INFO L495 AbstractCegarLoop]: Abstraction has 4285 states and 6230 transitions. [2022-07-14 00:01:40,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 00:01:40,835 INFO L276 IsEmpty]: Start isEmpty. Operand 4285 states and 6230 transitions. [2022-07-14 00:01:40,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-14 00:01:40,836 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:01:40,836 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:01:40,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 00:01:40,836 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:01:40,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:01:40,837 INFO L85 PathProgramCache]: Analyzing trace with hash 212434251, now seen corresponding path program 1 times [2022-07-14 00:01:40,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:01:40,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657900862] [2022-07-14 00:01:40,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:01:40,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:01:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:40,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:01:40,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:40,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 00:01:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:40,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 00:01:40,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:40,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 00:01:40,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:01:40,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657900862] [2022-07-14 00:01:40,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657900862] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:01:40,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:01:40,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 00:01:40,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515910741] [2022-07-14 00:01:40,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:01:40,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:01:40,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:01:40,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:01:40,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:01:40,999 INFO L87 Difference]: Start difference. First operand 4285 states and 6230 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 00:01:45,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:01:45,744 INFO L93 Difference]: Finished difference Result 5127 states and 7660 transitions. [2022-07-14 00:01:45,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 00:01:45,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-07-14 00:01:45,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:01:45,781 INFO L225 Difference]: With dead ends: 5127 [2022-07-14 00:01:45,781 INFO L226 Difference]: Without dead ends: 5124 [2022-07-14 00:01:45,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:01:45,786 INFO L413 NwaCegarLoop]: 1188 mSDtfsCounter, 2251 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 1018 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2376 SdHoareTripleChecker+Valid, 2161 SdHoareTripleChecker+Invalid, 2084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1018 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-07-14 00:01:45,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2376 Valid, 2161 Invalid, 2084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1018 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-07-14 00:01:45,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5124 states. [2022-07-14 00:01:45,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5124 to 4284. [2022-07-14 00:01:45,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4284 states, 3139 states have (on average 1.327811404906021) internal successors, (4168), 3170 states have internal predecessors, (4168), 849 states have call successors, (849), 220 states have call predecessors, (849), 295 states have return successors, (1211), 909 states have call predecessors, (1211), 845 states have call successors, (1211) [2022-07-14 00:01:45,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4284 states to 4284 states and 6228 transitions. [2022-07-14 00:01:45,981 INFO L78 Accepts]: Start accepts. Automaton has 4284 states and 6228 transitions. Word has length 40 [2022-07-14 00:01:45,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:01:45,981 INFO L495 AbstractCegarLoop]: Abstraction has 4284 states and 6228 transitions. [2022-07-14 00:01:45,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 00:01:45,983 INFO L276 IsEmpty]: Start isEmpty. Operand 4284 states and 6228 transitions. [2022-07-14 00:01:45,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-14 00:01:45,984 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:01:45,984 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:01:45,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 00:01:45,985 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:01:45,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:01:45,985 INFO L85 PathProgramCache]: Analyzing trace with hash -2004960067, now seen corresponding path program 1 times [2022-07-14 00:01:45,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:01:45,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270811659] [2022-07-14 00:01:45,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:01:45,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:01:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:46,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:01:46,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:46,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 00:01:46,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:46,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 00:01:46,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:46,198 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 00:01:46,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:01:46,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270811659] [2022-07-14 00:01:46,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270811659] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:01:46,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:01:46,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 00:01:46,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205553499] [2022-07-14 00:01:46,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:01:46,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:01:46,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:01:46,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:01:46,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:01:46,203 INFO L87 Difference]: Start difference. First operand 4284 states and 6228 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 00:01:52,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:01:52,231 INFO L93 Difference]: Finished difference Result 14467 states and 22170 transitions. [2022-07-14 00:01:52,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 00:01:52,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2022-07-14 00:01:52,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:01:52,282 INFO L225 Difference]: With dead ends: 14467 [2022-07-14 00:01:52,283 INFO L226 Difference]: Without dead ends: 10197 [2022-07-14 00:01:52,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:01:52,308 INFO L413 NwaCegarLoop]: 1422 mSDtfsCounter, 3195 mSDsluCounter, 2181 mSDsCounter, 0 mSdLazyCounter, 2190 mSolverCounterSat, 1629 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3356 SdHoareTripleChecker+Valid, 3603 SdHoareTripleChecker+Invalid, 3819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1629 IncrementalHoareTripleChecker+Valid, 2190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-07-14 00:01:52,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3356 Valid, 3603 Invalid, 3819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1629 Valid, 2190 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-07-14 00:01:52,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10197 states. [2022-07-14 00:01:52,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10197 to 8775. [2022-07-14 00:01:52,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8775 states, 6431 states have (on average 1.3276317835484372) internal successors, (8538), 6491 states have internal predecessors, (8538), 1726 states have call successors, (1726), 435 states have call predecessors, (1726), 617 states have return successors, (2913), 1880 states have call predecessors, (2913), 1719 states have call successors, (2913) [2022-07-14 00:01:52,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8775 states to 8775 states and 13177 transitions. [2022-07-14 00:01:52,702 INFO L78 Accepts]: Start accepts. Automaton has 8775 states and 13177 transitions. Word has length 41 [2022-07-14 00:01:52,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:01:52,702 INFO L495 AbstractCegarLoop]: Abstraction has 8775 states and 13177 transitions. [2022-07-14 00:01:52,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 00:01:52,702 INFO L276 IsEmpty]: Start isEmpty. Operand 8775 states and 13177 transitions. [2022-07-14 00:01:52,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-14 00:01:52,703 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:01:52,704 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:01:52,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 00:01:52,704 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:01:52,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:01:52,704 INFO L85 PathProgramCache]: Analyzing trace with hash -2024702322, now seen corresponding path program 1 times [2022-07-14 00:01:52,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:01:52,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812981310] [2022-07-14 00:01:52,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:01:52,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:01:52,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:52,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:01:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:52,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 00:01:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:52,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 00:01:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:52,833 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 00:01:52,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:01:52,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812981310] [2022-07-14 00:01:52,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812981310] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:01:52,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:01:52,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 00:01:52,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996985609] [2022-07-14 00:01:52,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:01:52,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:01:52,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:01:52,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:01:52,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:01:52,835 INFO L87 Difference]: Start difference. First operand 8775 states and 13177 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 00:01:57,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:01:57,302 INFO L93 Difference]: Finished difference Result 10165 states and 15561 transitions. [2022-07-14 00:01:57,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 00:01:57,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2022-07-14 00:01:57,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:01:57,352 INFO L225 Difference]: With dead ends: 10165 [2022-07-14 00:01:57,352 INFO L226 Difference]: Without dead ends: 10153 [2022-07-14 00:01:57,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:01:57,363 INFO L413 NwaCegarLoop]: 1214 mSDtfsCounter, 2197 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 1001 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2322 SdHoareTripleChecker+Valid, 2230 SdHoareTripleChecker+Invalid, 2087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1001 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-07-14 00:01:57,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2322 Valid, 2230 Invalid, 2087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1001 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-07-14 00:01:57,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10153 states. [2022-07-14 00:01:57,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10153 to 8765. [2022-07-14 00:01:57,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8765 states, 6422 states have (on average 1.3274680784802242) internal successors, (8525), 6481 states have internal predecessors, (8525), 1725 states have call successors, (1725), 435 states have call predecessors, (1725), 617 states have return successors, (2913), 1880 states have call predecessors, (2913), 1719 states have call successors, (2913) [2022-07-14 00:01:57,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8765 states to 8765 states and 13163 transitions. [2022-07-14 00:01:57,828 INFO L78 Accepts]: Start accepts. Automaton has 8765 states and 13163 transitions. Word has length 42 [2022-07-14 00:01:57,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:01:57,828 INFO L495 AbstractCegarLoop]: Abstraction has 8765 states and 13163 transitions. [2022-07-14 00:01:57,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 00:01:57,829 INFO L276 IsEmpty]: Start isEmpty. Operand 8765 states and 13163 transitions. [2022-07-14 00:01:57,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-14 00:01:57,834 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:01:57,834 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:01:57,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 00:01:57,835 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:01:57,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:01:57,835 INFO L85 PathProgramCache]: Analyzing trace with hash -8229079, now seen corresponding path program 1 times [2022-07-14 00:01:57,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:01:57,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962416149] [2022-07-14 00:01:57,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:01:57,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:01:57,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:57,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:01:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:57,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 00:01:57,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:57,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 00:01:57,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:57,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 00:01:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:58,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-14 00:01:58,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:58,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 00:01:58,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:58,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:01:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:58,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 00:01:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:58,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:01:58,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:58,045 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 00:01:58,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:01:58,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962416149] [2022-07-14 00:01:58,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962416149] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:01:58,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:01:58,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 00:01:58,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692490821] [2022-07-14 00:01:58,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:01:58,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 00:01:58,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:01:58,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 00:01:58,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:01:58,049 INFO L87 Difference]: Start difference. First operand 8765 states and 13163 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-14 00:02:05,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:02:05,028 INFO L93 Difference]: Finished difference Result 21687 states and 33736 transitions. [2022-07-14 00:02:05,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 00:02:05,029 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 88 [2022-07-14 00:02:05,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:02:05,098 INFO L225 Difference]: With dead ends: 21687 [2022-07-14 00:02:05,098 INFO L226 Difference]: Without dead ends: 12936 [2022-07-14 00:02:05,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-07-14 00:02:05,139 INFO L413 NwaCegarLoop]: 1243 mSDtfsCounter, 2757 mSDsluCounter, 2808 mSDsCounter, 0 mSdLazyCounter, 2476 mSolverCounterSat, 1880 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2879 SdHoareTripleChecker+Valid, 4051 SdHoareTripleChecker+Invalid, 4356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1880 IncrementalHoareTripleChecker+Valid, 2476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-07-14 00:02:05,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2879 Valid, 4051 Invalid, 4356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1880 Valid, 2476 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-07-14 00:02:05,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12936 states. [2022-07-14 00:02:05,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12936 to 10735. [2022-07-14 00:02:05,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10735 states, 7852 states have (on average 1.3136780438104942) internal successors, (10315), 7905 states have internal predecessors, (10315), 2063 states have call successors, (2063), 437 states have call predecessors, (2063), 819 states have return successors, (4329), 2428 states have call predecessors, (4329), 2057 states have call successors, (4329) [2022-07-14 00:02:05,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10735 states to 10735 states and 16707 transitions. [2022-07-14 00:02:05,705 INFO L78 Accepts]: Start accepts. Automaton has 10735 states and 16707 transitions. Word has length 88 [2022-07-14 00:02:05,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:02:05,706 INFO L495 AbstractCegarLoop]: Abstraction has 10735 states and 16707 transitions. [2022-07-14 00:02:05,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-14 00:02:05,706 INFO L276 IsEmpty]: Start isEmpty. Operand 10735 states and 16707 transitions. [2022-07-14 00:02:05,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-14 00:02:05,714 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:02:05,714 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-14 00:02:05,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 00:02:05,715 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:02:05,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:02:05,715 INFO L85 PathProgramCache]: Analyzing trace with hash 810961881, now seen corresponding path program 1 times [2022-07-14 00:02:05,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:02:05,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508752436] [2022-07-14 00:02:05,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:02:05,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:02:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:05,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:02:05,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:05,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 00:02:05,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:05,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 00:02:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:05,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 00:02:05,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:05,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-14 00:02:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:05,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 00:02:05,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:05,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 00:02:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:05,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:02:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:05,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:02:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:05,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-14 00:02:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:05,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:02:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:05,944 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-14 00:02:05,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:02:05,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508752436] [2022-07-14 00:02:05,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508752436] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:02:05,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:02:05,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 00:02:05,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532522018] [2022-07-14 00:02:05,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:02:05,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 00:02:05,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:02:05,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 00:02:05,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:02:05,947 INFO L87 Difference]: Start difference. First operand 10735 states and 16707 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-14 00:02:18,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:02:18,539 INFO L93 Difference]: Finished difference Result 36184 states and 57105 transitions. [2022-07-14 00:02:18,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-14 00:02:18,539 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 112 [2022-07-14 00:02:18,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:02:18,666 INFO L225 Difference]: With dead ends: 36184 [2022-07-14 00:02:18,667 INFO L226 Difference]: Without dead ends: 25471 [2022-07-14 00:02:18,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2022-07-14 00:02:18,713 INFO L413 NwaCegarLoop]: 2165 mSDtfsCounter, 4328 mSDsluCounter, 4195 mSDsCounter, 0 mSdLazyCounter, 4071 mSolverCounterSat, 3504 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4503 SdHoareTripleChecker+Valid, 6360 SdHoareTripleChecker+Invalid, 7575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3504 IncrementalHoareTripleChecker+Valid, 4071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2022-07-14 00:02:18,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4503 Valid, 6360 Invalid, 7575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3504 Valid, 4071 Invalid, 0 Unknown, 0 Unchecked, 11.4s Time] [2022-07-14 00:02:18,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25471 states. [2022-07-14 00:02:19,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25471 to 21097. [2022-07-14 00:02:19,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21097 states, 15412 states have (on average 1.3101479366727224) internal successors, (20192), 15515 states have internal predecessors, (20192), 4053 states have call successors, (4053), 865 states have call predecessors, (4053), 1631 states have return successors, (8423), 4788 states have call predecessors, (8423), 4047 states have call successors, (8423) [2022-07-14 00:02:19,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21097 states to 21097 states and 32668 transitions. [2022-07-14 00:02:19,876 INFO L78 Accepts]: Start accepts. Automaton has 21097 states and 32668 transitions. Word has length 112 [2022-07-14 00:02:19,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:02:19,876 INFO L495 AbstractCegarLoop]: Abstraction has 21097 states and 32668 transitions. [2022-07-14 00:02:19,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-14 00:02:19,877 INFO L276 IsEmpty]: Start isEmpty. Operand 21097 states and 32668 transitions. [2022-07-14 00:02:19,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-14 00:02:19,887 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:02:19,887 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:02:19,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 00:02:19,888 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:02:19,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:02:19,889 INFO L85 PathProgramCache]: Analyzing trace with hash -379928007, now seen corresponding path program 1 times [2022-07-14 00:02:19,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:02:19,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159841369] [2022-07-14 00:02:19,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:02:19,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:02:19,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:20,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:02:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:20,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 00:02:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:20,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 00:02:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:20,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 00:02:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:20,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:02:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:20,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:02:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:20,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-14 00:02:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:20,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-14 00:02:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:20,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-14 00:02:20,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:20,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 00:02:20,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:20,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:02:20,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:20,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:02:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:20,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-14 00:02:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:20,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:02:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:20,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 00:02:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:20,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:02:20,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:20,167 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-14 00:02:20,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:02:20,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159841369] [2022-07-14 00:02:20,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159841369] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:02:20,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:02:20,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 00:02:20,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809133095] [2022-07-14 00:02:20,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:02:20,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 00:02:20,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:02:20,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 00:02:20,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:02:20,170 INFO L87 Difference]: Start difference. First operand 21097 states and 32668 transitions. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (22), 7 states have call predecessors, (22), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-14 00:02:34,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:02:34,897 INFO L93 Difference]: Finished difference Result 61683 states and 97245 transitions. [2022-07-14 00:02:34,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-14 00:02:34,898 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (22), 7 states have call predecessors, (22), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 153 [2022-07-14 00:02:34,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:02:35,118 INFO L225 Difference]: With dead ends: 61683 [2022-07-14 00:02:35,119 INFO L226 Difference]: Without dead ends: 40608 [2022-07-14 00:02:35,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2022-07-14 00:02:35,208 INFO L413 NwaCegarLoop]: 2266 mSDtfsCounter, 4377 mSDsluCounter, 4376 mSDsCounter, 0 mSdLazyCounter, 4585 mSolverCounterSat, 3276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4593 SdHoareTripleChecker+Valid, 6642 SdHoareTripleChecker+Invalid, 7861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3276 IncrementalHoareTripleChecker+Valid, 4585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2022-07-14 00:02:35,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4593 Valid, 6642 Invalid, 7861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3276 Valid, 4585 Invalid, 0 Unknown, 0 Unchecked, 12.6s Time] [2022-07-14 00:02:35,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40608 states. [2022-07-14 00:02:36,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40608 to 31579. [2022-07-14 00:02:36,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31579 states, 23056 states have (on average 1.3092036780013878) internal successors, (30185), 23221 states have internal predecessors, (30185), 6055 states have call successors, (6055), 1293 states have call predecessors, (6055), 2467 states have return successors, (12553), 7172 states have call predecessors, (12553), 6049 states have call successors, (12553) [2022-07-14 00:02:37,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31579 states to 31579 states and 48793 transitions. [2022-07-14 00:02:37,252 INFO L78 Accepts]: Start accepts. Automaton has 31579 states and 48793 transitions. Word has length 153 [2022-07-14 00:02:37,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:02:37,253 INFO L495 AbstractCegarLoop]: Abstraction has 31579 states and 48793 transitions. [2022-07-14 00:02:37,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (22), 7 states have call predecessors, (22), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-14 00:02:37,254 INFO L276 IsEmpty]: Start isEmpty. Operand 31579 states and 48793 transitions. [2022-07-14 00:02:37,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-14 00:02:37,262 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:02:37,262 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:02:37,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 00:02:37,263 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:02:37,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:02:37,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1913868486, now seen corresponding path program 1 times [2022-07-14 00:02:37,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:02:37,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130774018] [2022-07-14 00:02:37,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:02:37,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:02:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:37,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:02:37,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:37,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 00:02:37,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:37,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 00:02:37,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:37,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 00:02:37,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:37,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:02:37,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:37,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:02:37,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:37,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 00:02:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:37,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-14 00:02:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:37,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-14 00:02:37,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:37,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-14 00:02:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:37,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-14 00:02:37,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:37,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-14 00:02:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:37,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:02:37,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:37,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-14 00:02:37,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:37,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:02:37,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:37,616 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-14 00:02:37,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:02:37,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130774018] [2022-07-14 00:02:37,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130774018] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:02:37,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:02:37,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-14 00:02:37,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077442080] [2022-07-14 00:02:37,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:02:37,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 00:02:37,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:02:37,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 00:02:37,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-14 00:02:37,620 INFO L87 Difference]: Start difference. First operand 31579 states and 48793 transitions. Second operand has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (19), 9 states have call predecessors, (19), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-14 00:03:13,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:03:13,146 INFO L93 Difference]: Finished difference Result 115438 states and 201604 transitions. [2022-07-14 00:03:13,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-07-14 00:03:13,147 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (19), 9 states have call predecessors, (19), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 139 [2022-07-14 00:03:13,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:03:13,618 INFO L225 Difference]: With dead ends: 115438 [2022-07-14 00:03:13,619 INFO L226 Difference]: Without dead ends: 83881 [2022-07-14 00:03:13,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=443, Invalid=1537, Unknown=0, NotChecked=0, Total=1980 [2022-07-14 00:03:13,751 INFO L413 NwaCegarLoop]: 2422 mSDtfsCounter, 7366 mSDsluCounter, 12567 mSDsCounter, 0 mSdLazyCounter, 16486 mSolverCounterSat, 7404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7577 SdHoareTripleChecker+Valid, 14989 SdHoareTripleChecker+Invalid, 23890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 7404 IncrementalHoareTripleChecker+Valid, 16486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.0s IncrementalHoareTripleChecker+Time [2022-07-14 00:03:13,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7577 Valid, 14989 Invalid, 23890 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [7404 Valid, 16486 Invalid, 0 Unknown, 0 Unchecked, 30.0s Time] [2022-07-14 00:03:13,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83881 states. [2022-07-14 00:03:16,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83881 to 34437. [2022-07-14 00:03:16,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34437 states, 24964 states have (on average 1.3055199487261657) internal successors, (32591), 25039 states have internal predecessors, (32591), 6865 states have call successors, (6865), 1293 states have call predecessors, (6865), 2607 states have return successors, (14493), 8224 states have call predecessors, (14493), 6859 states have call successors, (14493) [2022-07-14 00:03:17,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34437 states to 34437 states and 53949 transitions. [2022-07-14 00:03:17,081 INFO L78 Accepts]: Start accepts. Automaton has 34437 states and 53949 transitions. Word has length 139 [2022-07-14 00:03:17,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:03:17,081 INFO L495 AbstractCegarLoop]: Abstraction has 34437 states and 53949 transitions. [2022-07-14 00:03:17,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (19), 9 states have call predecessors, (19), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-14 00:03:17,082 INFO L276 IsEmpty]: Start isEmpty. Operand 34437 states and 53949 transitions. [2022-07-14 00:03:17,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-07-14 00:03:17,089 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:03:17,089 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:03:17,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 00:03:17,089 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:03:17,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:03:17,090 INFO L85 PathProgramCache]: Analyzing trace with hash -100167631, now seen corresponding path program 1 times [2022-07-14 00:03:17,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:03:17,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458028189] [2022-07-14 00:03:17,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:03:17,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:03:17,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:03:17,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:03:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:03:17,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 00:03:17,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:03:17,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 00:03:17,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:03:17,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 00:03:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:03:17,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:03:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:03:17,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:03:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:03:17,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 00:03:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:03:17,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-14 00:03:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:03:17,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-14 00:03:17,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:03:17,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-14 00:03:17,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:03:17,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-14 00:03:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:03:17,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 00:03:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:03:17,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:03:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:03:17,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-14 00:03:17,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:03:17,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:03:17,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:03:17,404 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-14 00:03:17,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:03:17,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458028189] [2022-07-14 00:03:17,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458028189] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:03:17,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:03:17,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-14 00:03:17,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398956951] [2022-07-14 00:03:17,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:03:17,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 00:03:17,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:03:17,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 00:03:17,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-14 00:03:17,406 INFO L87 Difference]: Start difference. First operand 34437 states and 53949 transitions. Second operand has 12 states, 12 states have (on average 8.5) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (19), 9 states have call predecessors, (19), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-14 00:03:47,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:03:47,372 INFO L93 Difference]: Finished difference Result 118352 states and 206832 transitions. [2022-07-14 00:03:47,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-07-14 00:03:47,389 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.5) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (19), 9 states have call predecessors, (19), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 143 [2022-07-14 00:03:47,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:03:47,966 INFO L225 Difference]: With dead ends: 118352 [2022-07-14 00:03:47,966 INFO L226 Difference]: Without dead ends: 83937 [2022-07-14 00:03:48,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=443, Invalid=1537, Unknown=0, NotChecked=0, Total=1980 [2022-07-14 00:03:48,344 INFO L413 NwaCegarLoop]: 2419 mSDtfsCounter, 7928 mSDsluCounter, 10749 mSDsCounter, 0 mSdLazyCounter, 13323 mSolverCounterSat, 8389 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8134 SdHoareTripleChecker+Valid, 13168 SdHoareTripleChecker+Invalid, 21712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 8389 IncrementalHoareTripleChecker+Valid, 13323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.2s IncrementalHoareTripleChecker+Time [2022-07-14 00:03:48,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8134 Valid, 13168 Invalid, 21712 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [8389 Valid, 13323 Invalid, 0 Unknown, 0 Unchecked, 23.2s Time] [2022-07-14 00:03:48,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83937 states. [2022-07-14 00:03:51,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83937 to 34437. [2022-07-14 00:03:51,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34437 states, 24964 states have (on average 1.3055199487261657) internal successors, (32591), 25039 states have internal predecessors, (32591), 6865 states have call successors, (6865), 1293 states have call predecessors, (6865), 2607 states have return successors, (14493), 8224 states have call predecessors, (14493), 6859 states have call successors, (14493) [2022-07-14 00:03:51,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34437 states to 34437 states and 53949 transitions. [2022-07-14 00:03:51,630 INFO L78 Accepts]: Start accepts. Automaton has 34437 states and 53949 transitions. Word has length 143 [2022-07-14 00:03:51,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:03:51,630 INFO L495 AbstractCegarLoop]: Abstraction has 34437 states and 53949 transitions. [2022-07-14 00:03:51,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.5) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (19), 9 states have call predecessors, (19), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-14 00:03:51,631 INFO L276 IsEmpty]: Start isEmpty. Operand 34437 states and 53949 transitions. [2022-07-14 00:03:51,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-14 00:03:51,636 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:03:51,636 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:03:51,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 00:03:51,636 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:03:51,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:03:51,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1956184300, now seen corresponding path program 1 times [2022-07-14 00:03:51,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:03:51,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918758335] [2022-07-14 00:03:51,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:03:51,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:03:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:03:51,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:03:51,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:03:51,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 00:03:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:03:51,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 00:03:51,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:03:52,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 00:03:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:03:52,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:03:52,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:03:52,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:03:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:03:52,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:03:52,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:03:52,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:03:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:03:52,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:03:52,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:03:52,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 00:03:52,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:03:52,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:03:52,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:03:52,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:03:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:03:52,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 00:03:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:03:52,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-14 00:03:52,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:03:52,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:03:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:03:52,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 00:03:52,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:03:52,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-14 00:03:52,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:03:52,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 00:03:52,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:03:52,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:03:52,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:03:52,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-14 00:03:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:03:52,158 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-14 00:03:52,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:03:52,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918758335] [2022-07-14 00:03:52,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918758335] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:03:52,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531118433] [2022-07-14 00:03:52,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:03:52,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:03:52,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:03:52,161 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-14 00:03:52,164 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-14 00:03:52,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:03:52,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 3514 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 00:03:52,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:03:53,046 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-14 00:03:53,046 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:03:53,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531118433] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:03:53,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 00:03:53,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-07-14 00:03:53,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783308903] [2022-07-14 00:03:53,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:03:53,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 00:03:53,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:03:53,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 00:03:53,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-07-14 00:03:53,049 INFO L87 Difference]: Start difference. First operand 34437 states and 53949 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-14 00:03:56,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:03:56,296 INFO L93 Difference]: Finished difference Result 81119 states and 127134 transitions. [2022-07-14 00:03:56,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 00:03:56,296 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 169 [2022-07-14 00:03:56,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:03:56,657 INFO L225 Difference]: With dead ends: 81119 [2022-07-14 00:03:56,657 INFO L226 Difference]: Without dead ends: 46704 [2022-07-14 00:03:56,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-07-14 00:03:56,773 INFO L413 NwaCegarLoop]: 2585 mSDtfsCounter, 1347 mSDsluCounter, 8864 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1364 SdHoareTripleChecker+Valid, 11449 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 00:03:56,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1364 Valid, 11449 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 00:03:56,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46704 states. [2022-07-14 00:03:59,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46704 to 34505. [2022-07-14 00:03:59,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34505 states, 25004 states have (on average 1.3050311950087985) internal successors, (32631), 25083 states have internal predecessors, (32631), 6889 states have call successors, (6889), 1293 states have call predecessors, (6889), 2611 states have return successors, (14533), 8248 states have call predecessors, (14533), 6883 states have call successors, (14533) [2022-07-14 00:03:59,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34505 states to 34505 states and 54053 transitions. [2022-07-14 00:03:59,514 INFO L78 Accepts]: Start accepts. Automaton has 34505 states and 54053 transitions. Word has length 169 [2022-07-14 00:03:59,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:03:59,515 INFO L495 AbstractCegarLoop]: Abstraction has 34505 states and 54053 transitions. [2022-07-14 00:03:59,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-14 00:03:59,515 INFO L276 IsEmpty]: Start isEmpty. Operand 34505 states and 54053 transitions. [2022-07-14 00:03:59,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-14 00:03:59,517 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:03:59,517 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:03:59,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-14 00:03:59,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-14 00:03:59,731 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:03:59,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:03:59,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1327665746, now seen corresponding path program 1 times [2022-07-14 00:03:59,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:03:59,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629263506] [2022-07-14 00:03:59,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:03:59,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:03:59,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:03:59,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:03:59,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:03:59,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 00:03:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:03:59,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 00:03:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:03:59,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 00:03:59,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:00,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:04:00,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:00,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:04:00,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:00,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:04:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:00,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:04:00,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:00,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:04:00,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:00,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 00:04:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:00,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:04:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:00,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:04:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:00,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 00:04:00,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:00,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-14 00:04:00,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:00,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:04:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:00,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 00:04:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:00,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-14 00:04:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:00,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 00:04:00,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:00,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:04:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:00,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-14 00:04:00,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:00,364 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-07-14 00:04:00,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:04:00,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629263506] [2022-07-14 00:04:00,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629263506] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:04:00,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162706784] [2022-07-14 00:04:00,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:04:00,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:04:00,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:04:00,366 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:04:00,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-14 00:04:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:01,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 3509 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-14 00:04:01,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:04:01,237 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-14 00:04:01,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:04:01,736 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-14 00:04:01,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162706784] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 00:04:01,736 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 00:04:01,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 27 [2022-07-14 00:04:01,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736730520] [2022-07-14 00:04:01,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 00:04:01,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-14 00:04:01,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:04:01,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-14 00:04:01,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2022-07-14 00:04:01,738 INFO L87 Difference]: Start difference. First operand 34505 states and 54053 transitions. Second operand has 27 states, 27 states have (on average 6.222222222222222) internal successors, (168), 14 states have internal predecessors, (168), 4 states have call successors, (44), 8 states have call predecessors, (44), 9 states have return successors, (36), 11 states have call predecessors, (36), 4 states have call successors, (36) [2022-07-14 00:04:11,502 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:04:25,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:04:25,684 INFO L93 Difference]: Finished difference Result 82976 states and 142537 transitions. [2022-07-14 00:04:25,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-14 00:04:25,685 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 6.222222222222222) internal successors, (168), 14 states have internal predecessors, (168), 4 states have call successors, (44), 8 states have call predecessors, (44), 9 states have return successors, (36), 11 states have call predecessors, (36), 4 states have call successors, (36) Word has length 169 [2022-07-14 00:04:25,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:04:25,879 INFO L225 Difference]: With dead ends: 82976 [2022-07-14 00:04:25,879 INFO L226 Difference]: Without dead ends: 48445 [2022-07-14 00:04:26,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=195, Invalid=1287, Unknown=0, NotChecked=0, Total=1482 [2022-07-14 00:04:26,030 INFO L413 NwaCegarLoop]: 1155 mSDtfsCounter, 1783 mSDsluCounter, 13129 mSDsCounter, 0 mSdLazyCounter, 9105 mSolverCounterSat, 1216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1894 SdHoareTripleChecker+Valid, 14284 SdHoareTripleChecker+Invalid, 10321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1216 IncrementalHoareTripleChecker+Valid, 9105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.2s IncrementalHoareTripleChecker+Time [2022-07-14 00:04:26,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1894 Valid, 14284 Invalid, 10321 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1216 Valid, 9105 Invalid, 0 Unknown, 0 Unchecked, 19.2s Time] [2022-07-14 00:04:26,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48445 states. [2022-07-14 00:04:28,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48445 to 34841. [2022-07-14 00:04:28,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34841 states, 25244 states have (on average 1.3021311994929488) internal successors, (32871), 25323 states have internal predecessors, (32871), 6913 states have call successors, (6913), 1293 states have call predecessors, (6913), 2683 states have return successors, (14917), 8344 states have call predecessors, (14917), 6907 states have call successors, (14917) [2022-07-14 00:04:28,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34841 states to 34841 states and 54701 transitions. [2022-07-14 00:04:28,718 INFO L78 Accepts]: Start accepts. Automaton has 34841 states and 54701 transitions. Word has length 169 [2022-07-14 00:04:28,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:04:28,719 INFO L495 AbstractCegarLoop]: Abstraction has 34841 states and 54701 transitions. [2022-07-14 00:04:28,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 6.222222222222222) internal successors, (168), 14 states have internal predecessors, (168), 4 states have call successors, (44), 8 states have call predecessors, (44), 9 states have return successors, (36), 11 states have call predecessors, (36), 4 states have call successors, (36) [2022-07-14 00:04:28,719 INFO L276 IsEmpty]: Start isEmpty. Operand 34841 states and 54701 transitions. [2022-07-14 00:04:28,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-07-14 00:04:28,722 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:04:28,722 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:04:28,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-14 00:04:28,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-14 00:04:28,944 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:04:28,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:04:28,944 INFO L85 PathProgramCache]: Analyzing trace with hash -975854030, now seen corresponding path program 1 times [2022-07-14 00:04:28,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:04:28,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074958393] [2022-07-14 00:04:28,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:04:28,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:04:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:29,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:04:29,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:29,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 00:04:29,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:29,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 00:04:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:29,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 00:04:29,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:29,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:04:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:29,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:04:29,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:29,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:04:29,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:29,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:04:29,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:29,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:04:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:29,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:04:29,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:29,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:04:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:29,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-14 00:04:29,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:29,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:04:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:29,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:04:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:29,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 00:04:29,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:29,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 00:04:29,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:29,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:04:29,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:29,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 00:04:29,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:29,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-14 00:04:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:29,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-14 00:04:29,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:29,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:04:29,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:29,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 00:04:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:29,366 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-14 00:04:29,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:04:29,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074958393] [2022-07-14 00:04:29,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074958393] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:04:29,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:04:29,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 00:04:29,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513268333] [2022-07-14 00:04:29,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:04:29,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 00:04:29,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:04:29,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 00:04:29,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-14 00:04:29,369 INFO L87 Difference]: Start difference. First operand 34841 states and 54701 transitions. Second operand has 10 states, 10 states have (on average 10.8) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (20), 8 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-14 00:04:39,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:04:39,906 INFO L93 Difference]: Finished difference Result 83216 states and 142469 transitions. [2022-07-14 00:04:39,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 00:04:39,907 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (20), 8 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 181 [2022-07-14 00:04:39,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:04:40,154 INFO L225 Difference]: With dead ends: 83216 [2022-07-14 00:04:40,155 INFO L226 Difference]: Without dead ends: 48397 [2022-07-14 00:04:40,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-14 00:04:40,332 INFO L413 NwaCegarLoop]: 1173 mSDtfsCounter, 1787 mSDsluCounter, 3647 mSDsCounter, 0 mSdLazyCounter, 2803 mSolverCounterSat, 1202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1896 SdHoareTripleChecker+Valid, 4820 SdHoareTripleChecker+Invalid, 4005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1202 IncrementalHoareTripleChecker+Valid, 2803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-07-14 00:04:40,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1896 Valid, 4820 Invalid, 4005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1202 Valid, 2803 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2022-07-14 00:04:40,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48397 states. [2022-07-14 00:04:42,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48397 to 34889. [2022-07-14 00:04:42,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34889 states, 25292 states have (on average 1.301557804839475) internal successors, (32919), 25371 states have internal predecessors, (32919), 6913 states have call successors, (6913), 1293 states have call predecessors, (6913), 2683 states have return successors, (14917), 8344 states have call predecessors, (14917), 6907 states have call successors, (14917) [2022-07-14 00:04:43,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34889 states to 34889 states and 54749 transitions. [2022-07-14 00:04:43,009 INFO L78 Accepts]: Start accepts. Automaton has 34889 states and 54749 transitions. Word has length 181 [2022-07-14 00:04:43,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:04:43,010 INFO L495 AbstractCegarLoop]: Abstraction has 34889 states and 54749 transitions. [2022-07-14 00:04:43,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (20), 8 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-14 00:04:43,010 INFO L276 IsEmpty]: Start isEmpty. Operand 34889 states and 54749 transitions. [2022-07-14 00:04:43,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-07-14 00:04:43,012 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:04:43,012 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 00:04:43,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 00:04:43,013 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:04:43,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:04:43,013 INFO L85 PathProgramCache]: Analyzing trace with hash -219059742, now seen corresponding path program 1 times [2022-07-14 00:04:43,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:04:43,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146515874] [2022-07-14 00:04:43,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:04:43,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:04:43,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:43,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:04:43,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:43,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 00:04:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:43,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 00:04:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:43,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 00:04:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:43,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:04:43,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:43,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:04:43,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:43,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:04:43,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:43,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 00:04:43,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:43,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 00:04:43,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:43,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:04:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:43,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:04:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:43,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:04:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:43,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:04:43,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:43,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:04:43,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:43,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:04:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:43,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:04:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:43,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-14 00:04:43,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:43,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-14 00:04:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:43,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:04:43,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:43,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 00:04:43,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:43,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-14 00:04:43,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:43,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-14 00:04:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:43,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:04:43,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:43,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-14 00:04:43,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:43,433 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-07-14 00:04:43,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:04:43,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146515874] [2022-07-14 00:04:43,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146515874] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:04:43,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:04:43,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-14 00:04:43,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143962330] [2022-07-14 00:04:43,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:04:43,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 00:04:43,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:04:43,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 00:04:43,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-07-14 00:04:43,435 INFO L87 Difference]: Start difference. First operand 34889 states and 54749 transitions. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 4 states have internal predecessors, (115), 3 states have call successors, (21), 8 states have call predecessors, (21), 3 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2022-07-14 00:04:55,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:04:55,364 INFO L93 Difference]: Finished difference Result 83252 states and 139593 transitions. [2022-07-14 00:04:55,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 00:04:55,365 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 4 states have internal predecessors, (115), 3 states have call successors, (21), 8 states have call predecessors, (21), 3 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) Word has length 194 [2022-07-14 00:04:55,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:04:55,591 INFO L225 Difference]: With dead ends: 83252 [2022-07-14 00:04:55,591 INFO L226 Difference]: Without dead ends: 48385 [2022-07-14 00:04:55,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2022-07-14 00:04:55,752 INFO L413 NwaCegarLoop]: 1160 mSDtfsCounter, 1254 mSDsluCounter, 4634 mSDsCounter, 0 mSdLazyCounter, 3470 mSolverCounterSat, 787 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1362 SdHoareTripleChecker+Valid, 5794 SdHoareTripleChecker+Invalid, 4257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 787 IncrementalHoareTripleChecker+Valid, 3470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-07-14 00:04:55,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1362 Valid, 5794 Invalid, 4257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [787 Valid, 3470 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2022-07-14 00:04:55,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48385 states. [2022-07-14 00:04:58,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48385 to 35009. [2022-07-14 00:04:58,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35009 states, 25388 states have (on average 1.301362848589885) internal successors, (33039), 25443 states have internal predecessors, (33039), 6937 states have call successors, (6937), 1293 states have call predecessors, (6937), 2683 states have return successors, (14941), 8392 states have call predecessors, (14941), 6931 states have call successors, (14941) [2022-07-14 00:04:58,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35009 states to 35009 states and 54917 transitions. [2022-07-14 00:04:58,669 INFO L78 Accepts]: Start accepts. Automaton has 35009 states and 54917 transitions. Word has length 194 [2022-07-14 00:04:58,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:04:58,669 INFO L495 AbstractCegarLoop]: Abstraction has 35009 states and 54917 transitions. [2022-07-14 00:04:58,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 4 states have internal predecessors, (115), 3 states have call successors, (21), 8 states have call predecessors, (21), 3 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2022-07-14 00:04:58,669 INFO L276 IsEmpty]: Start isEmpty. Operand 35009 states and 54917 transitions. [2022-07-14 00:04:58,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-07-14 00:04:58,672 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:04:58,672 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:04:58,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 00:04:58,673 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:04:58,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:04:58,673 INFO L85 PathProgramCache]: Analyzing trace with hash -218637337, now seen corresponding path program 2 times [2022-07-14 00:04:58,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:04:58,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711748132] [2022-07-14 00:04:58,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:04:58,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:04:58,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:58,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:04:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:58,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 00:04:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:58,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 00:04:58,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:58,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 00:04:58,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:58,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:04:58,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:58,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:04:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:58,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:04:58,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:58,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 00:04:58,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:58,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 00:04:58,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:58,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:04:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:58,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:04:58,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:58,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:04:58,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:58,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:04:58,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:58,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:04:58,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:59,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:04:59,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:59,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:04:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:59,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-14 00:04:59,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:59,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-14 00:04:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:59,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:04:59,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:59,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:04:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:59,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 00:04:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:59,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-14 00:04:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:59,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-14 00:04:59,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:59,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:04:59,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:59,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 00:04:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:04:59,081 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-07-14 00:04:59,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:04:59,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711748132] [2022-07-14 00:04:59,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711748132] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:04:59,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902453130] [2022-07-14 00:04:59,082 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 00:04:59,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:04:59,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:04:59,083 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:04:59,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-14 00:04:59,879 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 00:04:59,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 00:04:59,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 3637 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-14 00:04:59,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:04:59,961 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-07-14 00:04:59,961 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:04:59,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902453130] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:04:59,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 00:04:59,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 12 [2022-07-14 00:04:59,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833337697] [2022-07-14 00:04:59,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:04:59,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 00:04:59,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:04:59,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 00:04:59,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-14 00:04:59,963 INFO L87 Difference]: Start difference. First operand 35009 states and 54917 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-14 00:05:02,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:05:02,464 INFO L93 Difference]: Finished difference Result 70212 states and 117386 transitions. [2022-07-14 00:05:02,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 00:05:02,465 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) Word has length 200 [2022-07-14 00:05:02,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:05:02,638 INFO L225 Difference]: With dead ends: 70212 [2022-07-14 00:05:02,638 INFO L226 Difference]: Without dead ends: 35225 [2022-07-14 00:05:02,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 244 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-07-14 00:05:02,807 INFO L413 NwaCegarLoop]: 1333 mSDtfsCounter, 5 mSDsluCounter, 5317 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 6650 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 00:05:02,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 6650 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 00:05:02,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35225 states. [2022-07-14 00:05:05,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35225 to 35081. [2022-07-14 00:05:05,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35081 states, 25460 states have (on average 1.300510604870385) internal successors, (33111), 25491 states have internal predecessors, (33111), 6937 states have call successors, (6937), 1293 states have call predecessors, (6937), 2683 states have return successors, (14941), 8416 states have call predecessors, (14941), 6931 states have call successors, (14941) [2022-07-14 00:05:05,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35081 states to 35081 states and 54989 transitions. [2022-07-14 00:05:05,366 INFO L78 Accepts]: Start accepts. Automaton has 35081 states and 54989 transitions. Word has length 200 [2022-07-14 00:05:05,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:05:05,366 INFO L495 AbstractCegarLoop]: Abstraction has 35081 states and 54989 transitions. [2022-07-14 00:05:05,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-14 00:05:05,366 INFO L276 IsEmpty]: Start isEmpty. Operand 35081 states and 54989 transitions. [2022-07-14 00:05:05,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-07-14 00:05:05,368 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:05:05,368 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:05:05,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-14 00:05:05,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:05:05,569 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:05:05,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:05:05,569 INFO L85 PathProgramCache]: Analyzing trace with hash -827671151, now seen corresponding path program 3 times [2022-07-14 00:05:05,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:05:05,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521439922] [2022-07-14 00:05:05,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:05:05,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:05:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:05,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:05:05,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:05,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 00:05:05,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:05,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 00:05:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:05,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 00:05:05,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:05,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:05:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:05,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:05:05,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:05,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:05:05,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:05,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 00:05:05,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:05,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 00:05:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:05,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:05:05,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:05,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:05:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:05,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:05:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:05,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:05:05,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:05,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:05:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:06,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:05:06,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:06,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-14 00:05:06,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:06,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:05:06,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:06,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-14 00:05:06,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:06,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:05:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:06,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:05:06,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:06,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 00:05:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:06,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-14 00:05:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:06,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-14 00:05:06,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:06,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:05:06,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:06,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 00:05:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:06,114 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-07-14 00:05:06,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:05:06,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521439922] [2022-07-14 00:05:06,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521439922] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:05:06,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914732497] [2022-07-14 00:05:06,115 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 00:05:06,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:05:06,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:05:06,116 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:05:06,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-14 00:05:06,895 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-14 00:05:06,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 00:05:06,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 3106 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 00:05:06,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:05:06,963 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-14 00:05:06,964 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:05:06,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914732497] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:05:06,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 00:05:06,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [17] total 19 [2022-07-14 00:05:06,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99400738] [2022-07-14 00:05:06,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:05:06,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 00:05:06,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:05:06,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 00:05:06,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2022-07-14 00:05:06,966 INFO L87 Difference]: Start difference. First operand 35081 states and 54989 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20)