./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1848e360a16ec6531e7d7aea690ab68ac7295c6b0bdec191a41fa9ee0518b66d --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 10:57:30,220 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 10:57:30,221 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 10:57:30,244 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 10:57:30,244 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 10:57:30,245 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 10:57:30,246 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 10:57:30,247 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 10:57:30,248 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 10:57:30,249 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 10:57:30,250 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 10:57:30,251 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 10:57:30,251 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 10:57:30,252 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 10:57:30,252 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 10:57:30,253 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 10:57:30,254 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 10:57:30,254 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 10:57:30,255 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 10:57:30,257 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 10:57:30,257 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 10:57:30,258 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 10:57:30,259 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 10:57:30,260 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 10:57:30,260 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 10:57:30,262 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 10:57:30,262 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 10:57:30,262 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 10:57:30,263 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 10:57:30,263 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 10:57:30,264 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 10:57:30,264 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 10:57:30,265 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 10:57:30,265 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 10:57:30,266 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 10:57:30,266 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 10:57:30,267 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 10:57:30,267 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 10:57:30,267 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 10:57:30,268 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 10:57:30,268 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 10:57:30,269 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 10:57:30,270 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-21 10:57:30,284 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 10:57:30,284 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 10:57:30,284 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 10:57:30,285 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 10:57:30,285 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 10:57:30,285 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 10:57:30,286 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 10:57:30,286 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 10:57:30,286 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 10:57:30,286 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 10:57:30,287 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 10:57:30,287 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 10:57:30,287 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 10:57:30,287 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 10:57:30,287 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 10:57:30,287 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 10:57:30,288 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 10:57:30,288 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 10:57:30,288 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 10:57:30,288 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 10:57:30,288 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 10:57:30,289 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 10:57:30,289 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 10:57:30,289 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 10:57:30,289 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 10:57:30,289 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 10:57:30,289 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 10:57:30,290 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 10:57:30,290 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 10:57:30,290 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 10:57:30,290 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 -> 1848e360a16ec6531e7d7aea690ab68ac7295c6b0bdec191a41fa9ee0518b66d [2022-07-21 10:57:30,547 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 10:57:30,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 10:57:30,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 10:57:30,573 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 10:57:30,573 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 10:57:30,574 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-entry_point.cil.out.i [2022-07-21 10:57:30,619 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7982e05e5/bdbfbcf85f6d4ca6b0546cd4ad34522e/FLAG5919aaeed [2022-07-21 10:57:31,244 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 10:57:31,244 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-entry_point.cil.out.i [2022-07-21 10:57:31,269 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7982e05e5/bdbfbcf85f6d4ca6b0546cd4ad34522e/FLAG5919aaeed [2022-07-21 10:57:31,405 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7982e05e5/bdbfbcf85f6d4ca6b0546cd4ad34522e [2022-07-21 10:57:31,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 10:57:31,408 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 10:57:31,410 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 10:57:31,410 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 10:57:31,412 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 10:57:31,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 10:57:31" (1/1) ... [2022-07-21 10:57:31,413 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@114a08d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:57:31, skipping insertion in model container [2022-07-21 10:57:31,414 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 10:57:31" (1/1) ... [2022-07-21 10:57:31,418 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 10:57:31,498 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 10:57:32,225 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-entry_point.cil.out.i[196736,196749] [2022-07-21 10:57:32,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 10:57:32,695 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 10:57:32,822 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-entry_point.cil.out.i[196736,196749] [2022-07-21 10:57:33,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 10:57:33,065 INFO L208 MainTranslator]: Completed translation [2022-07-21 10:57:33,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:57:33 WrapperNode [2022-07-21 10:57:33,067 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 10:57:33,068 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 10:57:33,068 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 10:57:33,068 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 10:57:33,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:57:33" (1/1) ... [2022-07-21 10:57:33,128 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:57:33" (1/1) ... [2022-07-21 10:57:33,224 INFO L137 Inliner]: procedures = 201, calls = 1494, calls flagged for inlining = 91, calls inlined = 86, statements flattened = 2632 [2022-07-21 10:57:33,224 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 10:57:33,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 10:57:33,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 10:57:33,225 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 10:57:33,231 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:57:33" (1/1) ... [2022-07-21 10:57:33,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:57:33" (1/1) ... [2022-07-21 10:57:33,256 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:57:33" (1/1) ... [2022-07-21 10:57:33,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:57:33" (1/1) ... [2022-07-21 10:57:33,310 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:57:33" (1/1) ... [2022-07-21 10:57:33,319 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:57:33" (1/1) ... [2022-07-21 10:57:33,378 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:57:33" (1/1) ... [2022-07-21 10:57:33,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 10:57:33,420 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 10:57:33,420 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 10:57:33,421 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 10:57:33,421 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:57:33" (1/1) ... [2022-07-21 10:57:33,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 10:57:33,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 10:57:33,477 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-21 10:57:33,504 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-21 10:57:33,519 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2022-07-21 10:57:33,520 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2022-07-21 10:57:33,520 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_free_iso_urbs [2022-07-21 10:57:33,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_free_iso_urbs [2022-07-21 10:57:33,520 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_12 [2022-07-21 10:57:33,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_12 [2022-07-21 10:57:33,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-21 10:57:33,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-21 10:57:33,521 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-21 10:57:33,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-21 10:57:33,521 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_init_dvb [2022-07-21 10:57:33,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_init_dvb [2022-07-21 10:57:33,521 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_interface [2022-07-21 10:57:33,521 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_interface [2022-07-21 10:57:33,521 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2022-07-21 10:57:33,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2022-07-21 10:57:33,522 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_unregister_adapter [2022-07-21 10:57:33,522 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_unregister_adapter [2022-07-21 10:57:33,522 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-21 10:57:33,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-21 10:57:33,522 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_start_sec_feed [2022-07-21 10:57:33,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_start_sec_feed [2022-07-21 10:57:33,522 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2022-07-21 10:57:33,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2022-07-21 10:57:33,522 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_interruptible_nested [2022-07-21 10:57:33,523 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_interruptible_nested [2022-07-21 10:57:33,523 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_start_iso_xfer [2022-07-21 10:57:33,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_start_iso_xfer [2022-07-21 10:57:33,523 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-21 10:57:33,523 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-21 10:57:33,523 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-21 10:57:33,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-21 10:57:33,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-21 10:57:33,523 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-21 10:57:33,524 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-21 10:57:33,524 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-21 10:57:33,524 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_dmx_release [2022-07-21 10:57:33,524 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_dmx_release [2022-07-21 10:57:33,524 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2022-07-21 10:57:33,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2022-07-21 10:57:33,524 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-21 10:57:33,524 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-21 10:57:33,524 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_process_urb [2022-07-21 10:57:33,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_process_urb [2022-07-21 10:57:33,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 10:57:33,525 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2022-07-21 10:57:33,525 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2022-07-21 10:57:33,525 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-07-21 10:57:33,525 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-07-21 10:57:33,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 10:57:33,525 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-21 10:57:33,526 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-21 10:57:33,526 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_start_feed [2022-07-21 10:57:33,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_start_feed [2022-07-21 10:57:33,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 10:57:33,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 10:57:33,526 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_probe [2022-07-21 10:57:33,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_probe [2022-07-21 10:57:33,526 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2022-07-21 10:57:33,526 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2022-07-21 10:57:33,527 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2022-07-21 10:57:33,527 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2022-07-21 10:57:33,527 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_start_ts_feed [2022-07-21 10:57:33,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_start_ts_feed [2022-07-21 10:57:33,527 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-21 10:57:33,527 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-21 10:57:33,527 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-21 10:57:33,527 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-21 10:57:33,528 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-07-21 10:57:33,528 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-07-21 10:57:33,528 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_exit_dvb [2022-07-21 10:57:33,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_exit_dvb [2022-07-21 10:57:33,528 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2022-07-21 10:57:33,528 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2022-07-21 10:57:33,528 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_set_model [2022-07-21 10:57:33,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_set_model [2022-07-21 10:57:33,528 INFO L130 BoogieDeclarations]: Found specification of procedure release_firmware [2022-07-21 10:57:33,529 INFO L138 BoogieDeclarations]: Found implementation of procedure release_firmware [2022-07-21 10:57:33,529 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_key [2022-07-21 10:57:33,529 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_key [2022-07-21 10:57:33,529 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_stop_iso_xfer [2022-07-21 10:57:33,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_stop_iso_xfer [2022-07-21 10:57:33,529 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_filter_pes2ts_init [2022-07-21 10:57:33,529 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_filter_pes2ts_init [2022-07-21 10:57:33,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-21 10:57:33,529 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-21 10:57:33,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-21 10:57:33,530 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2022-07-21 10:57:33,530 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2022-07-21 10:57:33,530 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-21 10:57:33,530 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-21 10:57:33,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-21 10:57:33,530 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_3 [2022-07-21 10:57:33,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_3 [2022-07-21 10:57:33,530 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_4 [2022-07-21 10:57:33,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_4 [2022-07-21 10:57:33,531 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_2 [2022-07-21 10:57:33,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_2 [2022-07-21 10:57:33,531 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_7 [2022-07-21 10:57:33,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_7 [2022-07-21 10:57:33,531 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~X~$Pointer$~X~int~TO~int [2022-07-21 10:57:33,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~X~$Pointer$~X~int~TO~int [2022-07-21 10:57:33,531 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2022-07-21 10:57:33,531 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2022-07-21 10:57:33,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 10:57:33,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-21 10:57:33,532 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-21 10:57:33,532 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-21 10:57:33,532 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-21 10:57:33,532 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-21 10:57:33,532 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-21 10:57:33,532 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-21 10:57:33,532 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-21 10:57:33,533 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2022-07-21 10:57:33,533 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2022-07-21 10:57:33,533 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_send_command [2022-07-21 10:57:33,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_send_command [2022-07-21 10:57:33,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 10:57:33,533 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_setup_urbs [2022-07-21 10:57:33,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_setup_urbs [2022-07-21 10:57:33,533 INFO L130 BoogieDeclarations]: Found specification of procedure input_sync [2022-07-21 10:57:33,534 INFO L138 BoogieDeclarations]: Found implementation of procedure input_sync [2022-07-21 10:57:33,534 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-21 10:57:33,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-21 10:57:33,534 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_set_pids [2022-07-21 10:57:33,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_set_pids [2022-07-21 10:57:33,534 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_exit_usb [2022-07-21 10:57:33,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_exit_usb [2022-07-21 10:57:33,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 10:57:33,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 10:57:33,535 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-21 10:57:33,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-21 10:57:33,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 10:57:33,535 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-21 10:57:33,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-21 10:57:33,535 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-21 10:57:33,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-21 10:57:33,535 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_init_rc [2022-07-21 10:57:33,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_init_rc [2022-07-21 10:57:33,536 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_dmxdev_release [2022-07-21 10:57:33,536 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_dmxdev_release [2022-07-21 10:57:33,536 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-21 10:57:33,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-21 10:57:33,536 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_disconnect [2022-07-21 10:57:33,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_disconnect [2022-07-21 10:57:33,536 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_handle_irq [2022-07-21 10:57:33,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_handle_irq [2022-07-21 10:57:33,536 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2022-07-21 10:57:33,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2022-07-21 10:57:33,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 10:57:33,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 10:57:33,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 10:57:34,023 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 10:57:34,025 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 10:57:34,250 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-21 10:57:38,053 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2022-07-21 10:57:38,280 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 10:57:38,297 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 10:57:38,297 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 10:57:38,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 10:57:38 BoogieIcfgContainer [2022-07-21 10:57:38,300 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 10:57:38,302 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 10:57:38,303 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 10:57:38,304 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 10:57:38,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 10:57:31" (1/3) ... [2022-07-21 10:57:38,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dbb0e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 10:57:38, skipping insertion in model container [2022-07-21 10:57:38,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:57:33" (2/3) ... [2022-07-21 10:57:38,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dbb0e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 10:57:38, skipping insertion in model container [2022-07-21 10:57:38,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 10:57:38" (3/3) ... [2022-07-21 10:57:38,307 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-entry_point.cil.out.i [2022-07-21 10:57:38,316 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 10:57:38,316 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 10:57:38,386 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 10:57:38,392 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@3c484862, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@152852ea [2022-07-21 10:57:38,392 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 10:57:38,401 INFO L276 IsEmpty]: Start isEmpty. Operand has 1076 states, 777 states have (on average 1.3384813384813385) internal successors, (1040), 804 states have internal predecessors, (1040), 231 states have call successors, (231), 68 states have call predecessors, (231), 66 states have return successors, (225), 217 states have call predecessors, (225), 225 states have call successors, (225) [2022-07-21 10:57:38,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-21 10:57:38,410 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:57:38,410 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 10:57:38,411 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:57:38,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:57:38,415 INFO L85 PathProgramCache]: Analyzing trace with hash 303000669, now seen corresponding path program 1 times [2022-07-21 10:57:38,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:57:38,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268948364] [2022-07-21 10:57:38,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:57:38,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:57:38,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:38,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:57:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:38,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:57:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:38,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:57:38,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:38,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:57:38,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:38,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 10:57:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:38,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 10:57:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:39,011 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-21 10:57:39,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:57:39,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268948364] [2022-07-21 10:57:39,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268948364] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:57:39,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:57:39,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 10:57:39,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920148891] [2022-07-21 10:57:39,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:57:39,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 10:57:39,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:57:39,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 10:57:39,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 10:57:39,051 INFO L87 Difference]: Start difference. First operand has 1076 states, 777 states have (on average 1.3384813384813385) internal successors, (1040), 804 states have internal predecessors, (1040), 231 states have call successors, (231), 68 states have call predecessors, (231), 66 states have return successors, (225), 217 states have call predecessors, (225), 225 states have call successors, (225) Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-21 10:57:42,337 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-21 10:57:46,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:57:46,455 INFO L93 Difference]: Finished difference Result 3572 states and 5251 transitions. [2022-07-21 10:57:46,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 10:57:46,457 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 52 [2022-07-21 10:57:46,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:57:46,515 INFO L225 Difference]: With dead ends: 3572 [2022-07-21 10:57:46,516 INFO L226 Difference]: Without dead ends: 2475 [2022-07-21 10:57:46,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-21 10:57:46,533 INFO L413 NwaCegarLoop]: 1640 mSDtfsCounter, 2974 mSDsluCounter, 2365 mSDsCounter, 0 mSdLazyCounter, 1917 mSolverCounterSat, 1419 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3137 SdHoareTripleChecker+Valid, 4005 SdHoareTripleChecker+Invalid, 3337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1419 IncrementalHoareTripleChecker+Valid, 1917 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-07-21 10:57:46,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3137 Valid, 4005 Invalid, 3337 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1419 Valid, 1917 Invalid, 1 Unknown, 0 Unchecked, 7.0s Time] [2022-07-21 10:57:46,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2022-07-21 10:57:46,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 2044. [2022-07-21 10:57:46,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2044 states, 1490 states have (on average 1.3187919463087248) internal successors, (1965), 1524 states have internal predecessors, (1965), 424 states have call successors, (424), 130 states have call predecessors, (424), 129 states have return successors, (419), 403 states have call predecessors, (419), 419 states have call successors, (419) [2022-07-21 10:57:46,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 2808 transitions. [2022-07-21 10:57:46,706 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 2808 transitions. Word has length 52 [2022-07-21 10:57:46,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:57:46,707 INFO L495 AbstractCegarLoop]: Abstraction has 2044 states and 2808 transitions. [2022-07-21 10:57:46,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-21 10:57:46,707 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 2808 transitions. [2022-07-21 10:57:46,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-21 10:57:46,714 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:57:46,714 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 10:57:46,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 10:57:46,715 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:57:46,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:57:46,715 INFO L85 PathProgramCache]: Analyzing trace with hash 2056314414, now seen corresponding path program 1 times [2022-07-21 10:57:46,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:57:46,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902691491] [2022-07-21 10:57:46,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:57:46,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:57:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:46,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:57:46,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:46,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:57:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:46,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:57:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:46,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:57:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:46,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 10:57:46,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:46,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 10:57:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:46,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 10:57:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:46,978 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-21 10:57:46,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:57:46,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902691491] [2022-07-21 10:57:46,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902691491] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:57:46,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:57:46,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 10:57:46,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506895991] [2022-07-21 10:57:46,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:57:46,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 10:57:46,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:57:46,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 10:57:46,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 10:57:46,984 INFO L87 Difference]: Start difference. First operand 2044 states and 2808 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-21 10:57:49,520 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 10:57:53,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:57:53,183 INFO L93 Difference]: Finished difference Result 3656 states and 5220 transitions. [2022-07-21 10:57:53,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 10:57:53,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 62 [2022-07-21 10:57:53,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:57:53,201 INFO L225 Difference]: With dead ends: 3656 [2022-07-21 10:57:53,201 INFO L226 Difference]: Without dead ends: 3643 [2022-07-21 10:57:53,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-21 10:57:53,205 INFO L413 NwaCegarLoop]: 1544 mSDtfsCounter, 3008 mSDsluCounter, 2209 mSDsCounter, 0 mSdLazyCounter, 1821 mSolverCounterSat, 1407 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3180 SdHoareTripleChecker+Valid, 3753 SdHoareTripleChecker+Invalid, 3229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1407 IncrementalHoareTripleChecker+Valid, 1821 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-07-21 10:57:53,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3180 Valid, 3753 Invalid, 3229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1407 Valid, 1821 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2022-07-21 10:57:53,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3643 states. [2022-07-21 10:57:53,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3643 to 2986. [2022-07-21 10:57:53,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2986 states, 2174 states have (on average 1.3164673413063477) internal successors, (2862), 2223 states have internal predecessors, (2862), 619 states have call successors, (619), 193 states have call predecessors, (619), 192 states have return successors, (614), 590 states have call predecessors, (614), 614 states have call successors, (614) [2022-07-21 10:57:53,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2986 states to 2986 states and 4095 transitions. [2022-07-21 10:57:53,310 INFO L78 Accepts]: Start accepts. Automaton has 2986 states and 4095 transitions. Word has length 62 [2022-07-21 10:57:53,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:57:53,311 INFO L495 AbstractCegarLoop]: Abstraction has 2986 states and 4095 transitions. [2022-07-21 10:57:53,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-21 10:57:53,311 INFO L276 IsEmpty]: Start isEmpty. Operand 2986 states and 4095 transitions. [2022-07-21 10:57:53,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-21 10:57:53,313 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:57:53,314 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 10:57:53,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 10:57:53,314 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:57:53,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:57:53,315 INFO L85 PathProgramCache]: Analyzing trace with hash 2113572716, now seen corresponding path program 1 times [2022-07-21 10:57:53,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:57:53,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366794058] [2022-07-21 10:57:53,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:57:53,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:57:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:53,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:57:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:53,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:57:53,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:53,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:57:53,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:53,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:57:53,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:53,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 10:57:53,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:53,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 10:57:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:53,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 10:57:53,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:53,584 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-21 10:57:53,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:57:53,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366794058] [2022-07-21 10:57:53,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366794058] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:57:53,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:57:53,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 10:57:53,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282372152] [2022-07-21 10:57:53,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:57:53,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 10:57:53,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:57:53,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 10:57:53,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 10:57:53,589 INFO L87 Difference]: Start difference. First operand 2986 states and 4095 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-21 10:57:56,116 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-21 10:58:00,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:58:00,731 INFO L93 Difference]: Finished difference Result 10161 states and 14863 transitions. [2022-07-21 10:58:00,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 10:58:00,731 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 62 [2022-07-21 10:58:00,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:58:00,780 INFO L225 Difference]: With dead ends: 10161 [2022-07-21 10:58:00,780 INFO L226 Difference]: Without dead ends: 7197 [2022-07-21 10:58:00,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-21 10:58:00,802 INFO L413 NwaCegarLoop]: 1664 mSDtfsCounter, 3017 mSDsluCounter, 2466 mSDsCounter, 0 mSdLazyCounter, 1929 mSolverCounterSat, 1392 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3156 SdHoareTripleChecker+Valid, 4130 SdHoareTripleChecker+Invalid, 3322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1392 IncrementalHoareTripleChecker+Valid, 1929 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-07-21 10:58:00,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3156 Valid, 4130 Invalid, 3322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1392 Valid, 1929 Invalid, 1 Unknown, 0 Unchecked, 6.8s Time] [2022-07-21 10:58:00,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7197 states. [2022-07-21 10:58:01,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7197 to 6331. [2022-07-21 10:58:01,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6331 states, 4588 states have (on average 1.305797733217088) internal successors, (5991), 4709 states have internal predecessors, (5991), 1263 states have call successors, (1263), 383 states have call predecessors, (1263), 479 states have return successors, (1666), 1274 states have call predecessors, (1666), 1258 states have call successors, (1666) [2022-07-21 10:58:01,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6331 states to 6331 states and 8920 transitions. [2022-07-21 10:58:01,109 INFO L78 Accepts]: Start accepts. Automaton has 6331 states and 8920 transitions. Word has length 62 [2022-07-21 10:58:01,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:58:01,109 INFO L495 AbstractCegarLoop]: Abstraction has 6331 states and 8920 transitions. [2022-07-21 10:58:01,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-21 10:58:01,109 INFO L276 IsEmpty]: Start isEmpty. Operand 6331 states and 8920 transitions. [2022-07-21 10:58:01,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-21 10:58:01,111 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:58:01,111 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 10:58:01,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 10:58:01,112 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:58:01,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:58:01,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1095762274, now seen corresponding path program 1 times [2022-07-21 10:58:01,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:58:01,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845673568] [2022-07-21 10:58:01,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:58:01,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:58:01,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:01,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:58:01,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:01,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:58:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:01,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:58:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:01,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:58:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:01,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 10:58:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:01,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 10:58:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:01,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 10:58:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:01,376 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-21 10:58:01,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:58:01,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845673568] [2022-07-21 10:58:01,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845673568] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:58:01,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:58:01,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 10:58:01,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413807257] [2022-07-21 10:58:01,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:58:01,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 10:58:01,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:58:01,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 10:58:01,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 10:58:01,381 INFO L87 Difference]: Start difference. First operand 6331 states and 8920 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-21 10:58:03,987 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-21 10:58:08,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:58:08,274 INFO L93 Difference]: Finished difference Result 7186 states and 10506 transitions. [2022-07-21 10:58:08,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 10:58:08,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 63 [2022-07-21 10:58:08,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:58:08,308 INFO L225 Difference]: With dead ends: 7186 [2022-07-21 10:58:08,308 INFO L226 Difference]: Without dead ends: 7183 [2022-07-21 10:58:08,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-21 10:58:08,315 INFO L413 NwaCegarLoop]: 1523 mSDtfsCounter, 2984 mSDsluCounter, 2165 mSDsCounter, 0 mSdLazyCounter, 1822 mSolverCounterSat, 1404 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3149 SdHoareTripleChecker+Valid, 3688 SdHoareTripleChecker+Invalid, 3227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1404 IncrementalHoareTripleChecker+Valid, 1822 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-07-21 10:58:08,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3149 Valid, 3688 Invalid, 3227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1404 Valid, 1822 Invalid, 1 Unknown, 0 Unchecked, 6.6s Time] [2022-07-21 10:58:08,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7183 states. [2022-07-21 10:58:08,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7183 to 6330. [2022-07-21 10:58:08,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6330 states, 4588 states have (on average 1.3055797733217087) internal successors, (5990), 4708 states have internal predecessors, (5990), 1262 states have call successors, (1262), 383 states have call predecessors, (1262), 479 states have return successors, (1666), 1274 states have call predecessors, (1666), 1258 states have call successors, (1666) [2022-07-21 10:58:08,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6330 states to 6330 states and 8918 transitions. [2022-07-21 10:58:08,540 INFO L78 Accepts]: Start accepts. Automaton has 6330 states and 8918 transitions. Word has length 63 [2022-07-21 10:58:08,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:58:08,542 INFO L495 AbstractCegarLoop]: Abstraction has 6330 states and 8918 transitions. [2022-07-21 10:58:08,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-21 10:58:08,543 INFO L276 IsEmpty]: Start isEmpty. Operand 6330 states and 8918 transitions. [2022-07-21 10:58:08,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-21 10:58:08,544 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:58:08,544 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 10:58:08,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 10:58:08,544 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:58:08,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:58:08,545 INFO L85 PathProgramCache]: Analyzing trace with hash -391585489, now seen corresponding path program 1 times [2022-07-21 10:58:08,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:58:08,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078337869] [2022-07-21 10:58:08,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:58:08,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:58:08,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:08,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:58:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:08,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:58:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:08,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:58:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:08,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:58:08,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:08,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 10:58:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:08,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 10:58:08,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:08,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 10:58:08,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:08,800 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-21 10:58:08,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:58:08,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078337869] [2022-07-21 10:58:08,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078337869] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:58:08,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:58:08,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 10:58:08,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321076861] [2022-07-21 10:58:08,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:58:08,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 10:58:08,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:58:08,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 10:58:08,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 10:58:08,804 INFO L87 Difference]: Start difference. First operand 6330 states and 8918 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-21 10:58:11,344 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-21 10:58:15,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:58:15,419 INFO L93 Difference]: Finished difference Result 7185 states and 10504 transitions. [2022-07-21 10:58:15,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 10:58:15,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 64 [2022-07-21 10:58:15,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:58:15,482 INFO L225 Difference]: With dead ends: 7185 [2022-07-21 10:58:15,483 INFO L226 Difference]: Without dead ends: 7182 [2022-07-21 10:58:15,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-21 10:58:15,484 INFO L413 NwaCegarLoop]: 1532 mSDtfsCounter, 2981 mSDsluCounter, 2164 mSDsCounter, 0 mSdLazyCounter, 1821 mSolverCounterSat, 1404 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3142 SdHoareTripleChecker+Valid, 3696 SdHoareTripleChecker+Invalid, 3226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1404 IncrementalHoareTripleChecker+Valid, 1821 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-07-21 10:58:15,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3142 Valid, 3696 Invalid, 3226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1404 Valid, 1821 Invalid, 1 Unknown, 0 Unchecked, 6.3s Time] [2022-07-21 10:58:15,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7182 states. [2022-07-21 10:58:15,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7182 to 6329. [2022-07-21 10:58:15,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6329 states, 4588 states have (on average 1.3053618134263296) internal successors, (5989), 4707 states have internal predecessors, (5989), 1261 states have call successors, (1261), 383 states have call predecessors, (1261), 479 states have return successors, (1666), 1274 states have call predecessors, (1666), 1258 states have call successors, (1666) [2022-07-21 10:58:15,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6329 states to 6329 states and 8916 transitions. [2022-07-21 10:58:15,667 INFO L78 Accepts]: Start accepts. Automaton has 6329 states and 8916 transitions. Word has length 64 [2022-07-21 10:58:15,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:58:15,667 INFO L495 AbstractCegarLoop]: Abstraction has 6329 states and 8916 transitions. [2022-07-21 10:58:15,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-21 10:58:15,667 INFO L276 IsEmpty]: Start isEmpty. Operand 6329 states and 8916 transitions. [2022-07-21 10:58:15,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-21 10:58:15,668 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:58:15,668 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 10:58:15,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 10:58:15,668 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:58:15,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:58:15,669 INFO L85 PathProgramCache]: Analyzing trace with hash 745278981, now seen corresponding path program 1 times [2022-07-21 10:58:15,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:58:15,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105396012] [2022-07-21 10:58:15,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:58:15,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:58:15,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:15,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:58:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:15,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:58:15,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:15,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:58:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:15,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:58:15,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:15,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 10:58:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:15,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 10:58:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:15,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 10:58:15,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:15,839 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-21 10:58:15,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:58:15,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105396012] [2022-07-21 10:58:15,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105396012] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:58:15,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:58:15,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 10:58:15,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022333523] [2022-07-21 10:58:15,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:58:15,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 10:58:15,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:58:15,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 10:58:15,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 10:58:15,841 INFO L87 Difference]: Start difference. First operand 6329 states and 8916 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-21 10:58:18,324 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-21 10:58:22,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:58:22,277 INFO L93 Difference]: Finished difference Result 7184 states and 10502 transitions. [2022-07-21 10:58:22,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 10:58:22,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 65 [2022-07-21 10:58:22,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:58:22,317 INFO L225 Difference]: With dead ends: 7184 [2022-07-21 10:58:22,317 INFO L226 Difference]: Without dead ends: 7181 [2022-07-21 10:58:22,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-21 10:58:22,322 INFO L413 NwaCegarLoop]: 1513 mSDtfsCounter, 2999 mSDsluCounter, 2159 mSDsCounter, 0 mSdLazyCounter, 1818 mSolverCounterSat, 1409 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3163 SdHoareTripleChecker+Valid, 3672 SdHoareTripleChecker+Invalid, 3228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1409 IncrementalHoareTripleChecker+Valid, 1818 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-07-21 10:58:22,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3163 Valid, 3672 Invalid, 3228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1409 Valid, 1818 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2022-07-21 10:58:22,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7181 states. [2022-07-21 10:58:22,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7181 to 6328. [2022-07-21 10:58:22,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6328 states, 4588 states have (on average 1.3051438535309503) internal successors, (5988), 4706 states have internal predecessors, (5988), 1260 states have call successors, (1260), 383 states have call predecessors, (1260), 479 states have return successors, (1666), 1274 states have call predecessors, (1666), 1258 states have call successors, (1666) [2022-07-21 10:58:22,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6328 states to 6328 states and 8914 transitions. [2022-07-21 10:58:22,513 INFO L78 Accepts]: Start accepts. Automaton has 6328 states and 8914 transitions. Word has length 65 [2022-07-21 10:58:22,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:58:22,514 INFO L495 AbstractCegarLoop]: Abstraction has 6328 states and 8914 transitions. [2022-07-21 10:58:22,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-21 10:58:22,515 INFO L276 IsEmpty]: Start isEmpty. Operand 6328 states and 8914 transitions. [2022-07-21 10:58:22,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-21 10:58:22,515 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:58:22,515 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 10:58:22,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 10:58:22,516 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:58:22,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:58:22,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1628344050, now seen corresponding path program 1 times [2022-07-21 10:58:22,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:58:22,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366296881] [2022-07-21 10:58:22,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:58:22,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:58:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:22,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:58:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:22,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:58:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:22,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:58:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:22,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:58:22,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:22,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 10:58:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:22,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 10:58:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:22,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 10:58:22,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:22,734 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-21 10:58:22,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:58:22,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366296881] [2022-07-21 10:58:22,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366296881] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:58:22,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:58:22,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 10:58:22,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294590086] [2022-07-21 10:58:22,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:58:22,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 10:58:22,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:58:22,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 10:58:22,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 10:58:22,736 INFO L87 Difference]: Start difference. First operand 6328 states and 8914 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-21 10:58:25,210 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 10:58:29,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:58:29,543 INFO L93 Difference]: Finished difference Result 7183 states and 10500 transitions. [2022-07-21 10:58:29,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 10:58:29,543 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 66 [2022-07-21 10:58:29,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:58:29,597 INFO L225 Difference]: With dead ends: 7183 [2022-07-21 10:58:29,597 INFO L226 Difference]: Without dead ends: 7171 [2022-07-21 10:58:29,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-21 10:58:29,618 INFO L413 NwaCegarLoop]: 1520 mSDtfsCounter, 2976 mSDsluCounter, 2169 mSDsCounter, 0 mSdLazyCounter, 1819 mSolverCounterSat, 1401 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3137 SdHoareTripleChecker+Valid, 3689 SdHoareTripleChecker+Invalid, 3221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1401 IncrementalHoareTripleChecker+Valid, 1819 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-07-21 10:58:29,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3137 Valid, 3689 Invalid, 3221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1401 Valid, 1819 Invalid, 1 Unknown, 0 Unchecked, 6.5s Time] [2022-07-21 10:58:29,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7171 states. [2022-07-21 10:58:29,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7171 to 6318. [2022-07-21 10:58:29,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6318 states, 4579 states have (on average 1.305088447259227) internal successors, (5976), 4696 states have internal predecessors, (5976), 1259 states have call successors, (1259), 383 states have call predecessors, (1259), 479 states have return successors, (1666), 1274 states have call predecessors, (1666), 1258 states have call successors, (1666) [2022-07-21 10:58:29,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6318 states to 6318 states and 8901 transitions. [2022-07-21 10:58:29,836 INFO L78 Accepts]: Start accepts. Automaton has 6318 states and 8901 transitions. Word has length 66 [2022-07-21 10:58:29,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:58:29,836 INFO L495 AbstractCegarLoop]: Abstraction has 6318 states and 8901 transitions. [2022-07-21 10:58:29,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-21 10:58:29,837 INFO L276 IsEmpty]: Start isEmpty. Operand 6318 states and 8901 transitions. [2022-07-21 10:58:29,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-07-21 10:58:29,845 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:58:29,846 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 10:58:29,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 10:58:29,846 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:58:29,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:58:29,846 INFO L85 PathProgramCache]: Analyzing trace with hash -878887734, now seen corresponding path program 1 times [2022-07-21 10:58:29,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:58:29,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370441279] [2022-07-21 10:58:29,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:58:29,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:58:29,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:29,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:58:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:29,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:58:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:29,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:58:29,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:29,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:58:29,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:29,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 10:58:29,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:29,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 10:58:29,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:30,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 10:58:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:30,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 10:58:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:30,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 10:58:30,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:30,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:58:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:30,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:58:30,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:30,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 10:58:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:30,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 10:58:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:30,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 10:58:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:30,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 10:58:30,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:30,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 10:58:30,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:30,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 10:58:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:30,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 10:58:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:30,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 10:58:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:30,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 10:58:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:30,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:58:30,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:30,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 10:58:30,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:30,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-21 10:58:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:30,176 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-21 10:58:30,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:58:30,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370441279] [2022-07-21 10:58:30,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370441279] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:58:30,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:58:30,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 10:58:30,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360859523] [2022-07-21 10:58:30,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:58:30,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 10:58:30,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:58:30,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 10:58:30,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-21 10:58:30,178 INFO L87 Difference]: Start difference. First operand 6318 states and 8901 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (24), 8 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-21 10:58:33,289 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-21 10:58:37,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:58:37,924 INFO L93 Difference]: Finished difference Result 15572 states and 22875 transitions. [2022-07-21 10:58:37,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-21 10:58:37,925 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (24), 8 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 173 [2022-07-21 10:58:37,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:58:37,958 INFO L225 Difference]: With dead ends: 15572 [2022-07-21 10:58:37,959 INFO L226 Difference]: Without dead ends: 9276 [2022-07-21 10:58:37,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2022-07-21 10:58:37,980 INFO L413 NwaCegarLoop]: 1346 mSDtfsCounter, 2277 mSDsluCounter, 3189 mSDsCounter, 0 mSdLazyCounter, 2907 mSolverCounterSat, 1486 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2393 SdHoareTripleChecker+Valid, 4535 SdHoareTripleChecker+Invalid, 4394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1486 IncrementalHoareTripleChecker+Valid, 2907 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-07-21 10:58:37,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2393 Valid, 4535 Invalid, 4394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1486 Valid, 2907 Invalid, 1 Unknown, 0 Unchecked, 7.2s Time] [2022-07-21 10:58:37,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9276 states. [2022-07-21 10:58:38,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9276 to 7472. [2022-07-21 10:58:38,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7472 states, 5377 states have (on average 1.2955179468104892) internal successors, (6966), 5497 states have internal predecessors, (6966), 1455 states have call successors, (1455), 420 states have call predecessors, (1455), 639 states have return successors, (2228), 1590 states have call predecessors, (2228), 1454 states have call successors, (2228) [2022-07-21 10:58:38,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7472 states to 7472 states and 10649 transitions. [2022-07-21 10:58:38,270 INFO L78 Accepts]: Start accepts. Automaton has 7472 states and 10649 transitions. Word has length 173 [2022-07-21 10:58:38,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:58:38,271 INFO L495 AbstractCegarLoop]: Abstraction has 7472 states and 10649 transitions. [2022-07-21 10:58:38,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (24), 8 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-21 10:58:38,271 INFO L276 IsEmpty]: Start isEmpty. Operand 7472 states and 10649 transitions. [2022-07-21 10:58:38,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-07-21 10:58:38,275 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:58:38,275 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 10:58:38,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 10:58:38,276 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:58:38,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:58:38,276 INFO L85 PathProgramCache]: Analyzing trace with hash 2055648344, now seen corresponding path program 1 times [2022-07-21 10:58:38,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:58:38,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205765063] [2022-07-21 10:58:38,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:58:38,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:58:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:38,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:58:38,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:38,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:58:38,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:38,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:58:38,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:38,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:58:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:38,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 10:58:38,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:38,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 10:58:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:38,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 10:58:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:38,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 10:58:38,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:38,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 10:58:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:38,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 10:58:38,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:38,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:58:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:38,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:58:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:38,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 10:58:38,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:38,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 10:58:38,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:38,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 10:58:38,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:38,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 10:58:38,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:38,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 10:58:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:38,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 10:58:38,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:38,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 10:58:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:38,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 10:58:38,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:38,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 10:58:38,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:38,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:58:38,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:38,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 10:58:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:38,673 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-07-21 10:58:38,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:58:38,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205765063] [2022-07-21 10:58:38,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205765063] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:58:38,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:58:38,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 10:58:38,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148604355] [2022-07-21 10:58:38,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:58:38,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 10:58:38,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:58:38,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 10:58:38,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-07-21 10:58:38,675 INFO L87 Difference]: Start difference. First operand 7472 states and 10649 transitions. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 4 states have internal predecessors, (103), 4 states have call successors, (24), 8 states have call predecessors, (24), 2 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) [2022-07-21 10:58:41,784 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-21 10:58:49,739 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-21 10:58:55,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:58:55,445 INFO L93 Difference]: Finished difference Result 19562 states and 30825 transitions. [2022-07-21 10:58:55,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-21 10:58:55,445 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 4 states have internal predecessors, (103), 4 states have call successors, (24), 8 states have call predecessors, (24), 2 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) Word has length 182 [2022-07-21 10:58:55,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:58:55,541 INFO L225 Difference]: With dead ends: 19562 [2022-07-21 10:58:55,542 INFO L226 Difference]: Without dead ends: 9216 [2022-07-21 10:58:55,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=248, Invalid=874, Unknown=0, NotChecked=0, Total=1122 [2022-07-21 10:58:55,637 INFO L413 NwaCegarLoop]: 2356 mSDtfsCounter, 6746 mSDsluCounter, 6215 mSDsCounter, 0 mSdLazyCounter, 7216 mSolverCounterSat, 4307 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7047 SdHoareTripleChecker+Valid, 8571 SdHoareTripleChecker+Invalid, 11525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4307 IncrementalHoareTripleChecker+Valid, 7216 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.8s IncrementalHoareTripleChecker+Time [2022-07-21 10:58:55,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7047 Valid, 8571 Invalid, 11525 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4307 Valid, 7216 Invalid, 2 Unknown, 0 Unchecked, 15.8s Time] [2022-07-21 10:58:55,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9216 states. [2022-07-21 10:58:56,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9216 to 7422. [2022-07-21 10:58:56,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7422 states, 5327 states have (on average 1.2459170264689319) internal successors, (6637), 5447 states have internal predecessors, (6637), 1455 states have call successors, (1455), 420 states have call predecessors, (1455), 639 states have return successors, (2228), 1590 states have call predecessors, (2228), 1454 states have call successors, (2228) [2022-07-21 10:58:56,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7422 states to 7422 states and 10320 transitions. [2022-07-21 10:58:56,038 INFO L78 Accepts]: Start accepts. Automaton has 7422 states and 10320 transitions. Word has length 182 [2022-07-21 10:58:56,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:58:56,038 INFO L495 AbstractCegarLoop]: Abstraction has 7422 states and 10320 transitions. [2022-07-21 10:58:56,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 4 states have internal predecessors, (103), 4 states have call successors, (24), 8 states have call predecessors, (24), 2 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) [2022-07-21 10:58:56,038 INFO L276 IsEmpty]: Start isEmpty. Operand 7422 states and 10320 transitions. [2022-07-21 10:58:56,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-07-21 10:58:56,042 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:58:56,043 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 10:58:56,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 10:58:56,043 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:58:56,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:58:56,043 INFO L85 PathProgramCache]: Analyzing trace with hash 333645658, now seen corresponding path program 1 times [2022-07-21 10:58:56,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:58:56,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968116224] [2022-07-21 10:58:56,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:58:56,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:58:56,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:56,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:58:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:56,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:58:56,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:56,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:58:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:56,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:58:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:56,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 10:58:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:56,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 10:58:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:56,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 10:58:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:56,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 10:58:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:56,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 10:58:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:56,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 10:58:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:56,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:58:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:56,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:58:56,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:56,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 10:58:56,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:56,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 10:58:56,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:56,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 10:58:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:56,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 10:58:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:56,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 10:58:56,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:56,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 10:58:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:56,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 10:58:56,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:56,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 10:58:56,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:56,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 10:58:56,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:56,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:58:56,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:56,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 10:58:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:56,553 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-07-21 10:58:56,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:58:56,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968116224] [2022-07-21 10:58:56,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968116224] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:58:56,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:58:56,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 10:58:56,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712855489] [2022-07-21 10:58:56,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:58:56,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 10:58:56,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:58:56,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 10:58:56,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-07-21 10:58:56,555 INFO L87 Difference]: Start difference. First operand 7422 states and 10320 transitions. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 4 states have internal predecessors, (103), 4 states have call successors, (24), 8 states have call predecessors, (24), 2 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) [2022-07-21 10:58:59,894 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-21 10:59:08,331 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-21 10:59:17,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:59:17,091 INFO L93 Difference]: Finished difference Result 19409 states and 28983 transitions. [2022-07-21 10:59:17,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-21 10:59:17,092 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 4 states have internal predecessors, (103), 4 states have call successors, (24), 8 states have call predecessors, (24), 2 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) Word has length 182 [2022-07-21 10:59:17,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:59:17,150 INFO L225 Difference]: With dead ends: 19409 [2022-07-21 10:59:17,163 INFO L226 Difference]: Without dead ends: 9158 [2022-07-21 10:59:17,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=289, Invalid=1043, Unknown=0, NotChecked=0, Total=1332 [2022-07-21 10:59:17,223 INFO L413 NwaCegarLoop]: 2385 mSDtfsCounter, 4657 mSDsluCounter, 7318 mSDsCounter, 0 mSdLazyCounter, 8775 mSolverCounterSat, 2538 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4937 SdHoareTripleChecker+Valid, 9703 SdHoareTripleChecker+Invalid, 11315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2538 IncrementalHoareTripleChecker+Valid, 8775 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.5s IncrementalHoareTripleChecker+Time [2022-07-21 10:59:17,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4937 Valid, 9703 Invalid, 11315 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2538 Valid, 8775 Invalid, 2 Unknown, 0 Unchecked, 19.5s Time] [2022-07-21 10:59:17,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9158 states. [2022-07-21 10:59:17,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9158 to 7292. [2022-07-21 10:59:17,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7292 states, 5212 states have (on average 1.2432847275518035) internal successors, (6480), 5336 states have internal predecessors, (6480), 1439 states have call successors, (1439), 439 states have call predecessors, (1439), 640 states have return successors, (2165), 1554 states have call predecessors, (2165), 1438 states have call successors, (2165) [2022-07-21 10:59:17,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7292 states to 7292 states and 10084 transitions. [2022-07-21 10:59:17,618 INFO L78 Accepts]: Start accepts. Automaton has 7292 states and 10084 transitions. Word has length 182 [2022-07-21 10:59:17,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:59:17,618 INFO L495 AbstractCegarLoop]: Abstraction has 7292 states and 10084 transitions. [2022-07-21 10:59:17,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 4 states have internal predecessors, (103), 4 states have call successors, (24), 8 states have call predecessors, (24), 2 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) [2022-07-21 10:59:17,619 INFO L276 IsEmpty]: Start isEmpty. Operand 7292 states and 10084 transitions. [2022-07-21 10:59:17,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2022-07-21 10:59:17,627 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:59:17,628 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 10:59:17,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 10:59:17,628 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:59:17,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:59:17,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1756662636, now seen corresponding path program 1 times [2022-07-21 10:59:17,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:59:17,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754721882] [2022-07-21 10:59:17,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:59:17,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:59:17,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:17,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:59:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:17,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:59:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:17,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:59:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:17,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:59:17,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:17,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 10:59:17,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:17,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 10:59:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:17,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 10:59:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:17,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 10:59:17,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:17,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 10:59:17,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:17,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 10:59:17,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:17,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:59:17,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:17,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:59:17,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:17,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 10:59:17,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:17,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 10:59:17,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:17,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 10:59:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:17,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 10:59:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:17,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 10:59:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:17,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 10:59:17,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:17,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 10:59:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:17,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 10:59:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:17,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 10:59:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:17,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:59:17,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:17,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 10:59:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:18,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 10:59:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:18,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:59:18,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:18,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 10:59:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:18,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 10:59:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:18,041 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-21 10:59:18,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:59:18,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754721882] [2022-07-21 10:59:18,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754721882] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:59:18,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:59:18,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 10:59:18,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643905531] [2022-07-21 10:59:18,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:59:18,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 10:59:18,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:59:18,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 10:59:18,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-21 10:59:18,043 INFO L87 Difference]: Start difference. First operand 7292 states and 10084 transitions. Second operand has 9 states, 9 states have (on average 15.222222222222221) internal successors, (137), 3 states have internal predecessors, (137), 3 states have call successors, (28), 8 states have call predecessors, (28), 2 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2022-07-21 10:59:20,876 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-21 10:59:23,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:59:23,819 INFO L93 Difference]: Finished difference Result 14248 states and 20624 transitions. [2022-07-21 10:59:23,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 10:59:23,820 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.222222222222221) internal successors, (137), 3 states have internal predecessors, (137), 3 states have call successors, (28), 8 states have call predecessors, (28), 2 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) Word has length 227 [2022-07-21 10:59:23,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:59:23,849 INFO L225 Difference]: With dead ends: 14248 [2022-07-21 10:59:23,849 INFO L226 Difference]: Without dead ends: 6616 [2022-07-21 10:59:23,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-07-21 10:59:23,871 INFO L413 NwaCegarLoop]: 745 mSDtfsCounter, 1736 mSDsluCounter, 1259 mSDsCounter, 0 mSdLazyCounter, 1650 mSolverCounterSat, 1031 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1824 SdHoareTripleChecker+Valid, 2004 SdHoareTripleChecker+Invalid, 2682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1031 IncrementalHoareTripleChecker+Valid, 1650 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-07-21 10:59:23,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1824 Valid, 2004 Invalid, 2682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1031 Valid, 1650 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2022-07-21 10:59:23,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6616 states. [2022-07-21 10:59:24,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6616 to 4994. [2022-07-21 10:59:24,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4994 states, 3541 states have (on average 1.2157582603784243) internal successors, (4305), 3620 states have internal predecessors, (4305), 902 states have call successors, (902), 373 states have call predecessors, (902), 550 states have return successors, (1449), 1026 states have call predecessors, (1449), 901 states have call successors, (1449) [2022-07-21 10:59:24,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4994 states to 4994 states and 6656 transitions. [2022-07-21 10:59:24,097 INFO L78 Accepts]: Start accepts. Automaton has 4994 states and 6656 transitions. Word has length 227 [2022-07-21 10:59:24,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:59:24,097 INFO L495 AbstractCegarLoop]: Abstraction has 4994 states and 6656 transitions. [2022-07-21 10:59:24,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.222222222222221) internal successors, (137), 3 states have internal predecessors, (137), 3 states have call successors, (28), 8 states have call predecessors, (28), 2 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2022-07-21 10:59:24,098 INFO L276 IsEmpty]: Start isEmpty. Operand 4994 states and 6656 transitions. [2022-07-21 10:59:24,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-07-21 10:59:24,104 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:59:24,105 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 10:59:24,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 10:59:24,105 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:59:24,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:59:24,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1517578895, now seen corresponding path program 1 times [2022-07-21 10:59:24,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:59:24,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133193611] [2022-07-21 10:59:24,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:59:24,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:59:24,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:24,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:59:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:24,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:59:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:24,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:59:24,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:24,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:59:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:24,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 10:59:24,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:24,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 10:59:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:24,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 10:59:24,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:24,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 10:59:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:24,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 10:59:24,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:24,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-21 10:59:24,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:24,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 10:59:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:24,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 10:59:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:24,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:59:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:24,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 10:59:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:24,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 10:59:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:24,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 10:59:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:24,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 10:59:24,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:24,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 10:59:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:24,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:59:24,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:24,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:59:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:24,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 10:59:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:24,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 10:59:24,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:24,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 10:59:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:24,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 10:59:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:24,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 10:59:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:24,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:59:24,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:24,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:59:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:24,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 10:59:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:24,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 10:59:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:24,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 10:59:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:24,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 10:59:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:24,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 10:59:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:24,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-21 10:59:24,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:24,879 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-07-21 10:59:24,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:59:24,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133193611] [2022-07-21 10:59:24,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133193611] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:59:24,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:59:24,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-21 10:59:24,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154903993] [2022-07-21 10:59:24,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:59:24,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 10:59:24,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:59:24,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 10:59:24,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-07-21 10:59:24,881 INFO L87 Difference]: Start difference. First operand 4994 states and 6656 transitions. Second operand has 13 states, 13 states have (on average 13.23076923076923) internal successors, (172), 4 states have internal predecessors, (172), 3 states have call successors, (34), 11 states have call predecessors, (34), 2 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2022-07-21 10:59:28,250 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 10:59:31,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:59:31,535 INFO L93 Difference]: Finished difference Result 12609 states and 18300 transitions. [2022-07-21 10:59:31,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-21 10:59:31,536 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 13.23076923076923) internal successors, (172), 4 states have internal predecessors, (172), 3 states have call successors, (34), 11 states have call predecessors, (34), 2 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) Word has length 268 [2022-07-21 10:59:31,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:59:31,560 INFO L225 Difference]: With dead ends: 12609 [2022-07-21 10:59:31,560 INFO L226 Difference]: Without dead ends: 7641 [2022-07-21 10:59:31,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=176, Invalid=474, Unknown=0, NotChecked=0, Total=650 [2022-07-21 10:59:31,572 INFO L413 NwaCegarLoop]: 791 mSDtfsCounter, 2022 mSDsluCounter, 2098 mSDsCounter, 0 mSdLazyCounter, 2952 mSolverCounterSat, 1272 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2056 SdHoareTripleChecker+Valid, 2889 SdHoareTripleChecker+Invalid, 4225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1272 IncrementalHoareTripleChecker+Valid, 2952 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-07-21 10:59:31,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2056 Valid, 2889 Invalid, 4225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1272 Valid, 2952 Invalid, 1 Unknown, 0 Unchecked, 6.1s Time] [2022-07-21 10:59:31,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7641 states. [2022-07-21 10:59:31,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7641 to 5139. [2022-07-21 10:59:31,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5139 states, 3669 states have (on average 1.2210411556282366) internal successors, (4480), 3738 states have internal predecessors, (4480), 943 states have call successors, (943), 417 states have call predecessors, (943), 526 states have return successors, (1310), 1014 states have call predecessors, (1310), 942 states have call successors, (1310) [2022-07-21 10:59:31,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5139 states to 5139 states and 6733 transitions. [2022-07-21 10:59:31,887 INFO L78 Accepts]: Start accepts. Automaton has 5139 states and 6733 transitions. Word has length 268 [2022-07-21 10:59:31,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:59:31,888 INFO L495 AbstractCegarLoop]: Abstraction has 5139 states and 6733 transitions. [2022-07-21 10:59:31,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 13.23076923076923) internal successors, (172), 4 states have internal predecessors, (172), 3 states have call successors, (34), 11 states have call predecessors, (34), 2 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2022-07-21 10:59:31,888 INFO L276 IsEmpty]: Start isEmpty. Operand 5139 states and 6733 transitions. [2022-07-21 10:59:31,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2022-07-21 10:59:31,896 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:59:31,897 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 10:59:31,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 10:59:31,897 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:59:31,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:59:31,897 INFO L85 PathProgramCache]: Analyzing trace with hash -953087407, now seen corresponding path program 1 times [2022-07-21 10:59:31,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:59:31,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500221894] [2022-07-21 10:59:31,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:59:31,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:59:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:32,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:59:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:32,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:59:32,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:32,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:59:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:32,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:59:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:32,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 10:59:32,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:32,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 10:59:32,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:32,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 10:59:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:32,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 10:59:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:32,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 10:59:32,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:32,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 10:59:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:32,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:59:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:32,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:59:32,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:32,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 10:59:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:32,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 10:59:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:32,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-21 10:59:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:32,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 10:59:32,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:32,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 10:59:32,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:32,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 10:59:32,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:32,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:59:32,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:32,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 10:59:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:32,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 10:59:32,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:32,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 10:59:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:32,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 10:59:32,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:32,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 10:59:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:32,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:59:32,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:32,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:59:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:32,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 10:59:32,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:32,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 10:59:32,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:32,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 10:59:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:32,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 10:59:32,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:32,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 10:59:32,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:32,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:59:32,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:32,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:59:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:32,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 10:59:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:32,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 10:59:32,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:32,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 10:59:32,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:32,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 10:59:32,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:32,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 10:59:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:32,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-21 10:59:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:32,639 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-07-21 10:59:32,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:59:32,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500221894] [2022-07-21 10:59:32,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500221894] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 10:59:32,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113715750] [2022-07-21 10:59:32,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:59:32,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 10:59:32,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 10:59:32,656 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-21 10:59:32,684 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-21 10:59:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:33,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 3679 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 10:59:33,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 10:59:33,605 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-07-21 10:59:33,605 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 10:59:33,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113715750] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:59:33,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 10:59:33,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2022-07-21 10:59:33,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742005890] [2022-07-21 10:59:33,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:59:33,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 10:59:33,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:59:33,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 10:59:33,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-07-21 10:59:33,607 INFO L87 Difference]: Start difference. First operand 5139 states and 6733 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2022-07-21 10:59:33,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:59:33,810 INFO L93 Difference]: Finished difference Result 10279 states and 13925 transitions. [2022-07-21 10:59:33,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 10:59:33,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 316 [2022-07-21 10:59:33,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:59:33,828 INFO L225 Difference]: With dead ends: 10279 [2022-07-21 10:59:33,828 INFO L226 Difference]: Without dead ends: 5166 [2022-07-21 10:59:33,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-07-21 10:59:33,840 INFO L413 NwaCegarLoop]: 821 mSDtfsCounter, 2 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 10:59:33,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1638 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 10:59:33,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2022-07-21 10:59:34,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 5145. [2022-07-21 10:59:34,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5145 states, 3675 states have (on average 1.2206802721088434) internal successors, (4486), 3744 states have internal predecessors, (4486), 943 states have call successors, (943), 417 states have call predecessors, (943), 526 states have return successors, (1310), 1014 states have call predecessors, (1310), 942 states have call successors, (1310) [2022-07-21 10:59:34,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5145 states to 5145 states and 6739 transitions. [2022-07-21 10:59:34,056 INFO L78 Accepts]: Start accepts. Automaton has 5145 states and 6739 transitions. Word has length 316 [2022-07-21 10:59:34,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:59:34,056 INFO L495 AbstractCegarLoop]: Abstraction has 5145 states and 6739 transitions. [2022-07-21 10:59:34,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2022-07-21 10:59:34,056 INFO L276 IsEmpty]: Start isEmpty. Operand 5145 states and 6739 transitions. [2022-07-21 10:59:34,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2022-07-21 10:59:34,063 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:59:34,064 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 10:59:34,108 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-21 10:59:34,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-21 10:59:34,287 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:59:34,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:59:34,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1543928242, now seen corresponding path program 1 times [2022-07-21 10:59:34,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:59:34,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443379763] [2022-07-21 10:59:34,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:59:34,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:59:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:34,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:59:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:34,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:59:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:34,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:59:34,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:34,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:59:34,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:34,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 10:59:34,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:34,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 10:59:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:34,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 10:59:34,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:34,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 10:59:34,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:34,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 10:59:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:34,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 10:59:34,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:34,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:59:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:34,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:59:34,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:34,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 10:59:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:34,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 10:59:34,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:34,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-21 10:59:34,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:34,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 10:59:34,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:34,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 10:59:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:34,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 10:59:34,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:34,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:59:34,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:34,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:59:34,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:34,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 10:59:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:34,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 10:59:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:34,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 10:59:34,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:34,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 10:59:34,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:34,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 10:59:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:34,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:59:34,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:34,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:59:34,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:35,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 10:59:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:35,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 10:59:35,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:35,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 10:59:35,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:35,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 10:59:35,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:35,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 10:59:35,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:35,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:59:35,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:35,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:59:35,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:35,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 10:59:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:35,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 10:59:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:35,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 10:59:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:35,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 10:59:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:35,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 10:59:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:35,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-21 10:59:35,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:35,134 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-21 10:59:35,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:59:35,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443379763] [2022-07-21 10:59:35,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443379763] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 10:59:35,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857356330] [2022-07-21 10:59:35,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:59:35,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 10:59:35,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 10:59:35,156 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-21 10:59:35,180 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-21 10:59:36,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:36,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 3713 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 10:59:36,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 10:59:36,206 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-07-21 10:59:36,206 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 10:59:36,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857356330] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:59:36,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 10:59:36,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2022-07-21 10:59:36,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183504560] [2022-07-21 10:59:36,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:59:36,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 10:59:36,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:59:36,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 10:59:36,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-07-21 10:59:36,209 INFO L87 Difference]: Start difference. First operand 5145 states and 6739 transitions. Second operand has 5 states, 5 states have (on average 41.8) internal successors, (209), 4 states have internal predecessors, (209), 2 states have call successors, (41), 2 states have call predecessors, (41), 3 states have return successors, (40), 3 states have call predecessors, (40), 2 states have call successors, (40) [2022-07-21 10:59:36,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:59:36,290 INFO L93 Difference]: Finished difference Result 5760 states and 7511 transitions. [2022-07-21 10:59:36,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 10:59:36,290 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.8) internal successors, (209), 4 states have internal predecessors, (209), 2 states have call successors, (41), 2 states have call predecessors, (41), 3 states have return successors, (40), 3 states have call predecessors, (40), 2 states have call successors, (40) Word has length 324 [2022-07-21 10:59:36,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:59:36,292 INFO L225 Difference]: With dead ends: 5760 [2022-07-21 10:59:36,292 INFO L226 Difference]: Without dead ends: 0 [2022-07-21 10:59:36,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 395 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2022-07-21 10:59:36,301 INFO L413 NwaCegarLoop]: 366 mSDtfsCounter, 170 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 10:59:36,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 1284 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 10:59:36,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-21 10:59:36,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-21 10:59:36,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 10:59:36,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-21 10:59:36,303 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 324 [2022-07-21 10:59:36,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:59:36,303 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-21 10:59:36,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.8) internal successors, (209), 4 states have internal predecessors, (209), 2 states have call successors, (41), 2 states have call predecessors, (41), 3 states have return successors, (40), 3 states have call predecessors, (40), 2 states have call successors, (40) [2022-07-21 10:59:36,303 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-21 10:59:36,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-21 10:59:36,305 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 10:59:36,330 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-21 10:59:36,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-21 10:59:36,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-21 11:00:21,409 WARN L233 SmtUtils]: Spent 6.98s on a formula simplification. DAG size of input: 71 DAG size of output: 67 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-21 11:00:28,283 WARN L233 SmtUtils]: Spent 6.87s on a formula simplification. DAG size of input: 71 DAG size of output: 67 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-21 11:00:35,176 WARN L233 SmtUtils]: Spent 6.89s on a formula simplification. DAG size of input: 71 DAG size of output: 67 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-21 11:00:42,646 WARN L233 SmtUtils]: Spent 6.89s on a formula simplification. DAG size of input: 71 DAG size of output: 67 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-21 11:00:53,712 WARN L233 SmtUtils]: Spent 7.00s on a formula simplification. DAG size of input: 71 DAG size of output: 67 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or)