./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-loop.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-loop.ko.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f25e8d9a29012500b38126aa22b2b7d181aad99a845cece264158253e2ec92e3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 22:35:06,102 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 22:35:06,105 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 22:35:06,149 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 22:35:06,150 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 22:35:06,151 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 22:35:06,153 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 22:35:06,155 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 22:35:06,157 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 22:35:06,158 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 22:35:06,159 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 22:35:06,161 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 22:35:06,162 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 22:35:06,165 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 22:35:06,166 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 22:35:06,170 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 22:35:06,170 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 22:35:06,171 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 22:35:06,173 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 22:35:06,178 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 22:35:06,180 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 22:35:06,180 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 22:35:06,181 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 22:35:06,182 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 22:35:06,184 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 22:35:06,190 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 22:35:06,190 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 22:35:06,190 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 22:35:06,191 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 22:35:06,192 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 22:35:06,193 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 22:35:06,194 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 22:35:06,195 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 22:35:06,196 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 22:35:06,196 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 22:35:06,197 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 22:35:06,197 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 22:35:06,198 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 22:35:06,198 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 22:35:06,198 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 22:35:06,199 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 22:35:06,200 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 22:35:06,202 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-22 22:35:06,230 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 22:35:06,231 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 22:35:06,231 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 22:35:06,231 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 22:35:06,232 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 22:35:06,232 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 22:35:06,232 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 22:35:06,233 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 22:35:06,233 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 22:35:06,234 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 22:35:06,234 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 22:35:06,234 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 22:35:06,234 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 22:35:06,234 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 22:35:06,235 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 22:35:06,235 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 22:35:06,235 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 22:35:06,235 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 22:35:06,235 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 22:35:06,237 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 22:35:06,237 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 22:35:06,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 22:35:06,237 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 22:35:06,237 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 22:35:06,238 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 22:35:06,238 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 22:35:06,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 22:35:06,238 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 22:35:06,238 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 22:35:06,239 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 22:35:06,239 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 -> f25e8d9a29012500b38126aa22b2b7d181aad99a845cece264158253e2ec92e3 [2022-07-22 22:35:06,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 22:35:06,467 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 22:35:06,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 22:35:06,470 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 22:35:06,471 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 22:35:06,472 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-loop.ko.cil.out.i [2022-07-22 22:35:06,525 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efbb5c4de/520c9e1614b044e8ab9e1b928ee09ec1/FLAG386dae3b4 [2022-07-22 22:35:07,099 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 22:35:07,100 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-loop.ko.cil.out.i [2022-07-22 22:35:07,130 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efbb5c4de/520c9e1614b044e8ab9e1b928ee09ec1/FLAG386dae3b4 [2022-07-22 22:35:07,277 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efbb5c4de/520c9e1614b044e8ab9e1b928ee09ec1 [2022-07-22 22:35:07,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 22:35:07,280 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 22:35:07,281 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 22:35:07,281 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 22:35:07,284 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 22:35:07,284 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:35:07" (1/1) ... [2022-07-22 22:35:07,285 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36d43e31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:35:07, skipping insertion in model container [2022-07-22 22:35:07,285 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:35:07" (1/1) ... [2022-07-22 22:35:07,291 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 22:35:07,393 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 22:35:08,588 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-loop.ko.cil.out.i[192897,192910] [2022-07-22 22:35:08,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 22:35:08,651 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 22:35:08,924 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-loop.ko.cil.out.i[192897,192910] [2022-07-22 22:35:08,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 22:35:09,000 INFO L208 MainTranslator]: Completed translation [2022-07-22 22:35:09,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:35:09 WrapperNode [2022-07-22 22:35:09,002 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 22:35:09,003 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 22:35:09,004 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 22:35:09,004 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 22:35:09,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:35:09" (1/1) ... [2022-07-22 22:35:09,066 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:35:09" (1/1) ... [2022-07-22 22:35:09,224 INFO L137 Inliner]: procedures = 236, calls = 1201, calls flagged for inlining = 124, calls inlined = 121, statements flattened = 3745 [2022-07-22 22:35:09,225 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 22:35:09,226 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 22:35:09,227 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 22:35:09,227 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 22:35:09,240 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:35:09" (1/1) ... [2022-07-22 22:35:09,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:35:09" (1/1) ... [2022-07-22 22:35:09,271 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:35:09" (1/1) ... [2022-07-22 22:35:09,272 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:35:09" (1/1) ... [2022-07-22 22:35:09,367 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:35:09" (1/1) ... [2022-07-22 22:35:09,388 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:35:09" (1/1) ... [2022-07-22 22:35:09,414 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:35:09" (1/1) ... [2022-07-22 22:35:09,439 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 22:35:09,440 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 22:35:09,440 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 22:35:09,441 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 22:35:09,442 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:35:09" (1/1) ... [2022-07-22 22:35:09,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 22:35:09,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:35:09,473 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-22 22:35:09,493 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-22 22:35:09,514 INFO L130 BoogieDeclarations]: Found specification of procedure bio_endio [2022-07-22 22:35:09,514 INFO L138 BoogieDeclarations]: Found implementation of procedure bio_endio [2022-07-22 22:35:09,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-22 22:35:09,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-22 22:35:09,515 INFO L130 BoogieDeclarations]: Found specification of procedure vfs_fsync [2022-07-22 22:35:09,515 INFO L138 BoogieDeclarations]: Found implementation of procedure vfs_fsync [2022-07-22 22:35:09,515 INFO L130 BoogieDeclarations]: Found specification of procedure lowmem_page_address [2022-07-22 22:35:09,515 INFO L138 BoogieDeclarations]: Found implementation of procedure lowmem_page_address [2022-07-22 22:35:09,515 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-07-22 22:35:09,515 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-07-22 22:35:09,516 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-22 22:35:09,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-22 22:35:09,516 INFO L130 BoogieDeclarations]: Found specification of procedure add_disk [2022-07-22 22:35:09,516 INFO L138 BoogieDeclarations]: Found implementation of procedure add_disk [2022-07-22 22:35:09,516 INFO L130 BoogieDeclarations]: Found specification of procedure kobject_uevent [2022-07-22 22:35:09,516 INFO L138 BoogieDeclarations]: Found implementation of procedure kobject_uevent [2022-07-22 22:35:09,517 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2022-07-22 22:35:09,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2022-07-22 22:35:09,517 INFO L130 BoogieDeclarations]: Found specification of procedure transfer_xor [2022-07-22 22:35:09,517 INFO L138 BoogieDeclarations]: Found implementation of procedure transfer_xor [2022-07-22 22:35:09,517 INFO L130 BoogieDeclarations]: Found specification of procedure invalidate_bdev [2022-07-22 22:35:09,517 INFO L138 BoogieDeclarations]: Found implementation of procedure invalidate_bdev [2022-07-22 22:35:09,517 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2022-07-22 22:35:09,518 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2022-07-22 22:35:09,518 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-22 22:35:09,518 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-22 22:35:09,518 INFO L130 BoogieDeclarations]: Found specification of procedure huge_encode_dev [2022-07-22 22:35:09,518 INFO L138 BoogieDeclarations]: Found implementation of procedure huge_encode_dev [2022-07-22 22:35:09,518 INFO L130 BoogieDeclarations]: Found specification of procedure lo_do_transfer [2022-07-22 22:35:09,519 INFO L138 BoogieDeclarations]: Found implementation of procedure lo_do_transfer [2022-07-22 22:35:09,519 INFO L130 BoogieDeclarations]: Found specification of procedure loop_sysfs_exit [2022-07-22 22:35:09,519 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_sysfs_exit [2022-07-22 22:35:09,519 INFO L130 BoogieDeclarations]: Found specification of procedure set_capacity [2022-07-22 22:35:09,519 INFO L138 BoogieDeclarations]: Found implementation of procedure set_capacity [2022-07-22 22:35:09,519 INFO L130 BoogieDeclarations]: Found specification of procedure kthread_should_stop [2022-07-22 22:35:09,519 INFO L138 BoogieDeclarations]: Found implementation of procedure kthread_should_stop [2022-07-22 22:35:09,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-22 22:35:09,520 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-22 22:35:09,520 INFO L130 BoogieDeclarations]: Found specification of procedure loop_alloc [2022-07-22 22:35:09,520 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_alloc [2022-07-22 22:35:09,521 INFO L130 BoogieDeclarations]: Found specification of procedure loop_make_request [2022-07-22 22:35:09,521 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_make_request [2022-07-22 22:35:09,521 INFO L130 BoogieDeclarations]: Found specification of procedure __do_lo_send_write [2022-07-22 22:35:09,521 INFO L138 BoogieDeclarations]: Found implementation of procedure __do_lo_send_write [2022-07-22 22:35:09,521 INFO L130 BoogieDeclarations]: Found specification of procedure loop_get_status [2022-07-22 22:35:09,521 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_get_status [2022-07-22 22:35:09,522 INFO L130 BoogieDeclarations]: Found specification of procedure loop_clr_fd [2022-07-22 22:35:09,522 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_clr_fd [2022-07-22 22:35:09,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 22:35:09,522 INFO L130 BoogieDeclarations]: Found specification of procedure figure_loop_size [2022-07-22 22:35:09,522 INFO L138 BoogieDeclarations]: Found implementation of procedure figure_loop_size [2022-07-22 22:35:09,522 INFO L130 BoogieDeclarations]: Found specification of procedure ioctl_by_bdev [2022-07-22 22:35:09,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ioctl_by_bdev [2022-07-22 22:35:09,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 22:35:09,523 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-07-22 22:35:09,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-07-22 22:35:09,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 22:35:09,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-22 22:35:09,525 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-22 22:35:09,525 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-22 22:35:09,525 INFO L130 BoogieDeclarations]: Found specification of procedure capable [2022-07-22 22:35:09,525 INFO L138 BoogieDeclarations]: Found implementation of procedure capable [2022-07-22 22:35:09,525 INFO L130 BoogieDeclarations]: Found specification of procedure fput [2022-07-22 22:35:09,526 INFO L138 BoogieDeclarations]: Found implementation of procedure fput [2022-07-22 22:35:09,526 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2022-07-22 22:35:09,526 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2022-07-22 22:35:09,526 INFO L130 BoogieDeclarations]: Found specification of procedure loop_set_capacity [2022-07-22 22:35:09,526 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_set_capacity [2022-07-22 22:35:09,526 INFO L130 BoogieDeclarations]: Found specification of procedure bio_list_empty [2022-07-22 22:35:09,526 INFO L138 BoogieDeclarations]: Found implementation of procedure bio_list_empty [2022-07-22 22:35:09,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-22 22:35:09,527 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-07-22 22:35:09,527 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-07-22 22:35:09,528 INFO L130 BoogieDeclarations]: Found specification of procedure loop_free [2022-07-22 22:35:09,528 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_free [2022-07-22 22:35:09,528 INFO L130 BoogieDeclarations]: Found specification of procedure transfer_none [2022-07-22 22:35:09,528 INFO L138 BoogieDeclarations]: Found implementation of procedure transfer_none [2022-07-22 22:35:09,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-22 22:35:09,528 INFO L130 BoogieDeclarations]: Found specification of procedure bd_set_size [2022-07-22 22:35:09,529 INFO L138 BoogieDeclarations]: Found implementation of procedure bd_set_size [2022-07-22 22:35:09,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 22:35:09,530 INFO L130 BoogieDeclarations]: Found specification of procedure fget [2022-07-22 22:35:09,530 INFO L138 BoogieDeclarations]: Found implementation of procedure fget [2022-07-22 22:35:09,530 INFO L130 BoogieDeclarations]: Found specification of procedure mapping_set_gfp_mask [2022-07-22 22:35:09,530 INFO L138 BoogieDeclarations]: Found implementation of procedure mapping_set_gfp_mask [2022-07-22 22:35:09,530 INFO L130 BoogieDeclarations]: Found specification of procedure xor_init [2022-07-22 22:35:09,530 INFO L138 BoogieDeclarations]: Found implementation of procedure xor_init [2022-07-22 22:35:09,531 INFO L130 BoogieDeclarations]: Found specification of procedure kmap [2022-07-22 22:35:09,531 INFO L138 BoogieDeclarations]: Found implementation of procedure kmap [2022-07-22 22:35:09,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-22 22:35:09,531 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-22 22:35:09,531 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-22 22:35:09,532 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-22 22:35:09,532 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_blkdev [2022-07-22 22:35:09,532 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_blkdev [2022-07-22 22:35:09,532 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2022-07-22 22:35:09,533 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2022-07-22 22:35:09,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 22:35:09,533 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-07-22 22:35:09,534 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-07-22 22:35:09,534 INFO L130 BoogieDeclarations]: Found specification of procedure __kmap_atomic [2022-07-22 22:35:09,534 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmap_atomic [2022-07-22 22:35:09,534 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irq [2022-07-22 22:35:09,535 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irq [2022-07-22 22:35:09,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 22:35:09,535 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2022-07-22 22:35:09,535 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2022-07-22 22:35:09,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 22:35:09,535 INFO L130 BoogieDeclarations]: Found specification of procedure get_loop_size [2022-07-22 22:35:09,536 INFO L138 BoogieDeclarations]: Found implementation of procedure get_loop_size [2022-07-22 22:35:09,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 22:35:09,536 INFO L130 BoogieDeclarations]: Found specification of procedure blk_cleanup_queue [2022-07-22 22:35:09,536 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_cleanup_queue [2022-07-22 22:35:09,536 INFO L130 BoogieDeclarations]: Found specification of procedure loop_set_status [2022-07-22 22:35:09,536 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_set_status [2022-07-22 22:35:09,537 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-22 22:35:09,537 INFO L130 BoogieDeclarations]: Found specification of procedure lo_ioctl [2022-07-22 22:35:09,537 INFO L138 BoogieDeclarations]: Found implementation of procedure lo_ioctl [2022-07-22 22:35:09,538 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irq [2022-07-22 22:35:09,540 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irq [2022-07-22 22:35:09,540 INFO L130 BoogieDeclarations]: Found specification of procedure current_thread_info [2022-07-22 22:35:09,540 INFO L138 BoogieDeclarations]: Found implementation of procedure current_thread_info [2022-07-22 22:35:09,540 INFO L130 BoogieDeclarations]: Found specification of procedure loop_release_xfer [2022-07-22 22:35:09,541 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_release_xfer [2022-07-22 22:35:09,542 INFO L130 BoogieDeclarations]: Found specification of procedure _cond_resched [2022-07-22 22:35:09,542 INFO L138 BoogieDeclarations]: Found implementation of procedure _cond_resched [2022-07-22 22:35:09,542 INFO L130 BoogieDeclarations]: Found specification of procedure kunmap [2022-07-22 22:35:09,543 INFO L138 BoogieDeclarations]: Found implementation of procedure kunmap [2022-07-22 22:35:09,548 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2022-07-22 22:35:09,548 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2022-07-22 22:35:09,548 INFO L130 BoogieDeclarations]: Found specification of procedure loop_switch [2022-07-22 22:35:09,548 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_switch [2022-07-22 22:35:09,549 INFO L130 BoogieDeclarations]: Found specification of procedure mapping_gfp_mask [2022-07-22 22:35:09,549 INFO L138 BoogieDeclarations]: Found implementation of procedure mapping_gfp_mask [2022-07-22 22:35:09,549 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-22 22:35:09,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-22 22:35:09,549 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2022-07-22 22:35:09,549 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2022-07-22 22:35:09,549 INFO L130 BoogieDeclarations]: Found specification of procedure __kunmap_atomic [2022-07-22 22:35:09,550 INFO L138 BoogieDeclarations]: Found implementation of procedure __kunmap_atomic [2022-07-22 22:35:09,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 22:35:09,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 22:35:09,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 22:35:09,550 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-07-22 22:35:09,550 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-07-22 22:35:10,188 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 22:35:10,192 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 22:35:10,674 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-22 22:35:11,918 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2022-07-22 22:35:11,918 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2022-07-22 22:35:11,936 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-07-22 22:35:11,936 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-07-22 22:35:12,349 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-07-22 22:35:12,349 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-07-22 22:35:12,719 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-22 22:35:12,720 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-22 22:35:13,911 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##72: assume !false; [2022-07-22 22:35:13,912 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##71: assume false; [2022-07-22 22:35:13,912 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2022-07-22 22:35:13,912 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2022-07-22 22:35:13,950 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 22:35:13,963 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 22:35:13,963 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 22:35:13,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:35:13 BoogieIcfgContainer [2022-07-22 22:35:13,966 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 22:35:13,968 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 22:35:13,968 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 22:35:13,971 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 22:35:13,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 10:35:07" (1/3) ... [2022-07-22 22:35:13,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78efa018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:35:13, skipping insertion in model container [2022-07-22 22:35:13,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:35:09" (2/3) ... [2022-07-22 22:35:13,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78efa018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:35:13, skipping insertion in model container [2022-07-22 22:35:13,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:35:13" (3/3) ... [2022-07-22 22:35:13,974 INFO L111 eAbstractionObserver]: Analyzing ICFG module_get_put-drivers-block-loop.ko.cil.out.i [2022-07-22 22:35:13,986 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 22:35:13,986 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 22:35:14,046 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 22:35:14,052 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@e849c08, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@31125764 [2022-07-22 22:35:14,052 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 22:35:14,060 INFO L276 IsEmpty]: Start isEmpty. Operand has 1134 states, 846 states have (on average 1.3416075650118204) internal successors, (1135), 859 states have internal predecessors, (1135), 222 states have call successors, (222), 64 states have call predecessors, (222), 64 states have return successors, (222), 221 states have call predecessors, (222), 222 states have call successors, (222) [2022-07-22 22:35:14,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-22 22:35:14,066 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:35:14,066 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:35:14,067 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:35:14,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:35:14,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1638152850, now seen corresponding path program 1 times [2022-07-22 22:35:14,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:35:14,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134766323] [2022-07-22 22:35:14,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:35:14,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:35:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:14,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 22:35:14,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:35:14,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134766323] [2022-07-22 22:35:14,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134766323] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:35:14,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:35:14,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 22:35:14,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083311456] [2022-07-22 22:35:14,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:35:14,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 22:35:14,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:35:14,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 22:35:14,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 22:35:14,471 INFO L87 Difference]: Start difference. First operand has 1134 states, 846 states have (on average 1.3416075650118204) internal successors, (1135), 859 states have internal predecessors, (1135), 222 states have call successors, (222), 64 states have call predecessors, (222), 64 states have return successors, (222), 221 states have call predecessors, (222), 222 states have call successors, (222) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 22:35:14,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:35:14,719 INFO L93 Difference]: Finished difference Result 3311 states and 4739 transitions. [2022-07-22 22:35:14,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 22:35:14,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-22 22:35:14,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:35:14,767 INFO L225 Difference]: With dead ends: 3311 [2022-07-22 22:35:14,768 INFO L226 Difference]: Without dead ends: 2166 [2022-07-22 22:35:14,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 22:35:14,811 INFO L413 NwaCegarLoop]: 1914 mSDtfsCounter, 1542 mSDsluCounter, 1464 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1542 SdHoareTripleChecker+Valid, 3378 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 22:35:14,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1542 Valid, 3378 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 22:35:14,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2166 states. [2022-07-22 22:35:15,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2166 to 2163. [2022-07-22 22:35:15,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2163 states, 1610 states have (on average 1.3198757763975155) internal successors, (2125), 1630 states have internal predecessors, (2125), 429 states have call successors, (429), 124 states have call predecessors, (429), 123 states have return successors, (432), 425 states have call predecessors, (432), 427 states have call successors, (432) [2022-07-22 22:35:15,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 2986 transitions. [2022-07-22 22:35:15,129 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 2986 transitions. Word has length 11 [2022-07-22 22:35:15,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:35:15,129 INFO L495 AbstractCegarLoop]: Abstraction has 2163 states and 2986 transitions. [2022-07-22 22:35:15,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 22:35:15,130 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 2986 transitions. [2022-07-22 22:35:15,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-22 22:35:15,142 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:35:15,143 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:35:15,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 22:35:15,143 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:35:15,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:35:15,144 INFO L85 PathProgramCache]: Analyzing trace with hash -780115607, now seen corresponding path program 1 times [2022-07-22 22:35:15,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:35:15,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458105145] [2022-07-22 22:35:15,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:35:15,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:35:15,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:15,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 22:35:15,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:15,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-22 22:35:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:15,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:15,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 22:35:15,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:35:15,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458105145] [2022-07-22 22:35:15,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458105145] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:35:15,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:35:15,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 22:35:15,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997487019] [2022-07-22 22:35:15,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:35:15,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 22:35:15,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:35:15,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 22:35:15,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 22:35:15,362 INFO L87 Difference]: Start difference. First operand 2163 states and 2986 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-22 22:35:17,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:35:17,265 INFO L93 Difference]: Finished difference Result 4691 states and 6565 transitions. [2022-07-22 22:35:17,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 22:35:17,266 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2022-07-22 22:35:17,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:35:17,284 INFO L225 Difference]: With dead ends: 4691 [2022-07-22 22:35:17,284 INFO L226 Difference]: Without dead ends: 2609 [2022-07-22 22:35:17,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-22 22:35:17,293 INFO L413 NwaCegarLoop]: 1480 mSDtfsCounter, 565 mSDsluCounter, 2868 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 4348 SdHoareTripleChecker+Invalid, 1649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 1373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-22 22:35:17,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 4348 Invalid, 1649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 1373 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-22 22:35:17,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2022-07-22 22:35:17,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 2163. [2022-07-22 22:35:17,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2163 states, 1610 states have (on average 1.3186335403726708) internal successors, (2123), 1630 states have internal predecessors, (2123), 429 states have call successors, (429), 124 states have call predecessors, (429), 123 states have return successors, (432), 425 states have call predecessors, (432), 427 states have call successors, (432) [2022-07-22 22:35:17,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 2984 transitions. [2022-07-22 22:35:17,390 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 2984 transitions. Word has length 46 [2022-07-22 22:35:17,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:35:17,390 INFO L495 AbstractCegarLoop]: Abstraction has 2163 states and 2984 transitions. [2022-07-22 22:35:17,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-22 22:35:17,391 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 2984 transitions. [2022-07-22 22:35:17,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-22 22:35:17,394 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:35:17,394 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:35:17,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 22:35:17,394 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:35:17,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:35:17,395 INFO L85 PathProgramCache]: Analyzing trace with hash -800617350, now seen corresponding path program 1 times [2022-07-22 22:35:17,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:35:17,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797610404] [2022-07-22 22:35:17,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:35:17,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:35:17,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:17,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-22 22:35:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:17,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 22:35:17,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:17,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:17,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 22:35:17,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:35:17,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797610404] [2022-07-22 22:35:17,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797610404] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:35:17,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:35:17,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 22:35:17,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491714362] [2022-07-22 22:35:17,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:35:17,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 22:35:17,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:35:17,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 22:35:17,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 22:35:17,484 INFO L87 Difference]: Start difference. First operand 2163 states and 2984 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-22 22:35:18,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:35:18,840 INFO L93 Difference]: Finished difference Result 4764 states and 6650 transitions. [2022-07-22 22:35:18,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 22:35:18,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 58 [2022-07-22 22:35:18,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:35:18,858 INFO L225 Difference]: With dead ends: 4764 [2022-07-22 22:35:18,858 INFO L226 Difference]: Without dead ends: 2609 [2022-07-22 22:35:18,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 22:35:18,869 INFO L413 NwaCegarLoop]: 1472 mSDtfsCounter, 2078 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 582 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2231 SdHoareTripleChecker+Valid, 2196 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 582 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-22 22:35:18,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2231 Valid, 2196 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [582 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-22 22:35:18,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2022-07-22 22:35:18,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 2163. [2022-07-22 22:35:18,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2163 states, 1610 states have (on average 1.317391304347826) internal successors, (2121), 1630 states have internal predecessors, (2121), 429 states have call successors, (429), 124 states have call predecessors, (429), 123 states have return successors, (432), 425 states have call predecessors, (432), 427 states have call successors, (432) [2022-07-22 22:35:18,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 2982 transitions. [2022-07-22 22:35:18,966 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 2982 transitions. Word has length 58 [2022-07-22 22:35:18,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:35:18,967 INFO L495 AbstractCegarLoop]: Abstraction has 2163 states and 2982 transitions. [2022-07-22 22:35:18,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-22 22:35:18,967 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 2982 transitions. [2022-07-22 22:35:18,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-22 22:35:18,971 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:35:18,971 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:35:18,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 22:35:18,971 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:35:18,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:35:18,972 INFO L85 PathProgramCache]: Analyzing trace with hash -973306474, now seen corresponding path program 1 times [2022-07-22 22:35:18,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:35:18,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183593464] [2022-07-22 22:35:18,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:35:18,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:35:19,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:19,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:35:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:19,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 22:35:19,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:19,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:19,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 22:35:19,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:35:19,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183593464] [2022-07-22 22:35:19,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183593464] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:35:19,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:35:19,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 22:35:19,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785325835] [2022-07-22 22:35:19,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:35:19,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 22:35:19,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:35:19,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 22:35:19,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 22:35:19,085 INFO L87 Difference]: Start difference. First operand 2163 states and 2982 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-22 22:35:20,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:35:20,769 INFO L93 Difference]: Finished difference Result 4691 states and 6560 transitions. [2022-07-22 22:35:20,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 22:35:20,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2022-07-22 22:35:20,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:35:20,785 INFO L225 Difference]: With dead ends: 4691 [2022-07-22 22:35:20,785 INFO L226 Difference]: Without dead ends: 2592 [2022-07-22 22:35:20,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-22 22:35:20,803 INFO L413 NwaCegarLoop]: 1476 mSDtfsCounter, 565 mSDsluCounter, 2858 mSDsCounter, 0 mSdLazyCounter, 1371 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 4334 SdHoareTripleChecker+Invalid, 1647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 1371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-22 22:35:20,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 4334 Invalid, 1647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 1371 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-22 22:35:20,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2592 states. [2022-07-22 22:35:20,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2592 to 2146. [2022-07-22 22:35:20,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2146 states, 1599 states have (on average 1.3176985616010006) internal successors, (2107), 1619 states have internal predecessors, (2107), 425 states have call successors, (425), 122 states have call predecessors, (425), 121 states have return successors, (428), 421 states have call predecessors, (428), 423 states have call successors, (428) [2022-07-22 22:35:20,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 2960 transitions. [2022-07-22 22:35:20,903 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 2960 transitions. Word has length 51 [2022-07-22 22:35:20,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:35:20,903 INFO L495 AbstractCegarLoop]: Abstraction has 2146 states and 2960 transitions. [2022-07-22 22:35:20,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-22 22:35:20,904 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 2960 transitions. [2022-07-22 22:35:20,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-22 22:35:20,906 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:35:20,906 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:35:20,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 22:35:20,906 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:35:20,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:35:20,907 INFO L85 PathProgramCache]: Analyzing trace with hash 966613706, now seen corresponding path program 1 times [2022-07-22 22:35:20,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:35:20,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084822414] [2022-07-22 22:35:20,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:35:20,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:35:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:21,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:35:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:21,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 22:35:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:21,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:21,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 22:35:21,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:35:21,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084822414] [2022-07-22 22:35:21,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084822414] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:35:21,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:35:21,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 22:35:21,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421168185] [2022-07-22 22:35:21,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:35:21,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 22:35:21,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:35:21,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 22:35:21,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 22:35:21,042 INFO L87 Difference]: Start difference. First operand 2146 states and 2960 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-22 22:35:22,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:35:22,525 INFO L93 Difference]: Finished difference Result 4690 states and 6558 transitions. [2022-07-22 22:35:22,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 22:35:22,525 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 63 [2022-07-22 22:35:22,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:35:22,538 INFO L225 Difference]: With dead ends: 4690 [2022-07-22 22:35:22,538 INFO L226 Difference]: Without dead ends: 2598 [2022-07-22 22:35:22,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 22:35:22,545 INFO L413 NwaCegarLoop]: 1465 mSDtfsCounter, 738 mSDsluCounter, 1762 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 3227 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-22 22:35:22,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 3227 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-22 22:35:22,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2598 states. [2022-07-22 22:35:22,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2598 to 2147. [2022-07-22 22:35:22,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2147 states, 1600 states have (on average 1.3175) internal successors, (2108), 1620 states have internal predecessors, (2108), 425 states have call successors, (425), 122 states have call predecessors, (425), 121 states have return successors, (428), 421 states have call predecessors, (428), 423 states have call successors, (428) [2022-07-22 22:35:22,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 2961 transitions. [2022-07-22 22:35:22,632 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 2961 transitions. Word has length 63 [2022-07-22 22:35:22,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:35:22,634 INFO L495 AbstractCegarLoop]: Abstraction has 2147 states and 2961 transitions. [2022-07-22 22:35:22,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-22 22:35:22,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 2961 transitions. [2022-07-22 22:35:22,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-22 22:35:22,637 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:35:22,638 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 22:35:22,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 22:35:22,638 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:35:22,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:35:22,639 INFO L85 PathProgramCache]: Analyzing trace with hash 707532724, now seen corresponding path program 1 times [2022-07-22 22:35:22,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:35:22,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587847056] [2022-07-22 22:35:22,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:35:22,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:35:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:22,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 22:35:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:22,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:22,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 22:35:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:22,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-22 22:35:22,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:22,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 22:35:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:22,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:22,887 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 22:35:22,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:35:22,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587847056] [2022-07-22 22:35:22,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587847056] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:35:22,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425377459] [2022-07-22 22:35:22,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:35:22,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:35:22,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:35:22,890 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-22 22:35:22,893 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-22 22:35:23,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:23,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 22:35:23,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:35:23,564 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 22:35:23,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:35:23,662 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 22:35:23,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425377459] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 22:35:23,662 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 22:35:23,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2022-07-22 22:35:23,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960880847] [2022-07-22 22:35:23,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 22:35:23,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-22 22:35:23,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:35:23,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-22 22:35:23,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-07-22 22:35:23,665 INFO L87 Difference]: Start difference. First operand 2147 states and 2961 transitions. Second operand has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 11 states have internal predecessors, (98), 5 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-07-22 22:35:27,961 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-22 22:35:30,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:35:30,805 INFO L93 Difference]: Finished difference Result 4887 states and 6970 transitions. [2022-07-22 22:35:30,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 22:35:30,806 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 11 states have internal predecessors, (98), 5 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 87 [2022-07-22 22:35:30,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:35:30,825 INFO L225 Difference]: With dead ends: 4887 [2022-07-22 22:35:30,825 INFO L226 Difference]: Without dead ends: 2795 [2022-07-22 22:35:30,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-07-22 22:35:30,835 INFO L413 NwaCegarLoop]: 1400 mSDtfsCounter, 1002 mSDsluCounter, 4289 mSDsCounter, 0 mSdLazyCounter, 2770 mSolverCounterSat, 421 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1162 SdHoareTripleChecker+Valid, 5689 SdHoareTripleChecker+Invalid, 3192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 421 IncrementalHoareTripleChecker+Valid, 2770 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-07-22 22:35:30,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1162 Valid, 5689 Invalid, 3192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [421 Valid, 2770 Invalid, 1 Unknown, 0 Unchecked, 6.9s Time] [2022-07-22 22:35:30,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2795 states. [2022-07-22 22:35:30,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2795 to 2165. [2022-07-22 22:35:30,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2165 states, 1612 states have (on average 1.315136476426799) internal successors, (2120), 1632 states have internal predecessors, (2120), 431 states have call successors, (431), 122 states have call predecessors, (431), 121 states have return successors, (434), 427 states have call predecessors, (434), 429 states have call successors, (434) [2022-07-22 22:35:30,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2165 states to 2165 states and 2985 transitions. [2022-07-22 22:35:30,996 INFO L78 Accepts]: Start accepts. Automaton has 2165 states and 2985 transitions. Word has length 87 [2022-07-22 22:35:30,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:35:30,997 INFO L495 AbstractCegarLoop]: Abstraction has 2165 states and 2985 transitions. [2022-07-22 22:35:30,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 11 states have internal predecessors, (98), 5 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-07-22 22:35:30,997 INFO L276 IsEmpty]: Start isEmpty. Operand 2165 states and 2985 transitions. [2022-07-22 22:35:31,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-22 22:35:31,000 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:35:31,000 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:35:31,034 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-22 22:35:31,227 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,SelfDestructingSolverStorable5 [2022-07-22 22:35:31,228 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:35:31,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:35:31,228 INFO L85 PathProgramCache]: Analyzing trace with hash 2065381788, now seen corresponding path program 1 times [2022-07-22 22:35:31,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:35:31,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754521904] [2022-07-22 22:35:31,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:35:31,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:35:31,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:31,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 22:35:31,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:31,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:31,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 22:35:31,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:31,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:35:31,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:31,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:31,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-22 22:35:31,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:31,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-22 22:35:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:31,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:31,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:31,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 22:35:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:31,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 22:35:31,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:31,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:31,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:31,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-22 22:35:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:31,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-22 22:35:31,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:31,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-22 22:35:31,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:31,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:31,629 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-07-22 22:35:31,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:35:31,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754521904] [2022-07-22 22:35:31,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754521904] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:35:31,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339027978] [2022-07-22 22:35:31,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:35:31,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:35:31,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:35:31,636 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-22 22:35:31,638 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-22 22:35:32,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:32,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 1827 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 22:35:32,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:35:32,431 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 16 proven. 40 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-07-22 22:35:32,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:35:32,625 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-07-22 22:35:32,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339027978] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 22:35:32,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 22:35:32,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2022-07-22 22:35:32,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703599604] [2022-07-22 22:35:32,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 22:35:32,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-22 22:35:32,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:35:32,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-22 22:35:32,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=299, Unknown=0, NotChecked=0, Total=462 [2022-07-22 22:35:32,628 INFO L87 Difference]: Start difference. First operand 2165 states and 2985 transitions. Second operand has 22 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 20 states have internal predecessors, (127), 14 states have call successors, (37), 4 states have call predecessors, (37), 2 states have return successors, (31), 14 states have call predecessors, (31), 14 states have call successors, (31) [2022-07-22 22:35:37,060 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:35:40,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:35:40,063 INFO L93 Difference]: Finished difference Result 4911 states and 7003 transitions. [2022-07-22 22:35:40,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 22:35:40,063 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 20 states have internal predecessors, (127), 14 states have call successors, (37), 4 states have call predecessors, (37), 2 states have return successors, (31), 14 states have call predecessors, (31), 14 states have call successors, (31) Word has length 152 [2022-07-22 22:35:40,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:35:40,080 INFO L225 Difference]: With dead ends: 4911 [2022-07-22 22:35:40,081 INFO L226 Difference]: Without dead ends: 2819 [2022-07-22 22:35:40,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=202, Invalid=398, Unknown=0, NotChecked=0, Total=600 [2022-07-22 22:35:40,089 INFO L413 NwaCegarLoop]: 1412 mSDtfsCounter, 1069 mSDsluCounter, 7468 mSDsCounter, 0 mSdLazyCounter, 4697 mSolverCounterSat, 485 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1231 SdHoareTripleChecker+Valid, 8880 SdHoareTripleChecker+Invalid, 5182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 485 IncrementalHoareTripleChecker+Valid, 4697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-07-22 22:35:40,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1231 Valid, 8880 Invalid, 5182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [485 Valid, 4697 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2022-07-22 22:35:40,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2819 states. [2022-07-22 22:35:40,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2819 to 2189. [2022-07-22 22:35:40,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2189 states, 1628 states have (on average 1.3120393120393121) internal successors, (2136), 1648 states have internal predecessors, (2136), 439 states have call successors, (439), 122 states have call predecessors, (439), 121 states have return successors, (442), 435 states have call predecessors, (442), 437 states have call successors, (442) [2022-07-22 22:35:40,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2189 states to 2189 states and 3017 transitions. [2022-07-22 22:35:40,243 INFO L78 Accepts]: Start accepts. Automaton has 2189 states and 3017 transitions. Word has length 152 [2022-07-22 22:35:40,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:35:40,244 INFO L495 AbstractCegarLoop]: Abstraction has 2189 states and 3017 transitions. [2022-07-22 22:35:40,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 20 states have internal predecessors, (127), 14 states have call successors, (37), 4 states have call predecessors, (37), 2 states have return successors, (31), 14 states have call predecessors, (31), 14 states have call successors, (31) [2022-07-22 22:35:40,244 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 3017 transitions. [2022-07-22 22:35:40,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2022-07-22 22:35:40,247 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:35:40,247 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 22:35:40,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-22 22:35:40,461 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,SelfDestructingSolverStorable6 [2022-07-22 22:35:40,461 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:35:40,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:35:40,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1776723700, now seen corresponding path program 2 times [2022-07-22 22:35:40,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:35:40,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905975308] [2022-07-22 22:35:40,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:35:40,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:35:40,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:40,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 22:35:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:40,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:40,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:40,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 22:35:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:40,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:35:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:40,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:40,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:40,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-22 22:35:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:40,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-22 22:35:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:40,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:40,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:40,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 22:35:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:40,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 22:35:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:40,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:40,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:40,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-22 22:35:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:40,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-22 22:35:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:40,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:40,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:40,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-22 22:35:40,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:40,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-22 22:35:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:40,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:40,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-22 22:35:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:40,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-22 22:35:40,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:40,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:40,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:40,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-22 22:35:40,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:40,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-22 22:35:40,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:40,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:40,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-22 22:35:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:40,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-22 22:35:40,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:40,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-22 22:35:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:40,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:40,998 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 29 proven. 14 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked. [2022-07-22 22:35:40,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:35:40,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905975308] [2022-07-22 22:35:40,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905975308] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:35:40,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142052287] [2022-07-22 22:35:40,999 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 22:35:40,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:35:40,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:35:41,001 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 22:35:41,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 22:35:41,552 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-22 22:35:41,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 22:35:41,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 1047 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-22 22:35:41,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:35:41,706 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2022-07-22 22:35:41,706 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:35:41,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142052287] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:35:41,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:35:41,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2022-07-22 22:35:41,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115058628] [2022-07-22 22:35:41,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:35:41,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 22:35:41,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:35:41,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 22:35:41,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-22 22:35:41,709 INFO L87 Difference]: Start difference. First operand 2189 states and 3017 transitions. Second operand has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-22 22:35:43,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:35:43,054 INFO L93 Difference]: Finished difference Result 5268 states and 7285 transitions. [2022-07-22 22:35:43,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 22:35:43,055 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 248 [2022-07-22 22:35:43,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:35:43,080 INFO L225 Difference]: With dead ends: 5268 [2022-07-22 22:35:43,080 INFO L226 Difference]: Without dead ends: 4209 [2022-07-22 22:35:43,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2022-07-22 22:35:43,088 INFO L413 NwaCegarLoop]: 2816 mSDtfsCounter, 1662 mSDsluCounter, 12218 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1685 SdHoareTripleChecker+Valid, 15034 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-22 22:35:43,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1685 Valid, 15034 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-22 22:35:43,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4209 states. [2022-07-22 22:35:43,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4209 to 4155. [2022-07-22 22:35:43,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4155 states, 3084 states have (on average 1.3167963683527886) internal successors, (4061), 3123 states have internal predecessors, (4061), 833 states have call successors, (833), 236 states have call predecessors, (833), 237 states have return successors, (849), 827 states have call predecessors, (849), 831 states have call successors, (849) [2022-07-22 22:35:43,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4155 states to 4155 states and 5743 transitions. [2022-07-22 22:35:43,323 INFO L78 Accepts]: Start accepts. Automaton has 4155 states and 5743 transitions. Word has length 248 [2022-07-22 22:35:43,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:35:43,324 INFO L495 AbstractCegarLoop]: Abstraction has 4155 states and 5743 transitions. [2022-07-22 22:35:43,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-22 22:35:43,325 INFO L276 IsEmpty]: Start isEmpty. Operand 4155 states and 5743 transitions. [2022-07-22 22:35:43,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2022-07-22 22:35:43,329 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:35:43,329 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 22:35:43,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 22:35:43,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:35:43,556 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:35:43,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:35:43,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1557868982, now seen corresponding path program 1 times [2022-07-22 22:35:43,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:35:43,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118901845] [2022-07-22 22:35:43,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:35:43,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:35:43,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:43,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 22:35:43,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:43,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:43,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:43,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 22:35:43,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:43,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:35:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:43,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:43,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:43,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-22 22:35:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:43,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-22 22:35:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:43,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:43,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:43,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 22:35:43,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:43,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 22:35:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:43,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:43,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:43,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-22 22:35:43,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:43,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-22 22:35:43,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:43,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:43,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-22 22:35:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:43,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-22 22:35:43,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:43,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:43,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-22 22:35:43,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:44,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-22 22:35:44,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:44,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:44,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-22 22:35:44,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:44,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-22 22:35:44,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:44,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:44,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:44,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-22 22:35:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:44,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-22 22:35:44,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:44,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-22 22:35:44,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:44,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:44,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:44,065 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 712 trivial. 0 not checked. [2022-07-22 22:35:44,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:35:44,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118901845] [2022-07-22 22:35:44,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118901845] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:35:44,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:35:44,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 22:35:44,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063050391] [2022-07-22 22:35:44,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:35:44,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 22:35:44,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:35:44,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 22:35:44,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 22:35:44,068 INFO L87 Difference]: Start difference. First operand 4155 states and 5743 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 4 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-22 22:35:50,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:35:50,302 INFO L93 Difference]: Finished difference Result 8065 states and 11861 transitions. [2022-07-22 22:35:50,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 22:35:50,303 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 4 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 248 [2022-07-22 22:35:50,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:35:50,344 INFO L225 Difference]: With dead ends: 8065 [2022-07-22 22:35:50,344 INFO L226 Difference]: Without dead ends: 8062 [2022-07-22 22:35:50,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-22 22:35:50,348 INFO L413 NwaCegarLoop]: 2910 mSDtfsCounter, 5886 mSDsluCounter, 3324 mSDsCounter, 0 mSdLazyCounter, 3779 mSolverCounterSat, 2548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6354 SdHoareTripleChecker+Valid, 6234 SdHoareTripleChecker+Invalid, 6327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2548 IncrementalHoareTripleChecker+Valid, 3779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-07-22 22:35:50,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6354 Valid, 6234 Invalid, 6327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2548 Valid, 3779 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-07-22 22:35:50,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8062 states. [2022-07-22 22:35:50,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8062 to 6361. [2022-07-22 22:35:50,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6361 states, 4707 states have (on average 1.318249415763756) internal successors, (6205), 4778 states have internal predecessors, (6205), 1285 states have call successors, (1285), 349 states have call predecessors, (1285), 368 states have return successors, (1386), 1289 states have call predecessors, (1386), 1283 states have call successors, (1386) [2022-07-22 22:35:50,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6361 states to 6361 states and 8876 transitions. [2022-07-22 22:35:50,677 INFO L78 Accepts]: Start accepts. Automaton has 6361 states and 8876 transitions. Word has length 248 [2022-07-22 22:35:50,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:35:50,677 INFO L495 AbstractCegarLoop]: Abstraction has 6361 states and 8876 transitions. [2022-07-22 22:35:50,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 4 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-22 22:35:50,678 INFO L276 IsEmpty]: Start isEmpty. Operand 6361 states and 8876 transitions. [2022-07-22 22:35:50,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2022-07-22 22:35:50,683 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:35:50,683 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 22:35:50,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 22:35:50,683 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:35:50,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:35:50,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1635323117, now seen corresponding path program 1 times [2022-07-22 22:35:50,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:35:50,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677653856] [2022-07-22 22:35:50,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:35:50,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:35:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:50,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 22:35:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:50,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:50,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 22:35:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:50,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:35:50,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:50,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:50,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:50,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-22 22:35:50,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:50,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-22 22:35:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:50,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:50,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 22:35:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:50,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 22:35:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:50,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:50,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-22 22:35:50,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:50,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-22 22:35:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:51,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:51,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-22 22:35:51,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:51,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-22 22:35:51,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:51,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:51,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:51,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-22 22:35:51,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:51,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-22 22:35:51,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:51,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:51,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-22 22:35:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:51,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-22 22:35:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:51,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:51,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:51,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-22 22:35:51,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:51,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-22 22:35:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:51,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-22 22:35:51,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:51,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-07-22 22:35:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:51,102 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2022-07-22 22:35:51,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:35:51,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677653856] [2022-07-22 22:35:51,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677653856] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:35:51,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:35:51,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 22:35:51,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911653298] [2022-07-22 22:35:51,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:35:51,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 22:35:51,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:35:51,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 22:35:51,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 22:35:51,104 INFO L87 Difference]: Start difference. First operand 6361 states and 8876 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 3 states have internal predecessors, (70), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-22 22:35:53,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:35:53,482 INFO L93 Difference]: Finished difference Result 14925 states and 21806 transitions. [2022-07-22 22:35:53,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 22:35:53,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 3 states have internal predecessors, (70), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 254 [2022-07-22 22:35:53,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:35:53,523 INFO L225 Difference]: With dead ends: 14925 [2022-07-22 22:35:53,524 INFO L226 Difference]: Without dead ends: 8671 [2022-07-22 22:35:53,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 22:35:53,551 INFO L413 NwaCegarLoop]: 1459 mSDtfsCounter, 1201 mSDsluCounter, 1800 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 675 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1353 SdHoareTripleChecker+Valid, 3259 SdHoareTripleChecker+Invalid, 1913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 675 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-22 22:35:53,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1353 Valid, 3259 Invalid, 1913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [675 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-22 22:35:53,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8671 states. [2022-07-22 22:35:53,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8671 to 7004. [2022-07-22 22:35:53,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7004 states, 5188 states have (on average 1.3299922898997687) internal successors, (6900), 5271 states have internal predecessors, (6900), 1447 states have call successors, (1447), 349 states have call predecessors, (1447), 368 states have return successors, (1586), 1445 states have call predecessors, (1586), 1445 states have call successors, (1586) [2022-07-22 22:35:53,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7004 states to 7004 states and 9933 transitions. [2022-07-22 22:35:53,920 INFO L78 Accepts]: Start accepts. Automaton has 7004 states and 9933 transitions. Word has length 254 [2022-07-22 22:35:53,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:35:53,921 INFO L495 AbstractCegarLoop]: Abstraction has 7004 states and 9933 transitions. [2022-07-22 22:35:53,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 3 states have internal predecessors, (70), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-22 22:35:53,921 INFO L276 IsEmpty]: Start isEmpty. Operand 7004 states and 9933 transitions. [2022-07-22 22:35:53,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2022-07-22 22:35:53,926 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:35:53,926 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 22:35:53,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-22 22:35:53,927 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:35:53,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:35:53,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1210188346, now seen corresponding path program 1 times [2022-07-22 22:35:53,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:35:53,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734009213] [2022-07-22 22:35:53,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:35:53,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:35:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:54,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 22:35:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:54,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:54,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:54,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 22:35:54,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:54,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:35:54,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:54,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:54,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-22 22:35:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:54,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-22 22:35:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:54,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:54,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:54,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 22:35:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:54,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 22:35:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:54,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:54,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:54,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-22 22:35:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:54,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-22 22:35:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:54,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:54,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-22 22:35:54,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:54,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-22 22:35:54,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:54,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:54,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:54,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-22 22:35:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:54,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-22 22:35:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:54,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:54,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-22 22:35:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:54,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-22 22:35:54,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:54,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:54,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-22 22:35:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:54,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-22 22:35:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:54,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2022-07-22 22:35:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:54,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-07-22 22:35:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:54,362 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 29 proven. 14 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2022-07-22 22:35:54,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:35:54,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734009213] [2022-07-22 22:35:54,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734009213] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:35:54,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624783642] [2022-07-22 22:35:54,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:35:54,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:35:54,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:35:54,364 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 22:35:54,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-22 22:35:55,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:55,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 2714 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-22 22:35:55,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:35:55,245 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2022-07-22 22:35:55,245 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:35:55,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624783642] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:35:55,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:35:55,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-22 22:35:55,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443945587] [2022-07-22 22:35:55,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:35:55,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 22:35:55,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:35:55,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 22:35:55,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 22:35:55,248 INFO L87 Difference]: Start difference. First operand 7004 states and 9933 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-22 22:35:55,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:35:55,635 INFO L93 Difference]: Finished difference Result 14011 states and 19874 transitions. [2022-07-22 22:35:55,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 22:35:55,636 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 256 [2022-07-22 22:35:55,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:35:55,665 INFO L225 Difference]: With dead ends: 14011 [2022-07-22 22:35:55,666 INFO L226 Difference]: Without dead ends: 6993 [2022-07-22 22:35:55,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 22:35:55,689 INFO L413 NwaCegarLoop]: 1530 mSDtfsCounter, 0 mSDsluCounter, 4578 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6108 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 22:35:55,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6108 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 22:35:55,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6993 states. [2022-07-22 22:35:55,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6993 to 6993. [2022-07-22 22:35:55,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6993 states, 5181 states have (on average 1.3298591005597376) internal successors, (6890), 5263 states have internal predecessors, (6890), 1445 states have call successors, (1445), 347 states have call predecessors, (1445), 366 states have return successors, (1584), 1443 states have call predecessors, (1584), 1443 states have call successors, (1584) [2022-07-22 22:35:56,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6993 states to 6993 states and 9919 transitions. [2022-07-22 22:35:56,007 INFO L78 Accepts]: Start accepts. Automaton has 6993 states and 9919 transitions. Word has length 256 [2022-07-22 22:35:56,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:35:56,007 INFO L495 AbstractCegarLoop]: Abstraction has 6993 states and 9919 transitions. [2022-07-22 22:35:56,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-22 22:35:56,008 INFO L276 IsEmpty]: Start isEmpty. Operand 6993 states and 9919 transitions. [2022-07-22 22:35:56,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2022-07-22 22:35:56,015 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:35:56,016 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 22:35:56,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-22 22:35:56,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:35:56,233 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:35:56,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:35:56,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1841619178, now seen corresponding path program 1 times [2022-07-22 22:35:56,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:35:56,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492928160] [2022-07-22 22:35:56,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:35:56,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:35:56,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:56,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 22:35:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:56,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:56,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:56,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 22:35:56,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:56,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-22 22:35:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:56,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 22:35:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:56,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 22:35:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:56,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-22 22:35:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:56,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:56,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 22:35:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:56,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-22 22:35:56,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:56,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 22:35:57,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:57,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-22 22:35:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:57,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-22 22:35:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:57,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:57,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:57,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 22:35:57,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:57,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-22 22:35:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:57,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 22:35:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:57,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-22 22:35:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:57,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-22 22:35:57,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:57,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:57,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:57,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 22:35:57,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:57,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-22 22:35:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:57,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 22:35:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:57,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-22 22:35:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:57,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-22 22:35:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:57,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:57,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:57,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 22:35:57,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:57,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-22 22:35:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:57,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 22:35:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:57,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-22 22:35:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:57,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-07-22 22:35:57,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:57,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:57,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:57,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 22:35:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:57,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-22 22:35:57,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:57,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 22:35:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:57,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-07-22 22:35:57,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:57,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-07-22 22:35:57,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:57,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:57,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 22:35:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:57,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-22 22:35:57,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:57,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 22:35:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:57,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2022-07-22 22:35:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:57,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2022-07-22 22:35:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:57,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:57,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 22:35:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:57,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-22 22:35:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:57,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 22:35:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:57,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2022-07-22 22:35:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:57,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 404 [2022-07-22 22:35:57,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:57,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 416 [2022-07-22 22:35:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:57,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 422 [2022-07-22 22:35:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:57,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2092 backedges. 15 proven. 186 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2022-07-22 22:35:57,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:35:57,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492928160] [2022-07-22 22:35:57,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492928160] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:35:57,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586194396] [2022-07-22 22:35:57,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:35:57,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:35:57,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:35:57,304 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 22:35:57,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-22 22:35:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:58,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 4690 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-22 22:35:58,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:35:58,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2092 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2022-07-22 22:35:58,827 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:35:58,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586194396] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:35:58,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:35:58,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 10 [2022-07-22 22:35:58,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339459234] [2022-07-22 22:35:58,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:35:58,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 22:35:58,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:35:58,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 22:35:58,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-22 22:35:58,832 INFO L87 Difference]: Start difference. First operand 6993 states and 9919 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-22 22:35:59,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:35:59,202 INFO L93 Difference]: Finished difference Result 13986 states and 19859 transitions. [2022-07-22 22:35:59,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 22:35:59,203 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 440 [2022-07-22 22:35:59,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:35:59,237 INFO L225 Difference]: With dead ends: 13986 [2022-07-22 22:35:59,237 INFO L226 Difference]: Without dead ends: 7001 [2022-07-22 22:35:59,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 541 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-07-22 22:35:59,260 INFO L413 NwaCegarLoop]: 1517 mSDtfsCounter, 6 mSDsluCounter, 9082 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 10599 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:35:59,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 10599 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 22:35:59,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7001 states. [2022-07-22 22:35:59,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7001 to 6995. [2022-07-22 22:35:59,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6995 states, 5182 states have (on average 1.3297954457738326) internal successors, (6891), 5265 states have internal predecessors, (6891), 1445 states have call successors, (1445), 347 states have call predecessors, (1445), 367 states have return successors, (1590), 1443 states have call predecessors, (1590), 1443 states have call successors, (1590) [2022-07-22 22:35:59,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6995 states to 6995 states and 9926 transitions. [2022-07-22 22:35:59,581 INFO L78 Accepts]: Start accepts. Automaton has 6995 states and 9926 transitions. Word has length 440 [2022-07-22 22:35:59,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:35:59,582 INFO L495 AbstractCegarLoop]: Abstraction has 6995 states and 9926 transitions. [2022-07-22 22:35:59,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-22 22:35:59,582 INFO L276 IsEmpty]: Start isEmpty. Operand 6995 states and 9926 transitions. [2022-07-22 22:35:59,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2022-07-22 22:35:59,592 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:35:59,593 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 16, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 22:35:59,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-22 22:35:59,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-22 22:35:59,820 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:35:59,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:35:59,820 INFO L85 PathProgramCache]: Analyzing trace with hash -969582626, now seen corresponding path program 1 times [2022-07-22 22:35:59,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:35:59,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569918427] [2022-07-22 22:35:59,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:35:59,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:36:00,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 22:36:00,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:36:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:36:00,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 22:36:00,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 22:36:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:36:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-22 22:36:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-22 22:36:00,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:36:00,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:36:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 22:36:00,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 22:36:00,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:36:00,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-22 22:36:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 22:36:00,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:36:00,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:36:00,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 22:36:00,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 22:36:00,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:36:00,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-22 22:36:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-22 22:36:00,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:36:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:36:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 22:36:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 22:36:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:36:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-22 22:36:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-07-22 22:36:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:36:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:36:00,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 22:36:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 22:36:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:36:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-22 22:36:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-22 22:36:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:36:00,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:36:00,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 22:36:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 22:36:00,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:36:00,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2022-07-22 22:36:00,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2022-07-22 22:36:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:36:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:36:00,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 22:36:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 22:36:00,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:36:00,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 382 [2022-07-22 22:36:00,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 389 [2022-07-22 22:36:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:36:00,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:36:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 22:36:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 22:36:00,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:36:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 436 [2022-07-22 22:36:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 460 [2022-07-22 22:36:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 472 [2022-07-22 22:36:00,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 478 [2022-07-22 22:36:00,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:00,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 19 proven. 112 refuted. 0 times theorem prover too weak. 2157 trivial. 0 not checked. [2022-07-22 22:36:00,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:36:00,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569918427] [2022-07-22 22:36:00,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569918427] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:36:00,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614373286] [2022-07-22 22:36:00,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:36:00,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:36:00,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:36:00,888 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 22:36:00,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-22 22:36:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:03,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 4986 conjuncts, 76 conjunts are in the unsatisfiable core [2022-07-22 22:36:03,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:36:03,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 22:36:03,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 317 proven. 2 refuted. 0 times theorem prover too weak. 1969 trivial. 0 not checked. [2022-07-22 22:36:03,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:36:04,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 17 proven. 142 refuted. 0 times theorem prover too weak. 2129 trivial. 0 not checked. [2022-07-22 22:36:04,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614373286] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 22:36:04,391 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 22:36:04,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 6] total 22 [2022-07-22 22:36:04,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396674627] [2022-07-22 22:36:04,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 22:36:04,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-22 22:36:04,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:36:04,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-22 22:36:04,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2022-07-22 22:36:04,393 INFO L87 Difference]: Start difference. First operand 6995 states and 9926 transitions. Second operand has 22 states, 22 states have (on average 6.954545454545454) internal successors, (153), 16 states have internal predecessors, (153), 4 states have call successors, (35), 4 states have call predecessors, (35), 5 states have return successors, (28), 7 states have call predecessors, (28), 4 states have call successors, (28) [2022-07-22 22:36:13,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:36:13,590 INFO L93 Difference]: Finished difference Result 15645 states and 22950 transitions. [2022-07-22 22:36:13,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-22 22:36:13,590 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.954545454545454) internal successors, (153), 16 states have internal predecessors, (153), 4 states have call successors, (35), 4 states have call predecessors, (35), 5 states have return successors, (28), 7 states have call predecessors, (28), 4 states have call successors, (28) Word has length 496 [2022-07-22 22:36:13,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:36:13,635 INFO L225 Difference]: With dead ends: 15645 [2022-07-22 22:36:13,635 INFO L226 Difference]: Without dead ends: 8657 [2022-07-22 22:36:13,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1127 GetRequests, 1095 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=911, Unknown=0, NotChecked=0, Total=1056 [2022-07-22 22:36:13,661 INFO L413 NwaCegarLoop]: 1385 mSDtfsCounter, 703 mSDsluCounter, 15147 mSDsCounter, 0 mSdLazyCounter, 9490 mSolverCounterSat, 347 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 16532 SdHoareTripleChecker+Invalid, 9837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 347 IncrementalHoareTripleChecker+Valid, 9490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-07-22 22:36:13,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 16532 Invalid, 9837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [347 Valid, 9490 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2022-07-22 22:36:13,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8657 states. [2022-07-22 22:36:14,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8657 to 6995. [2022-07-22 22:36:14,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6995 states, 5182 states have (on average 1.3297954457738326) internal successors, (6891), 5265 states have internal predecessors, (6891), 1445 states have call successors, (1445), 347 states have call predecessors, (1445), 367 states have return successors, (1588), 1443 states have call predecessors, (1588), 1443 states have call successors, (1588) [2022-07-22 22:36:14,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6995 states to 6995 states and 9924 transitions. [2022-07-22 22:36:14,082 INFO L78 Accepts]: Start accepts. Automaton has 6995 states and 9924 transitions. Word has length 496 [2022-07-22 22:36:14,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:36:14,082 INFO L495 AbstractCegarLoop]: Abstraction has 6995 states and 9924 transitions. [2022-07-22 22:36:14,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.954545454545454) internal successors, (153), 16 states have internal predecessors, (153), 4 states have call successors, (35), 4 states have call predecessors, (35), 5 states have return successors, (28), 7 states have call predecessors, (28), 4 states have call successors, (28) [2022-07-22 22:36:14,083 INFO L276 IsEmpty]: Start isEmpty. Operand 6995 states and 9924 transitions. [2022-07-22 22:36:14,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2022-07-22 22:36:14,089 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:36:14,089 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 22:36:14,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-22 22:36:14,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:36:14,303 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:36:14,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:36:14,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1290540974, now seen corresponding path program 1 times [2022-07-22 22:36:14,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:36:14,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209757826] [2022-07-22 22:36:14,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:36:14,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:36:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:18,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 22:36:18,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:22,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:36:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:22,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:36:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:22,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 22:36:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:22,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:36:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:22,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:36:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:22,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:36:22,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:22,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 22:36:22,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:22,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-22 22:36:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:22,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-22 22:36:22,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:26,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:36:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:26,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:36:26,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:26,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 22:36:26,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:26,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:36:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:26,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:36:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:27,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:36:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:27,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 22:36:27,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:27,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-22 22:36:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:27,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-22 22:36:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:29,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:36:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:29,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:36:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:29,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 22:36:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:29,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:36:29,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:29,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:36:29,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:29,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:36:29,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:29,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 22:36:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:29,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-22 22:36:29,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:29,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-07-22 22:36:29,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:32,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:36:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:32,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:36:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:32,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 22:36:32,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:32,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:36:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:32,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:36:32,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:32,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:36:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:32,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 22:36:32,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:32,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2022-07-22 22:36:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:32,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2022-07-22 22:36:32,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:35,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:36:35,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:35,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:36:35,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:35,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 22:36:35,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:35,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:36:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:35,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:36:35,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:36,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:36:36,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:36,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 22:36:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:36,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2022-07-22 22:36:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:36,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2022-07-22 22:36:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:38,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:36:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:38,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:36:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:38,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 22:36:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:38,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:36:38,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:38,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:36:38,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:39,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:36:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:39,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 22:36:39,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:39,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 412 [2022-07-22 22:36:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:39,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 419 [2022-07-22 22:36:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:42,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:36:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:42,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:36:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:42,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 22:36:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:42,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:36:42,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:42,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:36:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:42,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:36:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:42,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 22:36:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:42,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 480 [2022-07-22 22:36:42,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:42,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 487 [2022-07-22 22:36:42,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:47,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:36:47,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:47,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:36:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:47,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 22:36:47,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:47,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:36:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:47,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:36:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:47,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:36:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:47,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 22:36:47,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:47,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 548 [2022-07-22 22:36:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:47,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 572 [2022-07-22 22:36:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:47,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 584 [2022-07-22 22:36:47,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:47,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 590 [2022-07-22 22:36:47,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:47,863 INFO L134 CoverageAnalysis]: Checked inductivity of 4024 backedges. 476 proven. 1497 refuted. 0 times theorem prover too weak. 2051 trivial. 0 not checked. [2022-07-22 22:36:47,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:36:47,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209757826] [2022-07-22 22:36:47,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209757826] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:36:47,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183415578] [2022-07-22 22:36:47,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:36:47,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:36:47,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:36:47,868 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 22:36:47,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-22 22:37:30,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:30,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 5578 conjuncts, 774 conjunts are in the unsatisfiable core [2022-07-22 22:37:31,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:37:31,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:31,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 22:37:31,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:31,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 22:37:31,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-22 22:37:31,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-22 22:37:31,876 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-22 22:37:31,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 22 [2022-07-22 22:37:32,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-22 22:37:35,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:35,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:35,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:35,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:35,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:35,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:35,168 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-22 22:37:35,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 25 [2022-07-22 22:37:35,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-22 22:37:37,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:37,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:37,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:37,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:37,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:37,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:37,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:37,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:37,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:37,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:37,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:37,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:37,058 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-07-22 22:37:37,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 32 [2022-07-22 22:37:37,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 22:37:37,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 22:37:37,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-22 22:37:41,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:41,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:41,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:41,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:41,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:41,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:41,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:41,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:41,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:41,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:41,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:41,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:41,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:41,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:41,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:41,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:41,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:41,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:41,546 INFO L356 Elim1Store]: treesize reduction 129, result has 17.8 percent of original size [2022-07-22 22:37:41,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 143 treesize of output 145 [2022-07-22 22:37:41,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 22:37:41,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 22:37:45,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:45,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:45,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:45,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:45,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:45,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:45,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:45,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:45,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:45,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:45,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:45,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:45,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:45,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:45,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:45,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:45,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:45,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:45,491 INFO L356 Elim1Store]: treesize reduction 573, result has 16.7 percent of original size [2022-07-22 22:37:45,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 12 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 35 case distinctions, treesize of input 121 treesize of output 197 [2022-07-22 22:37:45,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:45,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-07-22 22:37:45,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:45,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-07-22 22:37:46,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2022-07-22 22:37:46,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-22 22:37:46,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-22 22:37:47,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-22 22:37:51,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:51,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:51,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:51,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 22:37:51,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-22 22:37:55,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:55,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:55,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:55,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:55,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:55,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:55,139 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 22:37:55,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 11 [2022-07-22 22:37:55,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 22:37:55,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 22:37:55,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-22 22:38:02,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:02,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:02,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:02,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:02,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:02,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:02,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:02,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:02,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:02,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:02,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:02,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:02,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:02,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:02,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:02,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:02,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:02,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:02,494 INFO L356 Elim1Store]: treesize reduction 101, result has 24.1 percent of original size [2022-07-22 22:38:02,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 49 treesize of output 63 [2022-07-22 22:38:02,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 22:38:02,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 22:38:08,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:08,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:08,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:08,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:08,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:08,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:08,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:08,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:08,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:08,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:08,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:08,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:08,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:08,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:08,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:08,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:08,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:08,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:08,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:08,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:08,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:08,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:08,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:08,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:09,225 INFO L356 Elim1Store]: treesize reduction 601, result has 19.7 percent of original size [2022-07-22 22:38:09,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 25 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 29 case distinctions, treesize of input 83 treesize of output 193 [2022-07-22 22:38:09,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-07-22 22:38:09,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-07-22 22:38:13,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-22 22:38:13,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-22 22:38:13,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 42 [2022-07-22 22:38:15,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-22 22:38:26,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:26,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:26,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:26,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 22:38:26,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-22 22:38:33,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:33,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:33,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:33,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:33,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:33,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:33,446 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 22:38:33,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 11 [2022-07-22 22:38:33,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 22:38:33,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 22:38:34,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-22 22:38:52,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:52,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:52,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:52,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:52,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:52,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:52,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:52,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:52,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:52,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:52,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:52,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:52,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:52,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:52,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:52,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:52,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:52,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:52,578 INFO L356 Elim1Store]: treesize reduction 112, result has 15.8 percent of original size [2022-07-22 22:38:52,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 49 treesize of output 52 [2022-07-22 22:38:52,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 22:38:52,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5