./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-media-dvb-ttusb-dec-ttusb_dec.ko.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.0/usb_urb-drivers-media-dvb-ttusb-dec-ttusb_dec.ko.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 2c6aa6e54aa03d80dc4005d195dc80cde5e772aed59b94df03248a4abb3fc0ec --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 23:01:46,594 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 23:01:46,597 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 23:01:46,624 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 23:01:46,624 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 23:01:46,626 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 23:01:46,627 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 23:01:46,628 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 23:01:46,629 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 23:01:46,630 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 23:01:46,631 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 23:01:46,632 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 23:01:46,632 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 23:01:46,633 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 23:01:46,634 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 23:01:46,635 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 23:01:46,635 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 23:01:46,636 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 23:01:46,638 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 23:01:46,639 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 23:01:46,640 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 23:01:46,641 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 23:01:46,642 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 23:01:46,643 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 23:01:46,644 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 23:01:46,647 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 23:01:46,647 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 23:01:46,647 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 23:01:46,648 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 23:01:46,648 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 23:01:46,649 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 23:01:46,649 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 23:01:46,650 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 23:01:46,651 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 23:01:46,651 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 23:01:46,652 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 23:01:46,653 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 23:01:46,653 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 23:01:46,653 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 23:01:46,654 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 23:01:46,654 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 23:01:46,655 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 23:01:46,656 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-13 23:01:46,683 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 23:01:46,686 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 23:01:46,687 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 23:01:46,688 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 23:01:46,688 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 23:01:46,688 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 23:01:46,689 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 23:01:46,689 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 23:01:46,689 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 23:01:46,690 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 23:01:46,690 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 23:01:46,691 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 23:01:46,691 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 23:01:46,691 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 23:01:46,691 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 23:01:46,691 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 23:01:46,691 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 23:01:46,692 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 23:01:46,692 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 23:01:46,693 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 23:01:46,693 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 23:01:46,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 23:01:46,694 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 23:01:46,694 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 23:01:46,694 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 23:01:46,694 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 23:01:46,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 23:01:46,695 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 23:01:46,695 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 23:01:46,695 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 23:01:46,695 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 -> 2c6aa6e54aa03d80dc4005d195dc80cde5e772aed59b94df03248a4abb3fc0ec [2022-07-13 23:01:46,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 23:01:46,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 23:01:46,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 23:01:46,923 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 23:01:46,924 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 23:01:46,925 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-media-dvb-ttusb-dec-ttusb_dec.ko.cil.out.i [2022-07-13 23:01:46,994 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84b29707e/183d96a07837429db6cb97e1770f02bd/FLAG01aeb2631 [2022-07-13 23:01:47,714 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 23:01:47,715 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-media-dvb-ttusb-dec-ttusb_dec.ko.cil.out.i [2022-07-13 23:01:47,754 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84b29707e/183d96a07837429db6cb97e1770f02bd/FLAG01aeb2631 [2022-07-13 23:01:47,948 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84b29707e/183d96a07837429db6cb97e1770f02bd [2022-07-13 23:01:47,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 23:01:47,951 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 23:01:47,954 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 23:01:47,955 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 23:01:47,957 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 23:01:47,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:01:47" (1/1) ... [2022-07-13 23:01:47,959 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@173c3a54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:01:47, skipping insertion in model container [2022-07-13 23:01:47,959 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:01:47" (1/1) ... [2022-07-13 23:01:47,964 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 23:01:48,040 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 23:01:49,417 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.0/usb_urb-drivers-media-dvb-ttusb-dec-ttusb_dec.ko.cil.out.i[284671,284684] [2022-07-13 23:01:49,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 23:01:49,517 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 23:01:49,762 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.0/usb_urb-drivers-media-dvb-ttusb-dec-ttusb_dec.ko.cil.out.i[284671,284684] [2022-07-13 23:01:49,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 23:01:49,857 INFO L208 MainTranslator]: Completed translation [2022-07-13 23:01:49,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:01:49 WrapperNode [2022-07-13 23:01:49,858 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 23:01:49,859 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 23:01:49,860 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 23:01:49,860 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 23:01:49,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:01:49" (1/1) ... [2022-07-13 23:01:49,928 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:01:49" (1/1) ... [2022-07-13 23:01:50,045 INFO L137 Inliner]: procedures = 177, calls = 1597, calls flagged for inlining = 87, calls inlined = 82, statements flattened = 3772 [2022-07-13 23:01:50,046 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 23:01:50,048 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 23:01:50,048 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 23:01:50,048 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 23:01:50,054 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:01:49" (1/1) ... [2022-07-13 23:01:50,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:01:49" (1/1) ... [2022-07-13 23:01:50,068 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:01:49" (1/1) ... [2022-07-13 23:01:50,069 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:01:49" (1/1) ... [2022-07-13 23:01:50,141 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:01:49" (1/1) ... [2022-07-13 23:01:50,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:01:49" (1/1) ... [2022-07-13 23:01:50,195 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:01:49" (1/1) ... [2022-07-13 23:01:50,221 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 23:01:50,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 23:01:50,224 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 23:01:50,224 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 23:01:50,225 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:01:49" (1/1) ... [2022-07-13 23:01:50,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 23:01:50,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:01:50,252 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-13 23:01:50,278 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-13 23:01:50,294 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2022-07-13 23:01:50,295 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2022-07-13 23:01:50,295 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2022-07-13 23:01:50,295 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2022-07-13 23:01:50,295 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-13 23:01:50,295 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-13 23:01:50,296 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_free_iso_urbs [2022-07-13 23:01:50,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_free_iso_urbs [2022-07-13 23:01:50,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-13 23:01:50,296 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2022-07-13 23:01:50,296 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2022-07-13 23:01:50,296 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~X~$Pointer$~X~int~TO~int [2022-07-13 23:01:50,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~X~$Pointer$~X~int~TO~int [2022-07-13 23:01:50,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-13 23:01:50,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-13 23:01:50,297 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2022-07-13 23:01:50,297 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2022-07-13 23:01:50,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 23:01:50,297 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_init_dvb [2022-07-13 23:01:50,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_init_dvb [2022-07-13 23:01:50,298 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_interface [2022-07-13 23:01:50,298 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_interface [2022-07-13 23:01:50,298 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_unregister_adapter [2022-07-13 23:01:50,298 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_unregister_adapter [2022-07-13 23:01:50,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-13 23:01:50,298 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-13 23:01:50,299 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-13 23:01:50,299 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-13 23:01:50,299 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-13 23:01:50,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-13 23:01:50,299 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-13 23:01:50,299 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-13 23:01:50,300 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_interruptible_nested [2022-07-13 23:01:50,300 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_interruptible_nested [2022-07-13 23:01:50,300 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-13 23:01:50,300 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-13 23:01:50,300 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_start_iso_xfer [2022-07-13 23:01:50,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_start_iso_xfer [2022-07-13 23:01:50,300 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2022-07-13 23:01:50,301 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2022-07-13 23:01:50,301 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_send_command [2022-07-13 23:01:50,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_send_command [2022-07-13 23:01:50,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 23:01:50,301 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-13 23:01:50,302 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-13 23:01:50,302 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_setup_urbs [2022-07-13 23:01:50,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_setup_urbs [2022-07-13 23:01:50,302 INFO L130 BoogieDeclarations]: Found specification of procedure input_sync [2022-07-13 23:01:50,302 INFO L138 BoogieDeclarations]: Found implementation of procedure input_sync [2022-07-13 23:01:50,303 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2022-07-13 23:01:50,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2022-07-13 23:01:50,303 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_set_pids [2022-07-13 23:01:50,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_set_pids [2022-07-13 23:01:50,304 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_exit [2022-07-13 23:01:50,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_exit [2022-07-13 23:01:50,304 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_exit_usb [2022-07-13 23:01:50,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_exit_usb [2022-07-13 23:01:50,305 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_dmx_release [2022-07-13 23:01:50,305 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_dmx_release [2022-07-13 23:01:50,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 23:01:50,306 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-13 23:01:50,306 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-13 23:01:50,306 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_init [2022-07-13 23:01:50,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_init [2022-07-13 23:01:50,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 23:01:50,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 23:01:50,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 23:01:50,307 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2022-07-13 23:01:50,307 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2022-07-13 23:01:50,307 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-07-13 23:01:50,308 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-07-13 23:01:50,308 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-13 23:01:50,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-13 23:01:50,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 23:01:50,309 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-07-13 23:01:50,309 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-07-13 23:01:50,309 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-13 23:01:50,309 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-13 23:01:50,309 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-07-13 23:01:50,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-07-13 23:01:50,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 23:01:50,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 23:01:50,310 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_probe [2022-07-13 23:01:50,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_probe [2022-07-13 23:01:50,310 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2022-07-13 23:01:50,310 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2022-07-13 23:01:50,310 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_dmxdev_release [2022-07-13 23:01:50,311 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_dmxdev_release [2022-07-13 23:01:50,311 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2022-07-13 23:01:50,311 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2022-07-13 23:01:50,312 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-13 23:01:50,312 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-13 23:01:50,312 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-13 23:01:50,312 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-13 23:01:50,313 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-07-13 23:01:50,313 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-07-13 23:01:50,313 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_exit_dvb [2022-07-13 23:01:50,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_exit_dvb [2022-07-13 23:01:50,313 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2022-07-13 23:01:50,314 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2022-07-13 23:01:50,314 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-13 23:01:50,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-13 23:01:50,314 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_disconnect [2022-07-13 23:01:50,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_disconnect [2022-07-13 23:01:50,314 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-13 23:01:50,315 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-13 23:01:50,315 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2022-07-13 23:01:50,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2022-07-13 23:01:50,315 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_set_model [2022-07-13 23:01:50,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_set_model [2022-07-13 23:01:50,315 INFO L130 BoogieDeclarations]: Found specification of procedure release_firmware [2022-07-13 23:01:50,316 INFO L138 BoogieDeclarations]: Found implementation of procedure release_firmware [2022-07-13 23:01:50,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 23:01:50,316 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_key [2022-07-13 23:01:50,316 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_key [2022-07-13 23:01:50,316 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_stop_iso_xfer [2022-07-13 23:01:50,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_stop_iso_xfer [2022-07-13 23:01:50,317 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2022-07-13 23:01:50,318 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2022-07-13 23:01:50,320 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_filter_pes2ts_init [2022-07-13 23:01:50,320 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_filter_pes2ts_init [2022-07-13 23:01:50,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-13 23:01:50,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 23:01:50,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 23:01:50,915 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 23:01:50,918 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 23:01:51,113 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 23:01:51,205 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2022-07-13 23:01:51,206 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2022-07-13 23:01:51,444 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 23:01:52,306 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##239: assume false; [2022-07-13 23:01:52,306 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##240: assume !false; [2022-07-13 23:01:52,527 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2022-07-13 23:01:52,540 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 23:01:52,544 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 23:01:55,048 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##78: assume !false; [2022-07-13 23:01:55,048 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##77: assume false; [2022-07-13 23:01:55,048 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##39: assume !false; [2022-07-13 23:01:55,048 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume false; [2022-07-13 23:01:55,048 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L8653: ttusb_dec_start_feed_#res#1 := 0; [2022-07-13 23:01:55,344 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 23:01:56,028 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-07-13 23:01:56,029 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-07-13 23:01:56,067 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 23:01:56,081 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 23:01:56,081 INFO L299 CfgBuilder]: Removed 38 assume(true) statements. [2022-07-13 23:01:56,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:01:56 BoogieIcfgContainer [2022-07-13 23:01:56,084 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 23:01:56,085 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 23:01:56,085 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 23:01:56,088 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 23:01:56,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:01:47" (1/3) ... [2022-07-13 23:01:56,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354783e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:01:56, skipping insertion in model container [2022-07-13 23:01:56,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:01:49" (2/3) ... [2022-07-13 23:01:56,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354783e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:01:56, skipping insertion in model container [2022-07-13 23:01:56,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:01:56" (3/3) ... [2022-07-13 23:01:56,090 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-media-dvb-ttusb-dec-ttusb_dec.ko.cil.out.i [2022-07-13 23:01:56,102 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 23:01:56,103 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 23:01:56,160 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 23:01:56,165 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@1e9c4c81, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@70972599 [2022-07-13 23:01:56,166 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 23:01:56,173 INFO L276 IsEmpty]: Start isEmpty. Operand has 1017 states, 763 states have (on average 1.4233289646133682) internal successors, (1086), 787 states have internal predecessors, (1086), 199 states have call successors, (199), 54 states have call predecessors, (199), 53 states have return successors, (197), 191 states have call predecessors, (197), 197 states have call successors, (197) [2022-07-13 23:01:56,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 23:01:56,180 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:01:56,180 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:01:56,181 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:01:56,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:01:56,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1801714647, now seen corresponding path program 1 times [2022-07-13 23:01:56,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:01:56,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401958731] [2022-07-13 23:01:56,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:01:56,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:01:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:56,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:01:56,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:56,834 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-13 23:01:56,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:01:56,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401958731] [2022-07-13 23:01:56,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401958731] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:01:56,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:01:56,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 23:01:56,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740941684] [2022-07-13 23:01:56,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:01:56,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 23:01:56,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:01:56,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 23:01:56,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 23:01:56,881 INFO L87 Difference]: Start difference. First operand has 1017 states, 763 states have (on average 1.4233289646133682) internal successors, (1086), 787 states have internal predecessors, (1086), 199 states have call successors, (199), 54 states have call predecessors, (199), 53 states have return successors, (197), 191 states have call predecessors, (197), 197 states have call successors, (197) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 23:01:57,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:01:57,131 INFO L93 Difference]: Finished difference Result 3011 states and 4514 transitions. [2022-07-13 23:01:57,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 23:01:57,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-07-13 23:01:57,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:01:57,172 INFO L225 Difference]: With dead ends: 3011 [2022-07-13 23:01:57,172 INFO L226 Difference]: Without dead ends: 1992 [2022-07-13 23:01:57,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 23:01:57,190 INFO L413 NwaCegarLoop]: 1995 mSDtfsCounter, 1373 mSDsluCounter, 1373 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1373 SdHoareTripleChecker+Valid, 3368 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 23:01:57,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1373 Valid, 3368 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 23:01:57,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2022-07-13 23:01:57,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1988. [2022-07-13 23:01:57,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1988 states, 1495 states have (on average 1.3036789297658864) internal successors, (1949), 1523 states have internal predecessors, (1949), 389 states have call successors, (389), 104 states have call predecessors, (389), 103 states have return successors, (399), 373 states have call predecessors, (399), 385 states have call successors, (399) [2022-07-13 23:01:57,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1988 states to 1988 states and 2737 transitions. [2022-07-13 23:01:57,392 INFO L78 Accepts]: Start accepts. Automaton has 1988 states and 2737 transitions. Word has length 16 [2022-07-13 23:01:57,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:01:57,393 INFO L495 AbstractCegarLoop]: Abstraction has 1988 states and 2737 transitions. [2022-07-13 23:01:57,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 23:01:57,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1988 states and 2737 transitions. [2022-07-13 23:01:57,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 23:01:57,394 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:01:57,394 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:01:57,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 23:01:57,395 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:01:57,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:01:57,396 INFO L85 PathProgramCache]: Analyzing trace with hash -18956933, now seen corresponding path program 1 times [2022-07-13 23:01:57,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:01:57,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567774433] [2022-07-13 23:01:57,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:01:57,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:01:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:57,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:01:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:57,686 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-13 23:01:57,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:01:57,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567774433] [2022-07-13 23:01:57,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567774433] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:01:57,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:01:57,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 23:01:57,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569049461] [2022-07-13 23:01:57,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:01:57,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 23:01:57,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:01:57,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 23:01:57,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 23:01:57,694 INFO L87 Difference]: Start difference. First operand 1988 states and 2737 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 23:01:57,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:01:57,843 INFO L93 Difference]: Finished difference Result 5937 states and 8252 transitions. [2022-07-13 23:01:57,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 23:01:57,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-07-13 23:01:57,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:01:57,869 INFO L225 Difference]: With dead ends: 5937 [2022-07-13 23:01:57,870 INFO L226 Difference]: Without dead ends: 3953 [2022-07-13 23:01:57,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 23:01:57,884 INFO L413 NwaCegarLoop]: 1814 mSDtfsCounter, 1360 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1360 SdHoareTripleChecker+Valid, 3180 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 23:01:57,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1360 Valid, 3180 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 23:01:57,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3953 states. [2022-07-13 23:01:58,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3953 to 3946. [2022-07-13 23:01:58,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3946 states, 2969 states have (on average 1.3031323678006064) internal successors, (3869), 3020 states have internal predecessors, (3869), 772 states have call successors, (772), 205 states have call predecessors, (772), 204 states have return successors, (832), 744 states have call predecessors, (832), 768 states have call successors, (832) [2022-07-13 23:01:58,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3946 states to 3946 states and 5473 transitions. [2022-07-13 23:01:58,043 INFO L78 Accepts]: Start accepts. Automaton has 3946 states and 5473 transitions. Word has length 17 [2022-07-13 23:01:58,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:01:58,043 INFO L495 AbstractCegarLoop]: Abstraction has 3946 states and 5473 transitions. [2022-07-13 23:01:58,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 23:01:58,044 INFO L276 IsEmpty]: Start isEmpty. Operand 3946 states and 5473 transitions. [2022-07-13 23:01:58,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-13 23:01:58,048 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:01:58,053 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:01:58,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 23:01:58,054 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:01:58,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:01:58,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1768602684, now seen corresponding path program 1 times [2022-07-13 23:01:58,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:01:58,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222892421] [2022-07-13 23:01:58,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:01:58,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:01:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:58,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:01:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:58,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 23:01:58,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:58,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 23:01:58,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:58,406 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-13 23:01:58,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:01:58,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222892421] [2022-07-13 23:01:58,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222892421] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:01:58,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:01:58,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 23:01:58,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312522264] [2022-07-13 23:01:58,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:01:58,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 23:01:58,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:01:58,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 23:01:58,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 23:01:58,410 INFO L87 Difference]: Start difference. First operand 3946 states and 5473 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 23:02:00,829 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:02:04,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:04,142 INFO L93 Difference]: Finished difference Result 8818 states and 12470 transitions. [2022-07-13 23:02:04,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 23:02:04,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2022-07-13 23:02:04,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:04,171 INFO L225 Difference]: With dead ends: 8818 [2022-07-13 23:02:04,172 INFO L226 Difference]: Without dead ends: 4880 [2022-07-13 23:02:04,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 23:02:04,195 INFO L413 NwaCegarLoop]: 1470 mSDtfsCounter, 544 mSDsluCounter, 4034 mSDsCounter, 0 mSdLazyCounter, 1573 mSolverCounterSat, 246 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 5504 SdHoareTripleChecker+Invalid, 1820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 1573 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-07-13 23:02:04,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 5504 Invalid, 1820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 1573 Invalid, 1 Unknown, 0 Unchecked, 5.5s Time] [2022-07-13 23:02:04,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4880 states. [2022-07-13 23:02:04,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4880 to 4051. [2022-07-13 23:02:04,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4051 states, 3044 states have (on average 1.2992772667542707) internal successors, (3955), 3101 states have internal predecessors, (3955), 793 states have call successors, (793), 205 states have call predecessors, (793), 213 states have return successors, (892), 768 states have call predecessors, (892), 789 states have call successors, (892) [2022-07-13 23:02:04,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4051 states to 4051 states and 5640 transitions. [2022-07-13 23:02:04,418 INFO L78 Accepts]: Start accepts. Automaton has 4051 states and 5640 transitions. Word has length 60 [2022-07-13 23:02:04,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:04,418 INFO L495 AbstractCegarLoop]: Abstraction has 4051 states and 5640 transitions. [2022-07-13 23:02:04,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 23:02:04,419 INFO L276 IsEmpty]: Start isEmpty. Operand 4051 states and 5640 transitions. [2022-07-13 23:02:04,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-13 23:02:04,426 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:04,426 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:02:04,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 23:02:04,426 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:04,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:04,427 INFO L85 PathProgramCache]: Analyzing trace with hash -156930627, now seen corresponding path program 1 times [2022-07-13 23:02:04,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:04,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538258187] [2022-07-13 23:02:04,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:04,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:04,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:04,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:04,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 23:02:04,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:04,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 23:02:04,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:04,697 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-13 23:02:04,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:04,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538258187] [2022-07-13 23:02:04,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538258187] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:02:04,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:02:04,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 23:02:04,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022973241] [2022-07-13 23:02:04,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:04,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 23:02:04,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:04,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 23:02:04,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 23:02:04,700 INFO L87 Difference]: Start difference. First operand 4051 states and 5640 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 23:02:07,060 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:02:08,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:08,889 INFO L93 Difference]: Finished difference Result 8955 states and 12692 transitions. [2022-07-13 23:02:08,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 23:02:08,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2022-07-13 23:02:08,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:08,919 INFO L225 Difference]: With dead ends: 8955 [2022-07-13 23:02:08,919 INFO L226 Difference]: Without dead ends: 4915 [2022-07-13 23:02:08,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 23:02:08,945 INFO L413 NwaCegarLoop]: 1484 mSDtfsCounter, 554 mSDsluCounter, 1774 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 247 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 3258 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-13 23:02:08,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 3258 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 730 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2022-07-13 23:02:08,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4915 states. [2022-07-13 23:02:09,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4915 to 4086. [2022-07-13 23:02:09,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4086 states, 3079 states have (on average 1.299447872685937) internal successors, (4001), 3136 states have internal predecessors, (4001), 793 states have call successors, (793), 205 states have call predecessors, (793), 213 states have return successors, (892), 768 states have call predecessors, (892), 789 states have call successors, (892) [2022-07-13 23:02:09,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4086 states to 4086 states and 5686 transitions. [2022-07-13 23:02:09,110 INFO L78 Accepts]: Start accepts. Automaton has 4086 states and 5686 transitions. Word has length 60 [2022-07-13 23:02:09,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:09,111 INFO L495 AbstractCegarLoop]: Abstraction has 4086 states and 5686 transitions. [2022-07-13 23:02:09,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 23:02:09,112 INFO L276 IsEmpty]: Start isEmpty. Operand 4086 states and 5686 transitions. [2022-07-13 23:02:09,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-13 23:02:09,113 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:09,114 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 23:02:09,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 23:02:09,114 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:09,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:09,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1752503899, now seen corresponding path program 1 times [2022-07-13 23:02:09,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:09,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49273654] [2022-07-13 23:02:09,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:09,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:09,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:09,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:09,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:02:09,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:09,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 23:02:09,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:09,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:09,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:09,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:09,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:09,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 23:02:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:09,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 23:02:09,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:09,547 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 23:02:09,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:09,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49273654] [2022-07-13 23:02:09,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49273654] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:02:09,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:02:09,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 23:02:09,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76792215] [2022-07-13 23:02:09,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:09,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 23:02:09,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:09,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 23:02:09,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 23:02:09,551 INFO L87 Difference]: Start difference. First operand 4086 states and 5686 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-13 23:02:12,595 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:02:20,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:20,997 INFO L93 Difference]: Finished difference Result 14421 states and 21784 transitions. [2022-07-13 23:02:20,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 23:02:20,998 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 94 [2022-07-13 23:02:20,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:21,058 INFO L225 Difference]: With dead ends: 14421 [2022-07-13 23:02:21,059 INFO L226 Difference]: Without dead ends: 10347 [2022-07-13 23:02:21,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2022-07-13 23:02:21,085 INFO L413 NwaCegarLoop]: 2077 mSDtfsCounter, 2810 mSDsluCounter, 4431 mSDsCounter, 0 mSdLazyCounter, 4845 mSolverCounterSat, 1176 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3023 SdHoareTripleChecker+Valid, 6508 SdHoareTripleChecker+Invalid, 6022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1176 IncrementalHoareTripleChecker+Valid, 4845 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2022-07-13 23:02:21,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3023 Valid, 6508 Invalid, 6022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1176 Valid, 4845 Invalid, 1 Unknown, 0 Unchecked, 10.9s Time] [2022-07-13 23:02:21,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10347 states. [2022-07-13 23:02:21,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10347 to 8345. [2022-07-13 23:02:21,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8345 states, 6262 states have (on average 1.2986266368572341) internal successors, (8132), 6459 states have internal predecessors, (8132), 1580 states have call successors, (1580), 393 states have call predecessors, (1580), 502 states have return successors, (2508), 1552 states have call predecessors, (2508), 1576 states have call successors, (2508) [2022-07-13 23:02:21,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8345 states to 8345 states and 12220 transitions. [2022-07-13 23:02:21,578 INFO L78 Accepts]: Start accepts. Automaton has 8345 states and 12220 transitions. Word has length 94 [2022-07-13 23:02:21,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:21,581 INFO L495 AbstractCegarLoop]: Abstraction has 8345 states and 12220 transitions. [2022-07-13 23:02:21,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-13 23:02:21,582 INFO L276 IsEmpty]: Start isEmpty. Operand 8345 states and 12220 transitions. [2022-07-13 23:02:21,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-13 23:02:21,584 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:21,584 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 23:02:21,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 23:02:21,584 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:21,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:21,585 INFO L85 PathProgramCache]: Analyzing trace with hash -865281053, now seen corresponding path program 1 times [2022-07-13 23:02:21,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:21,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249550880] [2022-07-13 23:02:21,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:21,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:21,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:21,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:02:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:21,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 23:02:21,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:21,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:21,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:21,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:21,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 23:02:21,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:21,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 23:02:21,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:22,001 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 23:02:22,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:22,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249550880] [2022-07-13 23:02:22,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249550880] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:02:22,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:02:22,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 23:02:22,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862034414] [2022-07-13 23:02:22,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:22,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 23:02:22,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:22,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 23:02:22,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 23:02:22,007 INFO L87 Difference]: Start difference. First operand 8345 states and 12220 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 23:02:24,585 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:02:29,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:29,378 INFO L93 Difference]: Finished difference Result 19289 states and 29154 transitions. [2022-07-13 23:02:29,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 23:02:29,379 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 94 [2022-07-13 23:02:29,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:29,475 INFO L225 Difference]: With dead ends: 19289 [2022-07-13 23:02:29,476 INFO L226 Difference]: Without dead ends: 10956 [2022-07-13 23:02:29,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-07-13 23:02:29,511 INFO L413 NwaCegarLoop]: 1363 mSDtfsCounter, 2529 mSDsluCounter, 3026 mSDsCounter, 0 mSdLazyCounter, 2503 mSolverCounterSat, 1299 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2615 SdHoareTripleChecker+Valid, 4389 SdHoareTripleChecker+Invalid, 3803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1299 IncrementalHoareTripleChecker+Valid, 2503 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-07-13 23:02:29,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2615 Valid, 4389 Invalid, 3803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1299 Valid, 2503 Invalid, 1 Unknown, 0 Unchecked, 6.9s Time] [2022-07-13 23:02:29,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10956 states. [2022-07-13 23:02:29,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10956 to 8724. [2022-07-13 23:02:29,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8724 states, 6534 states have (on average 1.2976737067646158) internal successors, (8479), 6741 states have internal predecessors, (8479), 1649 states have call successors, (1649), 419 states have call predecessors, (1649), 540 states have return successors, (2695), 1623 states have call predecessors, (2695), 1645 states have call successors, (2695) [2022-07-13 23:02:29,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8724 states to 8724 states and 12823 transitions. [2022-07-13 23:02:29,966 INFO L78 Accepts]: Start accepts. Automaton has 8724 states and 12823 transitions. Word has length 94 [2022-07-13 23:02:29,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:29,968 INFO L495 AbstractCegarLoop]: Abstraction has 8724 states and 12823 transitions. [2022-07-13 23:02:29,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 23:02:29,969 INFO L276 IsEmpty]: Start isEmpty. Operand 8724 states and 12823 transitions. [2022-07-13 23:02:29,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-13 23:02:29,974 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:29,974 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 23:02:29,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 23:02:29,974 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:29,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:29,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1105666320, now seen corresponding path program 1 times [2022-07-13 23:02:29,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:29,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233982755] [2022-07-13 23:02:29,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:29,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:30,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:30,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:02:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:30,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 23:02:30,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:30,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:30,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:30,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 23:02:30,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:30,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 23:02:30,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:30,307 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 23:02:30,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:30,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233982755] [2022-07-13 23:02:30,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233982755] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:02:30,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:02:30,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 23:02:30,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598805630] [2022-07-13 23:02:30,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:30,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 23:02:30,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:30,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 23:02:30,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 23:02:30,310 INFO L87 Difference]: Start difference. First operand 8724 states and 12823 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-13 23:02:32,858 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:02:36,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:36,546 INFO L93 Difference]: Finished difference Result 19579 states and 30376 transitions. [2022-07-13 23:02:36,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 23:02:36,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 103 [2022-07-13 23:02:36,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:36,600 INFO L225 Difference]: With dead ends: 19579 [2022-07-13 23:02:36,600 INFO L226 Difference]: Without dead ends: 10867 [2022-07-13 23:02:36,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-13 23:02:36,645 INFO L413 NwaCegarLoop]: 1390 mSDtfsCounter, 625 mSDsluCounter, 2205 mSDsCounter, 0 mSdLazyCounter, 1568 mSolverCounterSat, 288 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 3595 SdHoareTripleChecker+Invalid, 1857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 1568 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-07-13 23:02:36,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 3595 Invalid, 1857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 1568 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2022-07-13 23:02:36,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10867 states. [2022-07-13 23:02:37,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10867 to 8750. [2022-07-13 23:02:37,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8750 states, 6560 states have (on average 1.2964939024390243) internal successors, (8505), 6767 states have internal predecessors, (8505), 1649 states have call successors, (1649), 419 states have call predecessors, (1649), 540 states have return successors, (2695), 1623 states have call predecessors, (2695), 1645 states have call successors, (2695) [2022-07-13 23:02:37,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8750 states to 8750 states and 12849 transitions. [2022-07-13 23:02:37,138 INFO L78 Accepts]: Start accepts. Automaton has 8750 states and 12849 transitions. Word has length 103 [2022-07-13 23:02:37,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:37,139 INFO L495 AbstractCegarLoop]: Abstraction has 8750 states and 12849 transitions. [2022-07-13 23:02:37,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-13 23:02:37,140 INFO L276 IsEmpty]: Start isEmpty. Operand 8750 states and 12849 transitions. [2022-07-13 23:02:37,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-13 23:02:37,141 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:37,141 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 23:02:37,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 23:02:37,142 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:37,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:37,143 INFO L85 PathProgramCache]: Analyzing trace with hash 387197066, now seen corresponding path program 1 times [2022-07-13 23:02:37,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:37,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820670062] [2022-07-13 23:02:37,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:37,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:37,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:37,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:37,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:37,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:02:37,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:37,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 23:02:37,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:37,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:37,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:37,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:37,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:37,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 23:02:37,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:37,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 23:02:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:37,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 23:02:37,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:37,436 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 23:02:37,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:37,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820670062] [2022-07-13 23:02:37,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820670062] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:02:37,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978999414] [2022-07-13 23:02:37,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:37,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:02:37,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:02:37,439 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-13 23:02:37,442 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-13 23:02:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:38,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 2804 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 23:02:38,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:02:38,268 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 23:02:38,269 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:02:38,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978999414] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:02:38,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 23:02:38,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2022-07-13 23:02:38,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534688115] [2022-07-13 23:02:38,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:38,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 23:02:38,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:38,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 23:02:38,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-13 23:02:38,271 INFO L87 Difference]: Start difference. First operand 8750 states and 12849 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 23:02:38,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:38,729 INFO L93 Difference]: Finished difference Result 17235 states and 25279 transitions. [2022-07-13 23:02:38,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 23:02:38,730 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 111 [2022-07-13 23:02:38,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:38,773 INFO L225 Difference]: With dead ends: 17235 [2022-07-13 23:02:38,773 INFO L226 Difference]: Without dead ends: 8486 [2022-07-13 23:02:38,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-13 23:02:38,821 INFO L413 NwaCegarLoop]: 1382 mSDtfsCounter, 13 mSDsluCounter, 4124 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 5506 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 23:02:38,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 5506 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 23:02:38,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8486 states. [2022-07-13 23:02:39,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8486 to 8438. [2022-07-13 23:02:39,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8438 states, 6314 states have (on average 1.2944250871080138) internal successors, (8173), 6514 states have internal predecessors, (8173), 1605 states have call successors, (1605), 398 states have call predecessors, (1605), 518 states have return successors, (2578), 1581 states have call predecessors, (2578), 1601 states have call successors, (2578) [2022-07-13 23:02:39,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8438 states to 8438 states and 12356 transitions. [2022-07-13 23:02:39,291 INFO L78 Accepts]: Start accepts. Automaton has 8438 states and 12356 transitions. Word has length 111 [2022-07-13 23:02:39,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:39,292 INFO L495 AbstractCegarLoop]: Abstraction has 8438 states and 12356 transitions. [2022-07-13 23:02:39,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 23:02:39,292 INFO L276 IsEmpty]: Start isEmpty. Operand 8438 states and 12356 transitions. [2022-07-13 23:02:39,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-13 23:02:39,294 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:39,294 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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] [2022-07-13 23:02:39,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 23:02:39,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:02:39,503 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:39,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:39,504 INFO L85 PathProgramCache]: Analyzing trace with hash 623950775, now seen corresponding path program 1 times [2022-07-13 23:02:39,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:39,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757211442] [2022-07-13 23:02:39,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:39,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:39,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:39,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:39,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:39,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:02:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:39,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 23:02:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:39,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:39,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:39,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:40,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 23:02:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:40,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 23:02:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:40,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 23:02:40,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:40,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 23:02:40,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:40,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 23:02:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:40,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 23:02:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:40,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 23:02:40,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:40,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 23:02:40,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:40,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 23:02:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:40,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:40,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:40,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:40,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-13 23:02:40,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:40,176 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-13 23:02:40,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:40,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757211442] [2022-07-13 23:02:40,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757211442] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:02:40,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039288231] [2022-07-13 23:02:40,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:40,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:02:40,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:02:40,180 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-13 23:02:40,203 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-13 23:02:41,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:41,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 2937 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 23:02:41,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:02:41,174 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-13 23:02:41,174 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:02:41,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039288231] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:02:41,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 23:02:41,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2022-07-13 23:02:41,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506144060] [2022-07-13 23:02:41,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:41,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 23:02:41,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:41,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 23:02:41,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-07-13 23:02:41,176 INFO L87 Difference]: Start difference. First operand 8438 states and 12356 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-13 23:02:41,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:41,532 INFO L93 Difference]: Finished difference Result 8490 states and 12408 transitions. [2022-07-13 23:02:41,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 23:02:41,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 124 [2022-07-13 23:02:41,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:41,567 INFO L225 Difference]: With dead ends: 8490 [2022-07-13 23:02:41,568 INFO L226 Difference]: Without dead ends: 8464 [2022-07-13 23:02:41,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2022-07-13 23:02:41,574 INFO L413 NwaCegarLoop]: 1371 mSDtfsCounter, 1368 mSDsluCounter, 2748 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1369 SdHoareTripleChecker+Valid, 4119 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 23:02:41,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1369 Valid, 4119 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 23:02:41,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8464 states. [2022-07-13 23:02:41,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8464 to 8438. [2022-07-13 23:02:41,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8438 states, 6314 states have (on average 1.2939499524865379) internal successors, (8170), 6514 states have internal predecessors, (8170), 1605 states have call successors, (1605), 398 states have call predecessors, (1605), 518 states have return successors, (2578), 1581 states have call predecessors, (2578), 1601 states have call successors, (2578) [2022-07-13 23:02:41,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8438 states to 8438 states and 12353 transitions. [2022-07-13 23:02:41,941 INFO L78 Accepts]: Start accepts. Automaton has 8438 states and 12353 transitions. Word has length 124 [2022-07-13 23:02:41,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:41,942 INFO L495 AbstractCegarLoop]: Abstraction has 8438 states and 12353 transitions. [2022-07-13 23:02:41,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-13 23:02:41,942 INFO L276 IsEmpty]: Start isEmpty. Operand 8438 states and 12353 transitions. [2022-07-13 23:02:41,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-13 23:02:41,944 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:41,944 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:02:41,976 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-13 23:02:42,159 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,SelfDestructingSolverStorable8 [2022-07-13 23:02:42,160 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:42,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:42,160 INFO L85 PathProgramCache]: Analyzing trace with hash -2082115524, now seen corresponding path program 1 times [2022-07-13 23:02:42,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:42,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802552812] [2022-07-13 23:02:42,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:42,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:42,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:42,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:42,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:42,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 23:02:42,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:42,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:42,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:42,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:42,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 23:02:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:42,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 23:02:42,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:42,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 23:02:42,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:42,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 23:02:42,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:42,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-13 23:02:42,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:42,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 23:02:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:42,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-13 23:02:42,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:42,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 23:02:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:42,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 23:02:42,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:42,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:42,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:42,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:42,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-13 23:02:42,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:42,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:42,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:42,731 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-13 23:02:42,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:42,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802552812] [2022-07-13 23:02:42,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802552812] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:02:42,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077529345] [2022-07-13 23:02:42,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:42,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:02:42,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:02:42,736 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-13 23:02:42,737 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-13 23:02:43,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:43,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 3014 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-13 23:02:43,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:02:43,769 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-13 23:02:43,769 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:02:43,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077529345] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:02:43,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 23:02:43,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2022-07-13 23:02:43,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932359412] [2022-07-13 23:02:43,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:43,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 23:02:43,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:43,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 23:02:43,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2022-07-13 23:02:43,771 INFO L87 Difference]: Start difference. First operand 8438 states and 12353 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-13 23:02:44,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:44,220 INFO L93 Difference]: Finished difference Result 14689 states and 21854 transitions. [2022-07-13 23:02:44,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 23:02:44,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 130 [2022-07-13 23:02:44,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:44,247 INFO L225 Difference]: With dead ends: 14689 [2022-07-13 23:02:44,247 INFO L226 Difference]: Without dead ends: 6299 [2022-07-13 23:02:44,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2022-07-13 23:02:44,293 INFO L413 NwaCegarLoop]: 1369 mSDtfsCounter, 0 mSDsluCounter, 4100 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5469 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 23:02:44,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5469 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 23:02:44,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6299 states. [2022-07-13 23:02:44,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6299 to 6285. [2022-07-13 23:02:44,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6285 states, 4703 states have (on average 1.2925792047629172) internal successors, (6079), 4851 states have internal predecessors, (6079), 1195 states have call successors, (1195), 300 states have call predecessors, (1195), 386 states have return successors, (1863), 1175 states have call predecessors, (1863), 1191 states have call successors, (1863) [2022-07-13 23:02:44,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6285 states to 6285 states and 9137 transitions. [2022-07-13 23:02:44,602 INFO L78 Accepts]: Start accepts. Automaton has 6285 states and 9137 transitions. Word has length 130 [2022-07-13 23:02:44,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:44,603 INFO L495 AbstractCegarLoop]: Abstraction has 6285 states and 9137 transitions. [2022-07-13 23:02:44,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-13 23:02:44,603 INFO L276 IsEmpty]: Start isEmpty. Operand 6285 states and 9137 transitions. [2022-07-13 23:02:44,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-13 23:02:44,605 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:44,605 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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] [2022-07-13 23:02:44,637 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-13 23:02:44,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:02:44,820 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:44,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:44,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1718591214, now seen corresponding path program 1 times [2022-07-13 23:02:44,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:44,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715607642] [2022-07-13 23:02:44,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:44,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:44,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:44,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:44,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:44,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:02:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:45,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 23:02:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:45,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:45,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:45,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:45,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 23:02:45,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:45,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 23:02:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:45,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 23:02:45,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:45,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 23:02:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:45,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 23:02:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:45,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 23:02:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:45,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 23:02:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:45,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 23:02:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:45,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 23:02:45,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:45,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:45,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:45,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:45,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 23:02:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:45,372 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-13 23:02:45,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:45,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715607642] [2022-07-13 23:02:45,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715607642] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:02:45,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007574953] [2022-07-13 23:02:45,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:45,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:02:45,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:02:45,375 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-13 23:02:45,376 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-13 23:02:46,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:46,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 2949 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 23:02:46,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:02:46,290 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-13 23:02:46,291 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:02:46,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007574953] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:02:46,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 23:02:46,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [13] total 15 [2022-07-13 23:02:46,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621093722] [2022-07-13 23:02:46,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:46,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 23:02:46,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:46,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 23:02:46,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-07-13 23:02:46,293 INFO L87 Difference]: Start difference. First operand 6285 states and 9137 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-13 23:02:46,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:46,531 INFO L93 Difference]: Finished difference Result 12522 states and 18220 transitions. [2022-07-13 23:02:46,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 23:02:46,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 128 [2022-07-13 23:02:46,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:46,562 INFO L225 Difference]: With dead ends: 12522 [2022-07-13 23:02:46,562 INFO L226 Difference]: Without dead ends: 6285 [2022-07-13 23:02:46,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-07-13 23:02:46,587 INFO L413 NwaCegarLoop]: 1372 mSDtfsCounter, 22 mSDsluCounter, 2700 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 4072 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 23:02:46,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 4072 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 23:02:46,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6285 states. [2022-07-13 23:02:46,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6285 to 6285. [2022-07-13 23:02:46,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6285 states, 4703 states have (on average 1.2915160535828194) internal successors, (6074), 4851 states have internal predecessors, (6074), 1195 states have call successors, (1195), 300 states have call predecessors, (1195), 386 states have return successors, (1863), 1175 states have call predecessors, (1863), 1191 states have call successors, (1863) [2022-07-13 23:02:46,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6285 states to 6285 states and 9132 transitions. [2022-07-13 23:02:46,858 INFO L78 Accepts]: Start accepts. Automaton has 6285 states and 9132 transitions. Word has length 128 [2022-07-13 23:02:46,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:46,858 INFO L495 AbstractCegarLoop]: Abstraction has 6285 states and 9132 transitions. [2022-07-13 23:02:46,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-13 23:02:46,859 INFO L276 IsEmpty]: Start isEmpty. Operand 6285 states and 9132 transitions. [2022-07-13 23:02:46,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-13 23:02:46,861 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:46,862 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:02:46,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 23:02:47,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:02:47,087 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:47,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:47,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1120501507, now seen corresponding path program 1 times [2022-07-13 23:02:47,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:47,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286493611] [2022-07-13 23:02:47,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:47,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:47,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:47,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:47,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 23:02:47,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:47,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:47,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:47,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 23:02:47,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:47,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 23:02:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:47,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 23:02:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:47,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 23:02:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:47,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-13 23:02:47,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:47,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 23:02:47,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:47,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-13 23:02:47,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:47,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 23:02:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:47,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 23:02:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:47,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:47,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:47,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:47,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-13 23:02:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:47,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:47,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:47,661 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-13 23:02:47,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:47,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286493611] [2022-07-13 23:02:47,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286493611] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:02:47,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464989725] [2022-07-13 23:02:47,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:47,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:02:47,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:02:47,663 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 23:02:47,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 23:02:48,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:48,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 3013 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 23:02:48,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:02:48,702 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-13 23:02:48,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 23:02:48,903 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-13 23:02:48,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464989725] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 23:02:48,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-13 23:02:48,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12, 6] total 18 [2022-07-13 23:02:48,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543428916] [2022-07-13 23:02:48,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:48,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 23:02:48,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:48,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 23:02:48,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-07-13 23:02:48,905 INFO L87 Difference]: Start difference. First operand 6285 states and 9132 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 5 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-07-13 23:02:51,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:51,160 INFO L93 Difference]: Finished difference Result 10504 states and 15730 transitions. [2022-07-13 23:02:51,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 23:02:51,161 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 5 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 130 [2022-07-13 23:02:51,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:51,206 INFO L225 Difference]: With dead ends: 10504 [2022-07-13 23:02:51,206 INFO L226 Difference]: Without dead ends: 10499 [2022-07-13 23:02:51,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-07-13 23:02:51,216 INFO L413 NwaCegarLoop]: 2144 mSDtfsCounter, 5080 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 1101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5080 SdHoareTripleChecker+Valid, 2871 SdHoareTripleChecker+Invalid, 1749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1101 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-13 23:02:51,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5080 Valid, 2871 Invalid, 1749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1101 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-13 23:02:51,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10499 states. [2022-07-13 23:02:51,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10499 to 10473. [2022-07-13 23:02:51,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10473 states, 7831 states have (on average 1.2911505554846123) internal successors, (10111), 8077 states have internal predecessors, (10111), 1997 states have call successors, (1997), 494 states have call predecessors, (1997), 644 states have return successors, (3586), 1971 states have call predecessors, (3586), 1993 states have call successors, (3586) [2022-07-13 23:02:51,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10473 states to 10473 states and 15694 transitions. [2022-07-13 23:02:51,717 INFO L78 Accepts]: Start accepts. Automaton has 10473 states and 15694 transitions. Word has length 130 [2022-07-13 23:02:51,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:51,718 INFO L495 AbstractCegarLoop]: Abstraction has 10473 states and 15694 transitions. [2022-07-13 23:02:51,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 5 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-07-13 23:02:51,718 INFO L276 IsEmpty]: Start isEmpty. Operand 10473 states and 15694 transitions. [2022-07-13 23:02:51,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-07-13 23:02:51,722 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:51,722 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:02:51,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 23:02:51,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-13 23:02:51,943 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:51,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:51,943 INFO L85 PathProgramCache]: Analyzing trace with hash -2046530365, now seen corresponding path program 1 times [2022-07-13 23:02:51,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:51,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236477188] [2022-07-13 23:02:51,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:51,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:52,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:52,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:52,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:52,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 23:02:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:52,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:52,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:52,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 23:02:52,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:52,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 23:02:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:52,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 23:02:52,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:52,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 23:02:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:52,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-13 23:02:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:52,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 23:02:52,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:52,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-13 23:02:52,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:52,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 23:02:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:52,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-13 23:02:52,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:52,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-13 23:02:52,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:52,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:52,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:52,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:52,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:52,491 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-13 23:02:52,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:52,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236477188] [2022-07-13 23:02:52,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236477188] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:02:52,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510291432] [2022-07-13 23:02:52,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:52,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:02:52,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:02:52,493 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 23:02:52,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 23:02:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:53,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 3106 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 23:02:53,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:02:53,466 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-13 23:02:53,466 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:02:53,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510291432] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:02:53,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 23:02:53,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2022-07-13 23:02:53,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843756334] [2022-07-13 23:02:53,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:53,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 23:02:53,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:53,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 23:02:53,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2022-07-13 23:02:53,469 INFO L87 Difference]: Start difference. First operand 10473 states and 15694 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-13 23:02:54,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:54,154 INFO L93 Difference]: Finished difference Result 25908 states and 40840 transitions. [2022-07-13 23:02:54,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 23:02:54,155 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 148 [2022-07-13 23:02:54,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:54,325 INFO L225 Difference]: With dead ends: 25908 [2022-07-13 23:02:54,326 INFO L226 Difference]: Without dead ends: 15483 [2022-07-13 23:02:54,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2022-07-13 23:02:54,379 INFO L413 NwaCegarLoop]: 1889 mSDtfsCounter, 1067 mSDsluCounter, 4818 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1125 SdHoareTripleChecker+Valid, 6707 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 23:02:54,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1125 Valid, 6707 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 23:02:54,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15483 states. [2022-07-13 23:02:54,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15483 to 10553. [2022-07-13 23:02:54,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10553 states, 7901 states have (on average 1.2898367295279078) internal successors, (10191), 8147 states have internal predecessors, (10191), 2007 states have call successors, (2007), 494 states have call predecessors, (2007), 644 states have return successors, (3596), 1981 states have call predecessors, (3596), 2003 states have call successors, (3596) [2022-07-13 23:02:54,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10553 states to 10553 states and 15794 transitions. [2022-07-13 23:02:55,001 INFO L78 Accepts]: Start accepts. Automaton has 10553 states and 15794 transitions. Word has length 148 [2022-07-13 23:02:55,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:55,001 INFO L495 AbstractCegarLoop]: Abstraction has 10553 states and 15794 transitions. [2022-07-13 23:02:55,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-13 23:02:55,002 INFO L276 IsEmpty]: Start isEmpty. Operand 10553 states and 15794 transitions. [2022-07-13 23:02:55,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-07-13 23:02:55,005 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:55,005 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:02:55,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 23:02:55,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:02:55,231 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:55,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:55,232 INFO L85 PathProgramCache]: Analyzing trace with hash -118257663, now seen corresponding path program 1 times [2022-07-13 23:02:55,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:55,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408638957] [2022-07-13 23:02:55,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:55,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:55,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:55,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 23:02:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:55,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:55,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:55,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:55,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:55,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 23:02:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:55,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 23:02:55,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:55,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 23:02:55,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:55,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 23:02:55,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:55,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-13 23:02:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:55,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 23:02:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:55,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-13 23:02:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:55,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 23:02:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:55,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-13 23:02:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:55,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-13 23:02:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:55,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:55,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:55,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:55,638 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-13 23:02:55,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:55,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408638957] [2022-07-13 23:02:55,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408638957] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:02:55,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290391856] [2022-07-13 23:02:55,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:55,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:02:55,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:02:55,640 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 23:02:55,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 23:02:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:56,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 3099 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 23:02:56,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:02:56,778 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-13 23:02:56,778 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:02:56,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290391856] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:02:56,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 23:02:56,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2022-07-13 23:02:56,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004673143] [2022-07-13 23:02:56,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:56,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 23:02:56,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:56,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 23:02:56,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-13 23:02:56,780 INFO L87 Difference]: Start difference. First operand 10553 states and 15794 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-13 23:02:57,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:57,179 INFO L93 Difference]: Finished difference Result 20588 states and 31782 transitions. [2022-07-13 23:02:57,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 23:02:57,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 148 [2022-07-13 23:02:57,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:57,224 INFO L225 Difference]: With dead ends: 20588 [2022-07-13 23:02:57,224 INFO L226 Difference]: Without dead ends: 9887 [2022-07-13 23:02:57,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-13 23:02:57,294 INFO L413 NwaCegarLoop]: 1300 mSDtfsCounter, 3 mSDsluCounter, 1295 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2595 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 23:02:57,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2595 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 23:02:57,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9887 states. [2022-07-13 23:02:57,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9887 to 9887. [2022-07-13 23:02:57,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9887 states, 7285 states have (on average 1.2797529169526425) internal successors, (9323), 7531 states have internal predecessors, (9323), 1957 states have call successors, (1957), 494 states have call predecessors, (1957), 644 states have return successors, (3532), 1931 states have call predecessors, (3532), 1953 states have call successors, (3532) [2022-07-13 23:02:57,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9887 states to 9887 states and 14812 transitions. [2022-07-13 23:02:57,881 INFO L78 Accepts]: Start accepts. Automaton has 9887 states and 14812 transitions. Word has length 148 [2022-07-13 23:02:57,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:57,882 INFO L495 AbstractCegarLoop]: Abstraction has 9887 states and 14812 transitions. [2022-07-13 23:02:57,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-13 23:02:57,883 INFO L276 IsEmpty]: Start isEmpty. Operand 9887 states and 14812 transitions. [2022-07-13 23:02:57,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-13 23:02:57,887 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:57,887 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:02:57,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 23:02:58,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:02:58,103 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:58,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:58,104 INFO L85 PathProgramCache]: Analyzing trace with hash -956951615, now seen corresponding path program 1 times [2022-07-13 23:02:58,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:58,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622501055] [2022-07-13 23:02:58,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:58,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:58,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:02:58,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 23:02:58,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:58,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 23:02:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 23:02:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 23:02:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 23:02:58,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 23:02:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 23:02:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 23:02:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 23:02:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 23:02:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 23:02:58,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 23:02:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:02:58,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-13 23:02:58,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,659 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-13 23:02:58,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:58,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622501055] [2022-07-13 23:02:58,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622501055] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:02:58,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682077387] [2022-07-13 23:02:58,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:58,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:02:58,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:02:58,664 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 23:02:58,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 23:02:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:59,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 3122 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-13 23:02:59,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:02:59,777 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-13 23:02:59,778 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:02:59,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682077387] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:02:59,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 23:02:59,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 14 [2022-07-13 23:02:59,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271973810] [2022-07-13 23:02:59,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:59,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 23:02:59,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:59,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 23:02:59,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-07-13 23:02:59,780 INFO L87 Difference]: Start difference. First operand 9887 states and 14812 transitions. Second operand has 10 states, 10 states have (on average 10.0) internal successors, (100), 7 states have internal predecessors, (100), 2 states have call successors, (22), 2 states have call predecessors, (22), 5 states have return successors, (21), 5 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-13 23:03:00,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:00,315 INFO L93 Difference]: Finished difference Result 19704 states and 30481 transitions. [2022-07-13 23:03:00,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 23:03:00,316 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 7 states have internal predecessors, (100), 2 states have call successors, (22), 2 states have call predecessors, (22), 5 states have return successors, (21), 5 states have call predecessors, (21), 2 states have call successors, (21) Word has length 161 [2022-07-13 23:03:00,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:00,361 INFO L225 Difference]: With dead ends: 19704 [2022-07-13 23:03:00,362 INFO L226 Difference]: Without dead ends: 9849 [2022-07-13 23:03:00,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 199 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-07-13 23:03:00,420 INFO L413 NwaCegarLoop]: 1279 mSDtfsCounter, 4 mSDsluCounter, 10192 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 11471 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 23:03:00,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 11471 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 23:03:00,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9849 states. [2022-07-13 23:03:00,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9849 to 9828. [2022-07-13 23:03:00,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9828 states, 7244 states have (on average 1.2763666482606295) internal successors, (9246), 7471 states have internal predecessors, (9246), 1937 states have call successors, (1937), 489 states have call predecessors, (1937), 646 states have return successors, (3522), 1937 states have call predecessors, (3522), 1933 states have call successors, (3522) [2022-07-13 23:03:01,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9828 states to 9828 states and 14705 transitions. [2022-07-13 23:03:01,005 INFO L78 Accepts]: Start accepts. Automaton has 9828 states and 14705 transitions. Word has length 161 [2022-07-13 23:03:01,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:01,006 INFO L495 AbstractCegarLoop]: Abstraction has 9828 states and 14705 transitions. [2022-07-13 23:03:01,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 7 states have internal predecessors, (100), 2 states have call successors, (22), 2 states have call predecessors, (22), 5 states have return successors, (21), 5 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-13 23:03:01,006 INFO L276 IsEmpty]: Start isEmpty. Operand 9828 states and 14705 transitions. [2022-07-13 23:03:01,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-13 23:03:01,011 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:01,011 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 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] [2022-07-13 23:03:01,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 23:03:01,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-13 23:03:01,240 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:01,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:01,240 INFO L85 PathProgramCache]: Analyzing trace with hash -812541920, now seen corresponding path program 1 times [2022-07-13 23:03:01,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:03:01,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105784964] [2022-07-13 23:03:01,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:01,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:03:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:01,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:03:01,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:01,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:03:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:01,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 23:03:01,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:01,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:01,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:01,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:01,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:01,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 23:03:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:01,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 23:03:01,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:01,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 23:03:01,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:01,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 23:03:01,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:01,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 23:03:01,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:01,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 23:03:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:01,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 23:03:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:01,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 23:03:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:01,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 23:03:01,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:01,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:01,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:01,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:01,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 23:03:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:01,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:01,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 23:03:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:01,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:03:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:01,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-13 23:03:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:01,771 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-13 23:03:01,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:03:01,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105784964] [2022-07-13 23:03:01,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105784964] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:03:01,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055796646] [2022-07-13 23:03:01,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:01,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:03:01,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:03:01,774 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 23:03:01,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 23:03:02,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:02,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 3131 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 23:03:02,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:03:03,005 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-13 23:03:03,006 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:03:03,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055796646] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:03:03,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 23:03:03,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-07-13 23:03:03,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29388396] [2022-07-13 23:03:03,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:03:03,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 23:03:03,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:03:03,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 23:03:03,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2022-07-13 23:03:03,008 INFO L87 Difference]: Start difference. First operand 9828 states and 14705 transitions. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 7 states have internal predecessors, (105), 2 states have call successors, (22), 2 states have call predecessors, (22), 5 states have return successors, (21), 5 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-13 23:03:03,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:03,420 INFO L93 Difference]: Finished difference Result 17815 states and 27523 transitions. [2022-07-13 23:03:03,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 23:03:03,421 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 7 states have internal predecessors, (105), 2 states have call successors, (22), 2 states have call predecessors, (22), 5 states have return successors, (21), 5 states have call predecessors, (21), 2 states have call successors, (21) Word has length 161 [2022-07-13 23:03:03,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:03,467 INFO L225 Difference]: With dead ends: 17815 [2022-07-13 23:03:03,467 INFO L226 Difference]: Without dead ends: 9867 [2022-07-13 23:03:03,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2022-07-13 23:03:03,516 INFO L413 NwaCegarLoop]: 1279 mSDtfsCounter, 3 mSDsluCounter, 10212 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 11491 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 23:03:03,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 11491 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 23:03:03,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9867 states. [2022-07-13 23:03:03,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9867 to 9867. [2022-07-13 23:03:03,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9867 states, 7275 states have (on average 1.2758762886597939) internal successors, (9282), 7496 states have internal predecessors, (9282), 1937 states have call successors, (1937), 489 states have call predecessors, (1937), 654 states have return successors, (3548), 1951 states have call predecessors, (3548), 1933 states have call successors, (3548) [2022-07-13 23:03:03,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9867 states to 9867 states and 14767 transitions. [2022-07-13 23:03:03,952 INFO L78 Accepts]: Start accepts. Automaton has 9867 states and 14767 transitions. Word has length 161 [2022-07-13 23:03:03,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:03,952 INFO L495 AbstractCegarLoop]: Abstraction has 9867 states and 14767 transitions. [2022-07-13 23:03:03,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 7 states have internal predecessors, (105), 2 states have call successors, (22), 2 states have call predecessors, (22), 5 states have return successors, (21), 5 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-13 23:03:03,953 INFO L276 IsEmpty]: Start isEmpty. Operand 9867 states and 14767 transitions. [2022-07-13 23:03:03,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-13 23:03:03,957 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:03,957 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 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] [2022-07-13 23:03:03,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-13 23:03:04,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-13 23:03:04,183 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:04,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:04,184 INFO L85 PathProgramCache]: Analyzing trace with hash 491851809, now seen corresponding path program 2 times [2022-07-13 23:03:04,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:03:04,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484417595] [2022-07-13 23:03:04,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:04,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:03:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:04,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:03:04,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:04,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:03:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:04,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 23:03:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:04,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:04,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:04,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:04,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:04,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 23:03:04,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:04,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 23:03:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:04,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 23:03:04,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:04,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 23:03:04,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:04,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 23:03:04,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:04,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 23:03:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:04,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 23:03:04,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:04,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 23:03:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:04,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 23:03:04,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:04,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:04,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:04,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:04,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:04,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 23:03:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:04,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:04,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:04,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 23:03:04,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:04,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:03:04,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:04,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-13 23:03:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:04,689 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-13 23:03:04,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:03:04,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484417595] [2022-07-13 23:03:04,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484417595] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:03:04,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558537471] [2022-07-13 23:03:04,690 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 23:03:04,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:03:04,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:03:04,692 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 23:03:04,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-13 23:03:05,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 23:03:05,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 23:03:05,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 3140 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-13 23:03:05,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:03:06,045 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-13 23:03:06,046 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:03:06,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558537471] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:03:06,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 23:03:06,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 14 [2022-07-13 23:03:06,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956242238] [2022-07-13 23:03:06,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:03:06,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 23:03:06,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:03:06,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 23:03:06,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-07-13 23:03:06,048 INFO L87 Difference]: Start difference. First operand 9867 states and 14767 transitions. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 7 states have internal predecessors, (105), 2 states have call successors, (22), 2 states have call predecessors, (22), 5 states have return successors, (21), 5 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-13 23:03:06,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:06,478 INFO L93 Difference]: Finished difference Result 19686 states and 30443 transitions. [2022-07-13 23:03:06,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 23:03:06,479 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 7 states have internal predecessors, (105), 2 states have call successors, (22), 2 states have call predecessors, (22), 5 states have return successors, (21), 5 states have call predecessors, (21), 2 states have call successors, (21) Word has length 161 [2022-07-13 23:03:06,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:06,518 INFO L225 Difference]: With dead ends: 19686 [2022-07-13 23:03:06,519 INFO L226 Difference]: Without dead ends: 9867 [2022-07-13 23:03:06,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 197 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-07-13 23:03:06,567 INFO L413 NwaCegarLoop]: 1289 mSDtfsCounter, 2 mSDsluCounter, 10281 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11570 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 23:03:06,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11570 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 23:03:06,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9867 states. [2022-07-13 23:03:06,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9867 to 9849. [2022-07-13 23:03:06,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9849 states, 7259 states have (on average 1.275244524039124) internal successors, (9257), 7485 states have internal predecessors, (9257), 1937 states have call successors, (1937), 489 states have call predecessors, (1937), 652 states have return successors, (3538), 1944 states have call predecessors, (3538), 1933 states have call successors, (3538) [2022-07-13 23:03:06,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9849 states to 9849 states and 14732 transitions. [2022-07-13 23:03:06,964 INFO L78 Accepts]: Start accepts. Automaton has 9849 states and 14732 transitions. Word has length 161 [2022-07-13 23:03:06,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:06,964 INFO L495 AbstractCegarLoop]: Abstraction has 9849 states and 14732 transitions. [2022-07-13 23:03:06,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 7 states have internal predecessors, (105), 2 states have call successors, (22), 2 states have call predecessors, (22), 5 states have return successors, (21), 5 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-13 23:03:06,965 INFO L276 IsEmpty]: Start isEmpty. Operand 9849 states and 14732 transitions. [2022-07-13 23:03:06,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-13 23:03:06,969 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:06,969 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:03:07,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-13 23:03:07,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-13 23:03:07,187 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:07,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:07,188 INFO L85 PathProgramCache]: Analyzing trace with hash -2002822577, now seen corresponding path program 1 times [2022-07-13 23:03:07,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:03:07,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455705505] [2022-07-13 23:03:07,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:07,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:03:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:07,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:03:07,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:07,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:03:07,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:07,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 23:03:07,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:07,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:07,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:07,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:07,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 23:03:07,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:07,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 23:03:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:07,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 23:03:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:07,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 23:03:07,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:07,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 23:03:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:07,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 23:03:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:08,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 23:03:08,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:08,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 23:03:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:08,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 23:03:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:08,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:08,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:08,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:08,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 23:03:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:08,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-13 23:03:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:08,087 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-13 23:03:08,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:03:08,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455705505] [2022-07-13 23:03:08,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455705505] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:03:08,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558161156] [2022-07-13 23:03:08,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:08,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:03:08,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:03:08,092 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 23:03:08,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-13 23:03:09,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:09,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 3163 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-13 23:03:09,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:03:09,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-13 23:03:10,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-07-13 23:03:10,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-13 23:03:10,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 23:03:10,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-07-13 23:03:10,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-13 23:03:10,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 23:03:10,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-07-13 23:03:10,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-13 23:03:10,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 23:03:10,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-07-13 23:03:10,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-13 23:03:10,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 23:03:10,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-07-13 23:03:10,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-13 23:03:10,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 23:03:10,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-07-13 23:03:10,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-13 23:03:10,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 23:03:10,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-07-13 23:03:10,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-13 23:03:10,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 23:03:10,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-07-13 23:03:10,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-13 23:03:10,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 23:03:10,651 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-13 23:03:10,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 23:03:10,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558161156] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:03:10,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 23:03:10,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 32 [2022-07-13 23:03:10,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734335274] [2022-07-13 23:03:10,825 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 23:03:10,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-13 23:03:10,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:03:10,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-13 23:03:10,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=937, Unknown=20, NotChecked=0, Total=1056 [2022-07-13 23:03:10,827 INFO L87 Difference]: Start difference. First operand 9849 states and 14732 transitions. Second operand has 32 states, 32 states have (on average 5.40625) internal successors, (173), 23 states have internal predecessors, (173), 14 states have call successors, (39), 9 states have call predecessors, (39), 12 states have return successors, (36), 15 states have call predecessors, (36), 14 states have call successors, (36) [2022-07-13 23:03:19,907 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:03:33,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:33,229 INFO L93 Difference]: Finished difference Result 29550 states and 45636 transitions. [2022-07-13 23:03:33,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-07-13 23:03:33,230 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.40625) internal successors, (173), 23 states have internal predecessors, (173), 14 states have call successors, (39), 9 states have call predecessors, (39), 12 states have return successors, (36), 15 states have call predecessors, (36), 14 states have call successors, (36) Word has length 163 [2022-07-13 23:03:33,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:33,322 INFO L225 Difference]: With dead ends: 29550 [2022-07-13 23:03:33,323 INFO L226 Difference]: Without dead ends: 19749 [2022-07-13 23:03:33,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1182 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=509, Invalid=4153, Unknown=30, NotChecked=0, Total=4692 [2022-07-13 23:03:33,374 INFO L413 NwaCegarLoop]: 1480 mSDtfsCounter, 2544 mSDsluCounter, 12083 mSDsCounter, 0 mSdLazyCounter, 15809 mSolverCounterSat, 1081 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2663 SdHoareTripleChecker+Valid, 13563 SdHoareTripleChecker+Invalid, 18372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1081 IncrementalHoareTripleChecker+Valid, 15809 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 1481 IncrementalHoareTripleChecker+Unchecked, 20.4s IncrementalHoareTripleChecker+Time [2022-07-13 23:03:33,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2663 Valid, 13563 Invalid, 18372 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1081 Valid, 15809 Invalid, 1 Unknown, 1481 Unchecked, 20.4s Time] [2022-07-13 23:03:33,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19749 states. [2022-07-13 23:03:34,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19749 to 17683. [2022-07-13 23:03:34,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17683 states, 12980 states have (on average 1.263482280431433) internal successors, (16400), 13422 states have internal predecessors, (16400), 3362 states have call successors, (3362), 941 states have call predecessors, (3362), 1340 states have return successors, (6800), 3439 states have call predecessors, (6800), 3358 states have call successors, (6800) [2022-07-13 23:03:34,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17683 states to 17683 states and 26562 transitions. [2022-07-13 23:03:34,364 INFO L78 Accepts]: Start accepts. Automaton has 17683 states and 26562 transitions. Word has length 163 [2022-07-13 23:03:34,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:34,365 INFO L495 AbstractCegarLoop]: Abstraction has 17683 states and 26562 transitions. [2022-07-13 23:03:34,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.40625) internal successors, (173), 23 states have internal predecessors, (173), 14 states have call successors, (39), 9 states have call predecessors, (39), 12 states have return successors, (36), 15 states have call predecessors, (36), 14 states have call successors, (36) [2022-07-13 23:03:34,365 INFO L276 IsEmpty]: Start isEmpty. Operand 17683 states and 26562 transitions. [2022-07-13 23:03:34,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-13 23:03:34,368 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:34,368 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:03:34,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-13 23:03:34,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-13 23:03:34,577 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:34,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:34,578 INFO L85 PathProgramCache]: Analyzing trace with hash 119108019, now seen corresponding path program 1 times [2022-07-13 23:03:34,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:03:34,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82207494] [2022-07-13 23:03:34,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:34,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:03:34,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:34,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:03:34,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:34,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 23:03:34,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:34,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:34,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:34,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:34,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:34,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 23:03:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:34,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 23:03:34,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:34,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 23:03:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:34,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 23:03:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:34,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-13 23:03:34,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:34,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 23:03:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:34,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-13 23:03:34,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:34,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 23:03:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:34,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 23:03:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:34,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:34,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:34,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:34,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-13 23:03:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:34,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:34,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:34,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:34,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:34,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-13 23:03:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:34,987 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-13 23:03:34,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:03:34,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82207494] [2022-07-13 23:03:34,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82207494] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:03:34,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:03:34,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 23:03:34,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341219391] [2022-07-13 23:03:34,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:03:34,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 23:03:34,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:03:34,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 23:03:34,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 23:03:34,990 INFO L87 Difference]: Start difference. First operand 17683 states and 26562 transitions. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 4 states have internal predecessors, (103), 3 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-13 23:03:37,942 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:03:41,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:41,183 INFO L93 Difference]: Finished difference Result 34452 states and 54349 transitions. [2022-07-13 23:03:41,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 23:03:41,183 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 4 states have internal predecessors, (103), 3 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 166 [2022-07-13 23:03:41,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:41,263 INFO L225 Difference]: With dead ends: 34452 [2022-07-13 23:03:41,263 INFO L226 Difference]: Without dead ends: 16817 [2022-07-13 23:03:41,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-13 23:03:41,354 INFO L413 NwaCegarLoop]: 837 mSDtfsCounter, 789 mSDsluCounter, 1984 mSDsCounter, 0 mSdLazyCounter, 1672 mSolverCounterSat, 387 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 2821 SdHoareTripleChecker+Invalid, 2060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 387 IncrementalHoareTripleChecker+Valid, 1672 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-07-13 23:03:41,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 2821 Invalid, 2060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [387 Valid, 1672 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2022-07-13 23:03:41,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16817 states. [2022-07-13 23:03:42,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16817 to 14948. [2022-07-13 23:03:42,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14948 states, 11026 states have (on average 1.250226736803918) internal successors, (13785), 11411 states have internal predecessors, (13785), 2623 states have call successors, (2623), 901 states have call predecessors, (2623), 1298 states have return successors, (5270), 2755 states have call predecessors, (5270), 2619 states have call successors, (5270) [2022-07-13 23:03:42,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14948 states to 14948 states and 21678 transitions. [2022-07-13 23:03:42,150 INFO L78 Accepts]: Start accepts. Automaton has 14948 states and 21678 transitions. Word has length 166 [2022-07-13 23:03:42,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:42,151 INFO L495 AbstractCegarLoop]: Abstraction has 14948 states and 21678 transitions. [2022-07-13 23:03:42,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 4 states have internal predecessors, (103), 3 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-13 23:03:42,151 INFO L276 IsEmpty]: Start isEmpty. Operand 14948 states and 21678 transitions. [2022-07-13 23:03:42,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-13 23:03:42,153 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:42,153 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:03:42,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 23:03:42,153 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:42,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:42,153 INFO L85 PathProgramCache]: Analyzing trace with hash 644781777, now seen corresponding path program 1 times [2022-07-13 23:03:42,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:03:42,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371352376] [2022-07-13 23:03:42,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:42,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:03:42,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:42,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:03:42,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:42,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:03:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:42,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 23:03:42,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:42,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:42,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:42,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:42,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:42,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 23:03:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:42,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 23:03:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:42,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 23:03:42,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:42,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 23:03:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:42,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 23:03:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:42,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 23:03:42,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:42,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 23:03:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:42,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 23:03:42,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:42,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 23:03:42,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:42,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:42,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:42,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:42,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 23:03:42,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:42,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-13 23:03:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:42,968 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-13 23:03:42,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:03:42,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371352376] [2022-07-13 23:03:42,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371352376] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:03:42,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793939651] [2022-07-13 23:03:42,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:42,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:03:42,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:03:42,971 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 23:03:42,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-13 23:03:44,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:44,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 3164 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-13 23:03:44,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:03:44,670 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 23:03:44,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-13 23:03:44,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 23:03:44,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 23:03:44,763 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 23:03:44,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-07-13 23:03:44,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 23:03:44,817 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 23:03:44,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-07-13 23:03:44,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 23:03:44,873 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 23:03:44,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-07-13 23:03:44,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 23:03:44,924 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 23:03:44,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-07-13 23:03:44,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 23:03:45,001 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 23:03:45,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-07-13 23:03:45,149 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 23:03:45,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-13 23:03:45,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-13 23:03:45,288 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-13 23:03:45,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 23:03:45,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-07-13 23:03:45,545 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_14166 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ttusb_dec_probe_ttusb_dec_init_usb_~dec#1.base| v_ArrVal_14166) |c_~#debug~0.base|) |c_~#debug~0.offset|) 0)) (= (select |c_old(#valid)| |c_~#debug~0.base|) 0)) is different from false [2022-07-13 23:03:45,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793939651] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:03:45,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 23:03:45,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 37 [2022-07-13 23:03:45,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765287944] [2022-07-13 23:03:45,557 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 23:03:45,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-13 23:03:45,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:03:45,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-13 23:03:45,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1355, Unknown=1, NotChecked=74, Total=1560 [2022-07-13 23:03:45,559 INFO L87 Difference]: Start difference. First operand 14948 states and 21678 transitions. Second operand has 37 states, 37 states have (on average 5.8108108108108105) internal successors, (215), 28 states have internal predecessors, (215), 16 states have call successors, (40), 10 states have call predecessors, (40), 12 states have return successors, (36), 17 states have call predecessors, (36), 15 states have call successors, (36) [2022-07-13 23:03:53,702 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:04:27,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:04:27,509 INFO L93 Difference]: Finished difference Result 55298 states and 92671 transitions. [2022-07-13 23:04:27,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2022-07-13 23:04:27,510 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 5.8108108108108105) internal successors, (215), 28 states have internal predecessors, (215), 16 states have call successors, (40), 10 states have call predecessors, (40), 12 states have return successors, (36), 17 states have call predecessors, (36), 15 states have call successors, (36) Word has length 163 [2022-07-13 23:04:27,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:04:27,700 INFO L225 Difference]: With dead ends: 55298 [2022-07-13 23:04:27,700 INFO L226 Difference]: Without dead ends: 40398 [2022-07-13 23:04:27,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 261 SyntacticMatches, 6 SemanticMatches, 169 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10323 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=2669, Invalid=26064, Unknown=1, NotChecked=336, Total=29070 [2022-07-13 23:04:27,767 INFO L413 NwaCegarLoop]: 1135 mSDtfsCounter, 7736 mSDsluCounter, 12864 mSDsCounter, 0 mSdLazyCounter, 36723 mSolverCounterSat, 4354 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7924 SdHoareTripleChecker+Valid, 13999 SdHoareTripleChecker+Invalid, 43779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4354 IncrementalHoareTripleChecker+Valid, 36723 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 2701 IncrementalHoareTripleChecker+Unchecked, 35.3s IncrementalHoareTripleChecker+Time [2022-07-13 23:04:27,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7924 Valid, 13999 Invalid, 43779 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4354 Valid, 36723 Invalid, 1 Unknown, 2701 Unchecked, 35.3s Time] [2022-07-13 23:04:27,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40398 states. [2022-07-13 23:04:29,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40398 to 35031. [2022-07-13 23:04:29,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35031 states, 25909 states have (on average 1.2407657570728319) internal successors, (32147), 26819 states have internal predecessors, (32147), 6055 states have call successors, (6055), 2074 states have call predecessors, (6055), 3066 states have return successors, (16476), 6302 states have call predecessors, (16476), 6051 states have call successors, (16476) [2022-07-13 23:04:29,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35031 states to 35031 states and 54678 transitions. [2022-07-13 23:04:29,773 INFO L78 Accepts]: Start accepts. Automaton has 35031 states and 54678 transitions. Word has length 163 [2022-07-13 23:04:29,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:04:29,774 INFO L495 AbstractCegarLoop]: Abstraction has 35031 states and 54678 transitions. [2022-07-13 23:04:29,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 5.8108108108108105) internal successors, (215), 28 states have internal predecessors, (215), 16 states have call successors, (40), 10 states have call predecessors, (40), 12 states have return successors, (36), 17 states have call predecessors, (36), 15 states have call successors, (36) [2022-07-13 23:04:29,774 INFO L276 IsEmpty]: Start isEmpty. Operand 35031 states and 54678 transitions. [2022-07-13 23:04:29,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-13 23:04:29,777 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:04:29,777 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:04:29,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-13 23:04:29,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:04:29,991 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:04:29,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:04:29,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1043495825, now seen corresponding path program 1 times [2022-07-13 23:04:29,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:04:29,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153969528] [2022-07-13 23:04:29,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:04:29,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:04:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:30,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:04:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:30,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:04:30,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:30,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 23:04:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:30,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:04:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:31,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:04:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:31,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 23:04:31,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:31,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 23:04:31,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:31,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 23:04:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:31,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 23:04:31,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:31,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 23:04:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:31,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 23:04:31,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:31,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 23:04:31,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:31,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 23:04:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:31,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 23:04:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:31,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:04:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:31,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:04:31,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:31,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 23:04:31,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:31,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-13 23:04:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:31,230 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-13 23:04:31,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:04:31,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153969528] [2022-07-13 23:04:31,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153969528] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:04:31,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31529883] [2022-07-13 23:04:31,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:04:31,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:04:31,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:04:31,236 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 23:04:31,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-13 23:04:32,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:32,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 3166 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-13 23:04:32,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:04:32,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-13 23:04:33,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 23:04:33,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 23:04:33,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 23:04:33,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 23:04:33,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 23:04:33,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 23:04:33,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 23:04:33,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 23:04:33,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:04:33,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 23:04:33,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-13 23:04:33,643 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-13 23:04:33,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 23:04:33,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31529883] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:04:33,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 23:04:33,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 36 [2022-07-13 23:04:33,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270634279] [2022-07-13 23:04:33,898 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 23:04:33,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-13 23:04:33,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:04:33,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-13 23:04:33,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1280, Unknown=10, NotChecked=0, Total=1406 [2022-07-13 23:04:33,900 INFO L87 Difference]: Start difference. First operand 35031 states and 54678 transitions. Second operand has 36 states, 36 states have (on average 5.583333333333333) internal successors, (201), 27 states have internal predecessors, (201), 16 states have call successors, (40), 10 states have call predecessors, (40), 12 states have return successors, (36), 17 states have call predecessors, (36), 16 states have call successors, (36) [2022-07-13 23:04:39,709 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:04:56,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:04:56,813 INFO L93 Difference]: Finished difference Result 74281 states and 119988 transitions. [2022-07-13 23:04:56,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-07-13 23:04:56,813 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 5.583333333333333) internal successors, (201), 27 states have internal predecessors, (201), 16 states have call successors, (40), 10 states have call predecessors, (40), 12 states have return successors, (36), 17 states have call predecessors, (36), 16 states have call successors, (36) Word has length 163 [2022-07-13 23:04:56,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:04:57,264 INFO L225 Difference]: With dead ends: 74281 [2022-07-13 23:04:57,264 INFO L226 Difference]: Without dead ends: 39415 [2022-07-13 23:04:57,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 234 SyntacticMatches, 5 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1445 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=556, Invalid=4975, Unknown=19, NotChecked=0, Total=5550 [2022-07-13 23:04:57,350 INFO L413 NwaCegarLoop]: 912 mSDtfsCounter, 3372 mSDsluCounter, 8141 mSDsCounter, 0 mSdLazyCounter, 14681 mSolverCounterSat, 1441 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3488 SdHoareTripleChecker+Valid, 9053 SdHoareTripleChecker+Invalid, 17007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1441 IncrementalHoareTripleChecker+Valid, 14681 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 884 IncrementalHoareTripleChecker+Unchecked, 19.8s IncrementalHoareTripleChecker+Time [2022-07-13 23:04:57,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3488 Valid, 9053 Invalid, 17007 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1441 Valid, 14681 Invalid, 1 Unknown, 884 Unchecked, 19.8s Time] [2022-07-13 23:04:57,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39415 states. [2022-07-13 23:04:59,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39415 to 35547. [2022-07-13 23:04:59,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35547 states, 26244 states have (on average 1.2385688157293095) internal successors, (32505), 27191 states have internal predecessors, (32505), 6122 states have call successors, (6122), 2131 states have call predecessors, (6122), 3180 states have return successors, (16636), 6389 states have call predecessors, (16636), 6118 states have call successors, (16636) [2022-07-13 23:04:59,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35547 states to 35547 states and 55263 transitions. [2022-07-13 23:04:59,315 INFO L78 Accepts]: Start accepts. Automaton has 35547 states and 55263 transitions. Word has length 163 [2022-07-13 23:04:59,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:04:59,315 INFO L495 AbstractCegarLoop]: Abstraction has 35547 states and 55263 transitions. [2022-07-13 23:04:59,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.583333333333333) internal successors, (201), 27 states have internal predecessors, (201), 16 states have call successors, (40), 10 states have call predecessors, (40), 12 states have return successors, (36), 17 states have call predecessors, (36), 16 states have call successors, (36) [2022-07-13 23:04:59,316 INFO L276 IsEmpty]: Start isEmpty. Operand 35547 states and 55263 transitions. [2022-07-13 23:04:59,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-13 23:04:59,319 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:04:59,319 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:04:59,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-13 23:04:59,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-13 23:04:59,548 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:04:59,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:04:59,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1685855098, now seen corresponding path program 1 times [2022-07-13 23:04:59,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:04:59,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036281035] [2022-07-13 23:04:59,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:04:59,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:04:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:59,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:04:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:59,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:04:59,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:59,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 23:04:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:59,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:04:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:59,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:04:59,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:59,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 23:04:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:59,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 23:04:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:59,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 23:04:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:59,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 23:04:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:59,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 23:04:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:59,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 23:04:59,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:59,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-13 23:04:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:59,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 23:04:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:59,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 23:04:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:59,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 23:04:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:59,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:04:59,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:59,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:04:59,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:59,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-13 23:04:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:59,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-13 23:04:59,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:59,895 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-13 23:04:59,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:04:59,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036281035] [2022-07-13 23:04:59,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036281035] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:04:59,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:04:59,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 23:04:59,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459353485] [2022-07-13 23:04:59,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:04:59,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 23:04:59,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:04:59,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 23:04:59,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-13 23:04:59,898 INFO L87 Difference]: Start difference. First operand 35547 states and 55263 transitions. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 4 states have internal predecessors, (107), 3 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-13 23:05:02,860 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:05:08,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:05:08,686 INFO L93 Difference]: Finished difference Result 74917 states and 129586 transitions. [2022-07-13 23:05:08,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 23:05:08,687 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 4 states have internal predecessors, (107), 3 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 166 [2022-07-13 23:05:08,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:05:08,868 INFO L225 Difference]: With dead ends: 74917 [2022-07-13 23:05:08,868 INFO L226 Difference]: Without dead ends: 39418 [2022-07-13 23:05:08,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-13 23:05:08,988 INFO L413 NwaCegarLoop]: 780 mSDtfsCounter, 615 mSDsluCounter, 1954 mSDsCounter, 0 mSdLazyCounter, 2275 mSolverCounterSat, 242 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 2734 SdHoareTripleChecker+Invalid, 2518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 2275 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-07-13 23:05:08,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [672 Valid, 2734 Invalid, 2518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 2275 Invalid, 1 Unknown, 0 Unchecked, 6.4s Time] [2022-07-13 23:05:09,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39418 states. [2022-07-13 23:05:10,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39418 to 35664. [2022-07-13 23:05:10,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35664 states, 26322 states have (on average 1.238203783906998) internal successors, (32592), 27269 states have internal predecessors, (32592), 6142 states have call successors, (6142), 2146 states have call predecessors, (6142), 3199 states have return successors, (16757), 6413 states have call predecessors, (16757), 6138 states have call successors, (16757) [2022-07-13 23:05:11,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35664 states to 35664 states and 55491 transitions. [2022-07-13 23:05:11,155 INFO L78 Accepts]: Start accepts. Automaton has 35664 states and 55491 transitions. Word has length 166 [2022-07-13 23:05:11,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:05:11,156 INFO L495 AbstractCegarLoop]: Abstraction has 35664 states and 55491 transitions. [2022-07-13 23:05:11,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 4 states have internal predecessors, (107), 3 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-13 23:05:11,156 INFO L276 IsEmpty]: Start isEmpty. Operand 35664 states and 55491 transitions. [2022-07-13 23:05:11,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-07-13 23:05:11,159 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:05:11,160 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:05:11,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-13 23:05:11,160 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:05:11,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:05:11,160 INFO L85 PathProgramCache]: Analyzing trace with hash -567852612, now seen corresponding path program 1 times [2022-07-13 23:05:11,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:05:11,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185419125] [2022-07-13 23:05:11,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:05:11,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:05:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:11,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:05:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:11,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:05:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:11,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 23:05:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:11,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:05:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:11,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:05:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:11,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 23:05:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:11,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 23:05:11,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:11,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 23:05:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:11,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 23:05:11,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:11,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:05:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:11,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 23:05:11,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:11,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 23:05:11,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:11,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 23:05:11,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:11,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-13 23:05:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:11,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 23:05:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:11,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:05:11,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:11,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:05:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:11,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-13 23:05:11,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:11,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-13 23:05:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:11,526 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-13 23:05:11,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:05:11,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185419125] [2022-07-13 23:05:11,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185419125] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:05:11,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:05:11,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 23:05:11,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956865113] [2022-07-13 23:05:11,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:05:11,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 23:05:11,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:05:11,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 23:05:11,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-13 23:05:11,528 INFO L87 Difference]: Start difference. First operand 35664 states and 55491 transitions. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 4 states have internal predecessors, (108), 3 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-13 23:05:14,362 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:05:19,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:05:19,056 INFO L93 Difference]: Finished difference Result 75104 states and 129848 transitions. [2022-07-13 23:05:19,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 23:05:19,057 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 4 states have internal predecessors, (108), 3 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 167 [2022-07-13 23:05:19,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:05:19,249 INFO L225 Difference]: With dead ends: 75104 [2022-07-13 23:05:19,249 INFO L226 Difference]: Without dead ends: 39488 [2022-07-13 23:05:19,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-13 23:05:19,387 INFO L413 NwaCegarLoop]: 761 mSDtfsCounter, 1659 mSDsluCounter, 1482 mSDsCounter, 0 mSdLazyCounter, 1600 mSolverCounterSat, 863 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1715 SdHoareTripleChecker+Valid, 2243 SdHoareTripleChecker+Invalid, 2464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 863 IncrementalHoareTripleChecker+Valid, 1600 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-07-13 23:05:19,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1715 Valid, 2243 Invalid, 2464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [863 Valid, 1600 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2022-07-13 23:05:19,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39488 states. [2022-07-13 23:05:21,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39488 to 35739. [2022-07-13 23:05:21,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35739 states, 26382 states have (on average 1.2376620423015692) internal successors, (32652), 27329 states have internal predecessors, (32652), 6142 states have call successors, (6142), 2161 states have call predecessors, (6142), 3214 states have return successors, (16757), 6413 states have call predecessors, (16757), 6138 states have call successors, (16757) [2022-07-13 23:05:21,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35739 states to 35739 states and 55551 transitions. [2022-07-13 23:05:21,748 INFO L78 Accepts]: Start accepts. Automaton has 35739 states and 55551 transitions. Word has length 167 [2022-07-13 23:05:21,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:05:21,748 INFO L495 AbstractCegarLoop]: Abstraction has 35739 states and 55551 transitions. [2022-07-13 23:05:21,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 4 states have internal predecessors, (108), 3 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-13 23:05:21,749 INFO L276 IsEmpty]: Start isEmpty. Operand 35739 states and 55551 transitions. [2022-07-13 23:05:21,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-07-13 23:05:21,752 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:05:21,752 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:05:21,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-13 23:05:21,752 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:05:21,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:05:21,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1184539208, now seen corresponding path program 1 times [2022-07-13 23:05:21,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:05:21,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400814562] [2022-07-13 23:05:21,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:05:21,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:05:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:22,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:05:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:22,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:05:22,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:22,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 23:05:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:22,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:05:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:22,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:05:22,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:22,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 23:05:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:22,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 23:05:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:22,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 23:05:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:22,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 23:05:22,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:22,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:05:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:22,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 23:05:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:22,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 23:05:22,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:22,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 23:05:22,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:22,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-13 23:05:22,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:22,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 23:05:22,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:22,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:05:22,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:22,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:05:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:22,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-13 23:05:22,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:22,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-13 23:05:22,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:22,688 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-13 23:05:22,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:05:22,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400814562] [2022-07-13 23:05:22,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400814562] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:05:22,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627708855] [2022-07-13 23:05:22,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:05:22,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:05:22,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:05:22,692 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 23:05:22,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-13 23:05:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:24,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 3214 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-13 23:05:24,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:05:24,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-13 23:05:24,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 23:05:24,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 23:05:24,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 23:05:24,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 23:05:24,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 23:05:24,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 23:05:24,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 23:05:25,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 23:05:25,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:05:25,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 23:05:25,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-13 23:05:25,327 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-13 23:05:25,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 23:05:25,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627708855] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:05:25,606 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 23:05:25,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 42 [2022-07-13 23:05:25,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272395062] [2022-07-13 23:05:25,607 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 23:05:25,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-13 23:05:25,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:05:25,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-13 23:05:25,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1717, Unknown=24, NotChecked=0, Total=1892 [2022-07-13 23:05:25,609 INFO L87 Difference]: Start difference. First operand 35739 states and 55551 transitions. Second operand has 42 states, 42 states have (on average 4.904761904761905) internal successors, (206), 29 states have internal predecessors, (206), 14 states have call successors, (42), 12 states have call predecessors, (42), 14 states have return successors, (38), 17 states have call predecessors, (38), 14 states have call successors, (38)