./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 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.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-?-6c24879 [2022-07-12 11:18:10,799 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 11:18:10,801 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 11:18:10,846 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 11:18:10,846 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 11:18:10,848 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 11:18:10,849 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 11:18:10,851 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 11:18:10,853 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 11:18:10,857 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 11:18:10,858 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 11:18:10,860 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 11:18:10,860 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 11:18:10,862 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 11:18:10,864 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 11:18:10,867 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 11:18:10,868 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 11:18:10,869 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 11:18:10,870 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 11:18:10,875 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 11:18:10,877 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 11:18:10,878 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 11:18:10,879 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 11:18:10,880 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 11:18:10,881 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 11:18:10,887 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 11:18:10,888 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 11:18:10,888 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 11:18:10,889 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 11:18:10,890 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 11:18:10,892 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 11:18:10,892 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 11:18:10,893 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 11:18:10,894 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 11:18:10,895 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 11:18:10,895 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 11:18:10,895 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 11:18:10,896 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 11:18:10,896 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 11:18:10,896 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 11:18:10,897 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 11:18:10,899 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 11:18:10,900 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 11:18:10,931 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 11:18:10,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 11:18:10,932 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 11:18:10,933 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 11:18:10,933 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 11:18:10,933 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 11:18:10,934 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 11:18:10,934 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 11:18:10,934 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 11:18:10,935 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 11:18:10,936 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 11:18:10,936 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 11:18:10,936 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 11:18:10,936 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 11:18:10,936 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 11:18:10,936 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 11:18:10,937 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 11:18:10,937 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 11:18:10,937 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 11:18:10,937 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 11:18:10,938 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 11:18:10,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:18:10,938 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 11:18:10,938 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 11:18:10,938 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 11:18:10,939 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 11:18:10,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 11:18:10,939 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 11:18:10,939 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 11:18:10,939 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 11:18:10,940 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-12 11:18:11,166 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 11:18:11,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 11:18:11,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 11:18:11,198 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 11:18:11,199 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 11:18:11,200 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-12 11:18:11,269 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e520aa33/167cb867d94946a583f14ec90c9a9637/FLAG1ea746632 [2022-07-12 11:18:11,926 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 11:18:11,927 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-12 11:18:11,959 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e520aa33/167cb867d94946a583f14ec90c9a9637/FLAG1ea746632 [2022-07-12 11:18:12,272 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e520aa33/167cb867d94946a583f14ec90c9a9637 [2022-07-12 11:18:12,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 11:18:12,277 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 11:18:12,280 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 11:18:12,280 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 11:18:12,283 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 11:18:12,284 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:18:12" (1/1) ... [2022-07-12 11:18:12,284 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5649d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:18:12, skipping insertion in model container [2022-07-12 11:18:12,285 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:18:12" (1/1) ... [2022-07-12 11:18:12,291 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 11:18:12,375 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 11:18:13,680 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-12 11:18:13,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:18:13,746 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 11:18:14,055 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-12 11:18:14,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:18:14,136 INFO L208 MainTranslator]: Completed translation [2022-07-12 11:18:14,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:18:14 WrapperNode [2022-07-12 11:18:14,137 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 11:18:14,138 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 11:18:14,138 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 11:18:14,139 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 11:18:14,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:18:14" (1/1) ... [2022-07-12 11:18:14,194 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:18:14" (1/1) ... [2022-07-12 11:18:14,316 INFO L137 Inliner]: procedures = 236, calls = 1201, calls flagged for inlining = 124, calls inlined = 121, statements flattened = 3745 [2022-07-12 11:18:14,317 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 11:18:14,318 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 11:18:14,318 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 11:18:14,318 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 11:18:14,327 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:18:14" (1/1) ... [2022-07-12 11:18:14,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:18:14" (1/1) ... [2022-07-12 11:18:14,360 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:18:14" (1/1) ... [2022-07-12 11:18:14,364 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:18:14" (1/1) ... [2022-07-12 11:18:14,469 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:18:14" (1/1) ... [2022-07-12 11:18:14,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:18:14" (1/1) ... [2022-07-12 11:18:14,498 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:18:14" (1/1) ... [2022-07-12 11:18:14,534 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 11:18:14,536 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 11:18:14,536 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 11:18:14,536 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 11:18:14,537 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:18:14" (1/1) ... [2022-07-12 11:18:14,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:18:14,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:18:14,564 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 11:18:14,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 11:18:14,606 INFO L130 BoogieDeclarations]: Found specification of procedure bio_endio [2022-07-12 11:18:14,606 INFO L138 BoogieDeclarations]: Found implementation of procedure bio_endio [2022-07-12 11:18:14,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 11:18:14,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 11:18:14,607 INFO L130 BoogieDeclarations]: Found specification of procedure vfs_fsync [2022-07-12 11:18:14,607 INFO L138 BoogieDeclarations]: Found implementation of procedure vfs_fsync [2022-07-12 11:18:14,607 INFO L130 BoogieDeclarations]: Found specification of procedure lowmem_page_address [2022-07-12 11:18:14,607 INFO L138 BoogieDeclarations]: Found implementation of procedure lowmem_page_address [2022-07-12 11:18:14,607 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-07-12 11:18:14,607 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-07-12 11:18:14,607 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 11:18:14,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 11:18:14,608 INFO L130 BoogieDeclarations]: Found specification of procedure add_disk [2022-07-12 11:18:14,608 INFO L138 BoogieDeclarations]: Found implementation of procedure add_disk [2022-07-12 11:18:14,608 INFO L130 BoogieDeclarations]: Found specification of procedure kobject_uevent [2022-07-12 11:18:14,608 INFO L138 BoogieDeclarations]: Found implementation of procedure kobject_uevent [2022-07-12 11:18:14,608 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2022-07-12 11:18:14,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2022-07-12 11:18:14,609 INFO L130 BoogieDeclarations]: Found specification of procedure transfer_xor [2022-07-12 11:18:14,609 INFO L138 BoogieDeclarations]: Found implementation of procedure transfer_xor [2022-07-12 11:18:14,609 INFO L130 BoogieDeclarations]: Found specification of procedure invalidate_bdev [2022-07-12 11:18:14,609 INFO L138 BoogieDeclarations]: Found implementation of procedure invalidate_bdev [2022-07-12 11:18:14,609 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2022-07-12 11:18:14,609 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2022-07-12 11:18:14,609 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-12 11:18:14,610 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-12 11:18:14,610 INFO L130 BoogieDeclarations]: Found specification of procedure huge_encode_dev [2022-07-12 11:18:14,610 INFO L138 BoogieDeclarations]: Found implementation of procedure huge_encode_dev [2022-07-12 11:18:14,610 INFO L130 BoogieDeclarations]: Found specification of procedure lo_do_transfer [2022-07-12 11:18:14,610 INFO L138 BoogieDeclarations]: Found implementation of procedure lo_do_transfer [2022-07-12 11:18:14,610 INFO L130 BoogieDeclarations]: Found specification of procedure loop_sysfs_exit [2022-07-12 11:18:14,610 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_sysfs_exit [2022-07-12 11:18:14,611 INFO L130 BoogieDeclarations]: Found specification of procedure set_capacity [2022-07-12 11:18:14,611 INFO L138 BoogieDeclarations]: Found implementation of procedure set_capacity [2022-07-12 11:18:14,611 INFO L130 BoogieDeclarations]: Found specification of procedure kthread_should_stop [2022-07-12 11:18:14,611 INFO L138 BoogieDeclarations]: Found implementation of procedure kthread_should_stop [2022-07-12 11:18:14,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-12 11:18:14,611 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-12 11:18:14,611 INFO L130 BoogieDeclarations]: Found specification of procedure loop_alloc [2022-07-12 11:18:14,612 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_alloc [2022-07-12 11:18:14,612 INFO L130 BoogieDeclarations]: Found specification of procedure loop_make_request [2022-07-12 11:18:14,612 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_make_request [2022-07-12 11:18:14,612 INFO L130 BoogieDeclarations]: Found specification of procedure __do_lo_send_write [2022-07-12 11:18:14,612 INFO L138 BoogieDeclarations]: Found implementation of procedure __do_lo_send_write [2022-07-12 11:18:14,612 INFO L130 BoogieDeclarations]: Found specification of procedure loop_get_status [2022-07-12 11:18:14,613 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_get_status [2022-07-12 11:18:14,613 INFO L130 BoogieDeclarations]: Found specification of procedure loop_clr_fd [2022-07-12 11:18:14,613 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_clr_fd [2022-07-12 11:18:14,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 11:18:14,613 INFO L130 BoogieDeclarations]: Found specification of procedure figure_loop_size [2022-07-12 11:18:14,613 INFO L138 BoogieDeclarations]: Found implementation of procedure figure_loop_size [2022-07-12 11:18:14,613 INFO L130 BoogieDeclarations]: Found specification of procedure ioctl_by_bdev [2022-07-12 11:18:14,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ioctl_by_bdev [2022-07-12 11:18:14,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 11:18:14,614 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-07-12 11:18:14,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-07-12 11:18:14,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 11:18:14,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 11:18:14,616 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-12 11:18:14,616 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-12 11:18:14,617 INFO L130 BoogieDeclarations]: Found specification of procedure capable [2022-07-12 11:18:14,617 INFO L138 BoogieDeclarations]: Found implementation of procedure capable [2022-07-12 11:18:14,617 INFO L130 BoogieDeclarations]: Found specification of procedure fput [2022-07-12 11:18:14,617 INFO L138 BoogieDeclarations]: Found implementation of procedure fput [2022-07-12 11:18:14,617 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2022-07-12 11:18:14,617 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2022-07-12 11:18:14,617 INFO L130 BoogieDeclarations]: Found specification of procedure loop_set_capacity [2022-07-12 11:18:14,618 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_set_capacity [2022-07-12 11:18:14,618 INFO L130 BoogieDeclarations]: Found specification of procedure bio_list_empty [2022-07-12 11:18:14,618 INFO L138 BoogieDeclarations]: Found implementation of procedure bio_list_empty [2022-07-12 11:18:14,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-12 11:18:14,618 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-07-12 11:18:14,619 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-07-12 11:18:14,619 INFO L130 BoogieDeclarations]: Found specification of procedure loop_free [2022-07-12 11:18:14,619 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_free [2022-07-12 11:18:14,619 INFO L130 BoogieDeclarations]: Found specification of procedure transfer_none [2022-07-12 11:18:14,619 INFO L138 BoogieDeclarations]: Found implementation of procedure transfer_none [2022-07-12 11:18:14,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 11:18:14,619 INFO L130 BoogieDeclarations]: Found specification of procedure bd_set_size [2022-07-12 11:18:14,620 INFO L138 BoogieDeclarations]: Found implementation of procedure bd_set_size [2022-07-12 11:18:14,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 11:18:14,620 INFO L130 BoogieDeclarations]: Found specification of procedure fget [2022-07-12 11:18:14,620 INFO L138 BoogieDeclarations]: Found implementation of procedure fget [2022-07-12 11:18:14,620 INFO L130 BoogieDeclarations]: Found specification of procedure mapping_set_gfp_mask [2022-07-12 11:18:14,620 INFO L138 BoogieDeclarations]: Found implementation of procedure mapping_set_gfp_mask [2022-07-12 11:18:14,620 INFO L130 BoogieDeclarations]: Found specification of procedure xor_init [2022-07-12 11:18:14,620 INFO L138 BoogieDeclarations]: Found implementation of procedure xor_init [2022-07-12 11:18:14,621 INFO L130 BoogieDeclarations]: Found specification of procedure kmap [2022-07-12 11:18:14,621 INFO L138 BoogieDeclarations]: Found implementation of procedure kmap [2022-07-12 11:18:14,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-12 11:18:14,621 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-12 11:18:14,622 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-12 11:18:14,622 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-12 11:18:14,622 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_blkdev [2022-07-12 11:18:14,622 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_blkdev [2022-07-12 11:18:14,623 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2022-07-12 11:18:14,623 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2022-07-12 11:18:14,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 11:18:14,623 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-07-12 11:18:14,623 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-07-12 11:18:14,624 INFO L130 BoogieDeclarations]: Found specification of procedure __kmap_atomic [2022-07-12 11:18:14,624 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmap_atomic [2022-07-12 11:18:14,624 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irq [2022-07-12 11:18:14,624 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irq [2022-07-12 11:18:14,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 11:18:14,624 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2022-07-12 11:18:14,625 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2022-07-12 11:18:14,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 11:18:14,625 INFO L130 BoogieDeclarations]: Found specification of procedure get_loop_size [2022-07-12 11:18:14,625 INFO L138 BoogieDeclarations]: Found implementation of procedure get_loop_size [2022-07-12 11:18:14,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 11:18:14,625 INFO L130 BoogieDeclarations]: Found specification of procedure blk_cleanup_queue [2022-07-12 11:18:14,626 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_cleanup_queue [2022-07-12 11:18:14,626 INFO L130 BoogieDeclarations]: Found specification of procedure loop_set_status [2022-07-12 11:18:14,626 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_set_status [2022-07-12 11:18:14,626 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-12 11:18:14,626 INFO L130 BoogieDeclarations]: Found specification of procedure lo_ioctl [2022-07-12 11:18:14,627 INFO L138 BoogieDeclarations]: Found implementation of procedure lo_ioctl [2022-07-12 11:18:14,627 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irq [2022-07-12 11:18:14,629 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irq [2022-07-12 11:18:14,629 INFO L130 BoogieDeclarations]: Found specification of procedure current_thread_info [2022-07-12 11:18:14,629 INFO L138 BoogieDeclarations]: Found implementation of procedure current_thread_info [2022-07-12 11:18:14,630 INFO L130 BoogieDeclarations]: Found specification of procedure loop_release_xfer [2022-07-12 11:18:14,631 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_release_xfer [2022-07-12 11:18:14,631 INFO L130 BoogieDeclarations]: Found specification of procedure _cond_resched [2022-07-12 11:18:14,632 INFO L138 BoogieDeclarations]: Found implementation of procedure _cond_resched [2022-07-12 11:18:14,632 INFO L130 BoogieDeclarations]: Found specification of procedure kunmap [2022-07-12 11:18:14,632 INFO L138 BoogieDeclarations]: Found implementation of procedure kunmap [2022-07-12 11:18:14,637 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2022-07-12 11:18:14,637 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2022-07-12 11:18:14,637 INFO L130 BoogieDeclarations]: Found specification of procedure loop_switch [2022-07-12 11:18:14,637 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_switch [2022-07-12 11:18:14,637 INFO L130 BoogieDeclarations]: Found specification of procedure mapping_gfp_mask [2022-07-12 11:18:14,637 INFO L138 BoogieDeclarations]: Found implementation of procedure mapping_gfp_mask [2022-07-12 11:18:14,638 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-12 11:18:14,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-12 11:18:14,638 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2022-07-12 11:18:14,638 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2022-07-12 11:18:14,638 INFO L130 BoogieDeclarations]: Found specification of procedure __kunmap_atomic [2022-07-12 11:18:14,638 INFO L138 BoogieDeclarations]: Found implementation of procedure __kunmap_atomic [2022-07-12 11:18:14,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 11:18:14,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 11:18:14,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 11:18:14,639 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-07-12 11:18:14,639 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-07-12 11:18:15,321 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 11:18:15,324 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 11:18:15,845 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 11:18:17,068 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2022-07-12 11:18:17,068 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2022-07-12 11:18:17,086 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-07-12 11:18:17,086 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-07-12 11:18:17,488 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-07-12 11:18:17,488 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-07-12 11:18:17,816 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 11:18:17,818 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 11:18:18,966 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##72: assume !false; [2022-07-12 11:18:18,966 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##71: assume false; [2022-07-12 11:18:18,966 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2022-07-12 11:18:18,966 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2022-07-12 11:18:19,011 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 11:18:19,032 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 11:18:19,033 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-12 11:18:19,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:18:19 BoogieIcfgContainer [2022-07-12 11:18:19,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 11:18:19,038 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 11:18:19,038 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 11:18:19,041 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 11:18:19,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 11:18:12" (1/3) ... [2022-07-12 11:18:19,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@84114c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:18:19, skipping insertion in model container [2022-07-12 11:18:19,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:18:14" (2/3) ... [2022-07-12 11:18:19,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@84114c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:18:19, skipping insertion in model container [2022-07-12 11:18:19,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:18:19" (3/3) ... [2022-07-12 11:18:19,045 INFO L111 eAbstractionObserver]: Analyzing ICFG module_get_put-drivers-block-loop.ko.cil.out.i [2022-07-12 11:18:19,057 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 11:18:19,058 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 11:18:19,169 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 11:18:19,181 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@144bd0b9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@bcda841 [2022-07-12 11:18:19,181 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 11:18:19,188 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-12 11:18:19,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 11:18:19,195 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:18:19,195 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:18:19,196 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:18:19,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:18:19,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1638152850, now seen corresponding path program 1 times [2022-07-12 11:18:19,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:18:19,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959718453] [2022-07-12 11:18:19,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:18:19,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:18:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:19,582 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-12 11:18:19,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:18:19,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959718453] [2022-07-12 11:18:19,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959718453] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:18:19,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:18:19,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 11:18:19,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49353083] [2022-07-12 11:18:19,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:18:19,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 11:18:19,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:18:19,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 11:18:19,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 11:18:19,626 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-12 11:18:19,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:18:19,919 INFO L93 Difference]: Finished difference Result 3311 states and 4739 transitions. [2022-07-12 11:18:19,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 11:18:19,921 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-12 11:18:19,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:18:19,952 INFO L225 Difference]: With dead ends: 3311 [2022-07-12 11:18:19,952 INFO L226 Difference]: Without dead ends: 2166 [2022-07-12 11:18:19,976 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-12 11:18:19,979 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-12 11:18:19,980 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-12 11:18:20,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2166 states. [2022-07-12 11:18:20,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2166 to 2163. [2022-07-12 11:18:20,140 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-12 11:18:20,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 2986 transitions. [2022-07-12 11:18:20,161 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 2986 transitions. Word has length 11 [2022-07-12 11:18:20,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:18:20,162 INFO L495 AbstractCegarLoop]: Abstraction has 2163 states and 2986 transitions. [2022-07-12 11:18:20,162 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-12 11:18:20,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 2986 transitions. [2022-07-12 11:18:20,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 11:18:20,175 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:18:20,175 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-12 11:18:20,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 11:18:20,176 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:18:20,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:18:20,177 INFO L85 PathProgramCache]: Analyzing trace with hash -780115607, now seen corresponding path program 1 times [2022-07-12 11:18:20,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:18:20,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382340263] [2022-07-12 11:18:20,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:18:20,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:18:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:20,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:18:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:20,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 11:18:20,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:20,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:20,379 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-12 11:18:20,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:18:20,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382340263] [2022-07-12 11:18:20,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382340263] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:18:20,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:18:20,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 11:18:20,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411820532] [2022-07-12 11:18:20,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:18:20,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:18:20,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:18:20,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:18:20,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:18:20,387 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-12 11:18:22,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:18:22,492 INFO L93 Difference]: Finished difference Result 4691 states and 6565 transitions. [2022-07-12 11:18:22,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:18:22,497 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-12 11:18:22,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:18:22,514 INFO L225 Difference]: With dead ends: 4691 [2022-07-12 11:18:22,514 INFO L226 Difference]: Without dead ends: 2609 [2022-07-12 11:18:22,524 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-12 11:18:22,525 INFO L413 NwaCegarLoop]: 1480 mSDtfsCounter, 565 mSDsluCounter, 2868 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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.9s IncrementalHoareTripleChecker+Time [2022-07-12 11:18:22,526 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.9s Time] [2022-07-12 11:18:22,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2022-07-12 11:18:22,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 2163. [2022-07-12 11:18:22,644 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-12 11:18:22,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 2984 transitions. [2022-07-12 11:18:22,656 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 2984 transitions. Word has length 46 [2022-07-12 11:18:22,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:18:22,657 INFO L495 AbstractCegarLoop]: Abstraction has 2163 states and 2984 transitions. [2022-07-12 11:18:22,657 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-12 11:18:22,657 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 2984 transitions. [2022-07-12 11:18:22,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-12 11:18:22,660 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:18:22,660 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-12 11:18:22,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 11:18:22,661 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:18:22,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:18:22,661 INFO L85 PathProgramCache]: Analyzing trace with hash -800617350, now seen corresponding path program 1 times [2022-07-12 11:18:22,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:18:22,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512360718] [2022-07-12 11:18:22,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:18:22,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:18:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:22,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:18:22,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:22,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 11:18:22,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:22,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:22,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:22,754 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-12 11:18:22,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:18:22,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512360718] [2022-07-12 11:18:22,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512360718] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:18:22,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:18:22,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 11:18:22,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055502856] [2022-07-12 11:18:22,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:18:22,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 11:18:22,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:18:22,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 11:18:22,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 11:18:22,757 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-12 11:18:24,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:18:24,180 INFO L93 Difference]: Finished difference Result 4764 states and 6650 transitions. [2022-07-12 11:18:24,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 11:18:24,181 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-12 11:18:24,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:18:24,195 INFO L225 Difference]: With dead ends: 4764 [2022-07-12 11:18:24,195 INFO L226 Difference]: Without dead ends: 2609 [2022-07-12 11:18:24,202 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-12 11:18:24,203 INFO L413 NwaCegarLoop]: 1472 mSDtfsCounter, 2078 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 582 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:18:24,204 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.3s Time] [2022-07-12 11:18:24,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2022-07-12 11:18:24,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 2163. [2022-07-12 11:18:24,282 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-12 11:18:24,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 2982 transitions. [2022-07-12 11:18:24,295 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 2982 transitions. Word has length 58 [2022-07-12 11:18:24,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:18:24,296 INFO L495 AbstractCegarLoop]: Abstraction has 2163 states and 2982 transitions. [2022-07-12 11:18:24,296 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-12 11:18:24,296 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 2982 transitions. [2022-07-12 11:18:24,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-12 11:18:24,299 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:18:24,299 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-12 11:18:24,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 11:18:24,300 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:18:24,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:18:24,300 INFO L85 PathProgramCache]: Analyzing trace with hash -973306474, now seen corresponding path program 1 times [2022-07-12 11:18:24,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:18:24,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154966127] [2022-07-12 11:18:24,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:18:24,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:18:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:24,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:18:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:24,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 11:18:24,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:24,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:24,427 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-12 11:18:24,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:18:24,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154966127] [2022-07-12 11:18:24,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154966127] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:18:24,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:18:24,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 11:18:24,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440429901] [2022-07-12 11:18:24,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:18:24,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:18:24,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:18:24,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:18:24,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:18:24,434 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-12 11:18:26,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:18:26,325 INFO L93 Difference]: Finished difference Result 4691 states and 6560 transitions. [2022-07-12 11:18:26,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:18:26,326 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-12 11:18:26,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:18:26,341 INFO L225 Difference]: With dead ends: 4691 [2022-07-12 11:18:26,342 INFO L226 Difference]: Without dead ends: 2592 [2022-07-12 11:18:26,349 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-12 11:18:26,355 INFO L413 NwaCegarLoop]: 1476 mSDtfsCounter, 565 mSDsluCounter, 2858 mSDsCounter, 0 mSdLazyCounter, 1371 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.7s IncrementalHoareTripleChecker+Time [2022-07-12 11:18:26,356 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.7s Time] [2022-07-12 11:18:26,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2592 states. [2022-07-12 11:18:26,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2592 to 2146. [2022-07-12 11:18:26,449 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-12 11:18:26,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 2960 transitions. [2022-07-12 11:18:26,459 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 2960 transitions. Word has length 51 [2022-07-12 11:18:26,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:18:26,460 INFO L495 AbstractCegarLoop]: Abstraction has 2146 states and 2960 transitions. [2022-07-12 11:18:26,460 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-12 11:18:26,461 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 2960 transitions. [2022-07-12 11:18:26,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-12 11:18:26,463 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:18:26,463 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-12 11:18:26,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 11:18:26,464 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:18:26,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:18:26,464 INFO L85 PathProgramCache]: Analyzing trace with hash 966613706, now seen corresponding path program 1 times [2022-07-12 11:18:26,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:18:26,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258826475] [2022-07-12 11:18:26,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:18:26,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:18:26,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:26,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:18:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:26,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 11:18:26,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:26,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:26,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:26,599 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-12 11:18:26,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:18:26,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258826475] [2022-07-12 11:18:26,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258826475] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:18:26,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:18:26,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 11:18:26,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305390635] [2022-07-12 11:18:26,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:18:26,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:18:26,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:18:26,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:18:26,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:18:26,603 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-12 11:18:28,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:18:28,171 INFO L93 Difference]: Finished difference Result 4690 states and 6558 transitions. [2022-07-12 11:18:28,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:18:28,172 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-12 11:18:28,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:18:28,186 INFO L225 Difference]: With dead ends: 4690 [2022-07-12 11:18:28,186 INFO L226 Difference]: Without dead ends: 2598 [2022-07-12 11:18:28,194 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-12 11:18:28,194 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-12 11:18:28,195 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-12 11:18:28,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2598 states. [2022-07-12 11:18:28,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2598 to 2147. [2022-07-12 11:18:28,272 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-12 11:18:28,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 2961 transitions. [2022-07-12 11:18:28,281 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 2961 transitions. Word has length 63 [2022-07-12 11:18:28,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:18:28,281 INFO L495 AbstractCegarLoop]: Abstraction has 2147 states and 2961 transitions. [2022-07-12 11:18:28,282 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-12 11:18:28,282 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 2961 transitions. [2022-07-12 11:18:28,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-12 11:18:28,284 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:18:28,284 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-12 11:18:28,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 11:18:28,284 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:18:28,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:18:28,285 INFO L85 PathProgramCache]: Analyzing trace with hash 707532724, now seen corresponding path program 1 times [2022-07-12 11:18:28,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:18:28,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760868998] [2022-07-12 11:18:28,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:18:28,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:18:28,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:28,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 11:18:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:28,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:28,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:28,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:18:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:28,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 11:18:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:28,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:18:28,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:28,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:28,563 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-12 11:18:28,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:18:28,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760868998] [2022-07-12 11:18:28,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760868998] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:18:28,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647291258] [2022-07-12 11:18:28,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:18:28,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:18:28,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:18:28,566 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:18:28,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 11:18:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:29,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 11:18:29,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:18:29,260 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-12 11:18:29,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:18:29,348 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-12 11:18:29,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647291258] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:18:29,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:18:29,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2022-07-12 11:18:29,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569686765] [2022-07-12 11:18:29,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:18:29,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 11:18:29,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:18:29,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 11:18:29,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-07-12 11:18:29,353 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-12 11:18:33,473 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-12 11:18:35,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:18:35,818 INFO L93 Difference]: Finished difference Result 4887 states and 6970 transitions. [2022-07-12 11:18:35,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 11:18:35,819 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-12 11:18:35,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:18:35,835 INFO L225 Difference]: With dead ends: 4887 [2022-07-12 11:18:35,835 INFO L226 Difference]: Without dead ends: 2795 [2022-07-12 11:18:35,842 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-12 11:18:35,842 INFO L413 NwaCegarLoop]: 1400 mSDtfsCounter, 1002 mSDsluCounter, 4289 mSDsCounter, 0 mSdLazyCounter, 2770 mSolverCounterSat, 421 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s 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.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:18:35,843 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.2s Time] [2022-07-12 11:18:35,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2795 states. [2022-07-12 11:18:35,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2795 to 2165. [2022-07-12 11:18:35,936 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-12 11:18:35,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2165 states to 2165 states and 2985 transitions. [2022-07-12 11:18:35,944 INFO L78 Accepts]: Start accepts. Automaton has 2165 states and 2985 transitions. Word has length 87 [2022-07-12 11:18:35,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:18:35,945 INFO L495 AbstractCegarLoop]: Abstraction has 2165 states and 2985 transitions. [2022-07-12 11:18:35,945 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-12 11:18:35,945 INFO L276 IsEmpty]: Start isEmpty. Operand 2165 states and 2985 transitions. [2022-07-12 11:18:35,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-12 11:18:35,948 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:18:35,948 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-12 11:18:35,979 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-12 11:18:36,179 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-12 11:18:36,179 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:18:36,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:18:36,180 INFO L85 PathProgramCache]: Analyzing trace with hash 2065381788, now seen corresponding path program 1 times [2022-07-12 11:18:36,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:18:36,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472441954] [2022-07-12 11:18:36,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:18:36,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:18:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 11:18:36,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:18:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:18:36,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 11:18:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 11:18:36,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:36,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:18:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 11:18:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:18:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 11:18:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-12 11:18:36,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:36,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,553 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-12 11:18:36,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:18:36,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472441954] [2022-07-12 11:18:36,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472441954] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:18:36,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430929805] [2022-07-12 11:18:36,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:18:36,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:18:36,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:18:36,556 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-12 11:18:36,558 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-12 11:18:37,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:37,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 1827 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 11:18:37,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:18:37,359 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-12 11:18:37,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:18:37,568 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-12 11:18:37,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430929805] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:18:37,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:18:37,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2022-07-12 11:18:37,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738921343] [2022-07-12 11:18:37,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:18:37,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-12 11:18:37,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:18:37,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-12 11:18:37,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=299, Unknown=0, NotChecked=0, Total=462 [2022-07-12 11:18:37,570 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-12 11:18:44,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:18:44,033 INFO L93 Difference]: Finished difference Result 4911 states and 7003 transitions. [2022-07-12 11:18:44,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 11:18:44,034 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-12 11:18:44,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:18:44,050 INFO L225 Difference]: With dead ends: 4911 [2022-07-12 11:18:44,050 INFO L226 Difference]: Without dead ends: 2819 [2022-07-12 11:18:44,056 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-12 11:18:44,057 INFO L413 NwaCegarLoop]: 1412 mSDtfsCounter, 1069 mSDsluCounter, 7468 mSDsCounter, 0 mSdLazyCounter, 4697 mSolverCounterSat, 485 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s 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, 6.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:18:44,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1231 Valid, 8880 Invalid, 5182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [485 Valid, 4697 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-07-12 11:18:44,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2819 states. [2022-07-12 11:18:44,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2819 to 2189. [2022-07-12 11:18:44,152 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-12 11:18:44,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2189 states to 2189 states and 3017 transitions. [2022-07-12 11:18:44,161 INFO L78 Accepts]: Start accepts. Automaton has 2189 states and 3017 transitions. Word has length 152 [2022-07-12 11:18:44,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:18:44,162 INFO L495 AbstractCegarLoop]: Abstraction has 2189 states and 3017 transitions. [2022-07-12 11:18:44,162 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-12 11:18:44,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 3017 transitions. [2022-07-12 11:18:44,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2022-07-12 11:18:44,166 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:18:44,166 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-12 11:18:44,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 11:18:44,391 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-12 11:18:44,392 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:18:44,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:18:44,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1776723700, now seen corresponding path program 2 times [2022-07-12 11:18:44,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:18:44,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039477818] [2022-07-12 11:18:44,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:18:44,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:18:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:44,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 11:18:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:44,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:44,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:18:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:44,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:18:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:44,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:44,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:44,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 11:18:44,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:44,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 11:18:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:44,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:44,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:44,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:18:44,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:44,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 11:18:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:44,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:44,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:44,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:18:44,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:44,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 11:18:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:44,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:44,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 11:18:44,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:44,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 11:18:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:44,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:44,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:44,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 11:18:44,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:44,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-12 11:18:44,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:44,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:44,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:44,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-12 11:18:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:44,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-12 11:18:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:44,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:44,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-12 11:18:44,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:44,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-12 11:18:44,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:44,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-12 11:18:44,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:44,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:44,945 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-12 11:18:44,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:18:44,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039477818] [2022-07-12 11:18:44,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039477818] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:18:44,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871294129] [2022-07-12 11:18:44,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 11:18:44,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:18:44,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:18:44,948 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-12 11:18:44,980 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-12 11:18:45,451 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 11:18:45,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 11:18:45,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 1047 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-12 11:18:45,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:18:45,597 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-12 11:18:45,598 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:18:45,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871294129] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:18:45,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:18:45,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2022-07-12 11:18:45,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587022457] [2022-07-12 11:18:45,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:18:45,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 11:18:45,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:18:45,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 11:18:45,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-12 11:18:45,600 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-12 11:18:46,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:18:46,939 INFO L93 Difference]: Finished difference Result 5268 states and 7285 transitions. [2022-07-12 11:18:46,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:18:46,948 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-12 11:18:46,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:18:46,971 INFO L225 Difference]: With dead ends: 5268 [2022-07-12 11:18:46,972 INFO L226 Difference]: Without dead ends: 4209 [2022-07-12 11:18:46,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2022-07-12 11:18:46,979 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-12 11:18:46,979 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-12 11:18:46,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4209 states. [2022-07-12 11:18:47,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4209 to 4155. [2022-07-12 11:18:47,163 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-12 11:18:47,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4155 states to 4155 states and 5743 transitions. [2022-07-12 11:18:47,177 INFO L78 Accepts]: Start accepts. Automaton has 4155 states and 5743 transitions. Word has length 248 [2022-07-12 11:18:47,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:18:47,179 INFO L495 AbstractCegarLoop]: Abstraction has 4155 states and 5743 transitions. [2022-07-12 11:18:47,180 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-12 11:18:47,180 INFO L276 IsEmpty]: Start isEmpty. Operand 4155 states and 5743 transitions. [2022-07-12 11:18:47,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2022-07-12 11:18:47,186 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:18:47,187 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-12 11:18:47,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-12 11:18:47,395 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-12 11:18:47,396 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:18:47,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:18:47,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1557868982, now seen corresponding path program 1 times [2022-07-12 11:18:47,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:18:47,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009604659] [2022-07-12 11:18:47,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:18:47,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:18:47,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:47,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 11:18:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:47,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:47,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:18:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:47,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:18:47,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:47,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:47,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:47,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 11:18:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:47,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 11:18:47,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:47,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:47,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:47,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:18:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:47,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 11:18:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:47,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:47,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:47,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:18:47,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:47,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 11:18:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:47,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:47,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 11:18:47,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:47,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 11:18:47,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:47,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:47,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 11:18:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:47,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-12 11:18:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:47,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:47,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-12 11:18:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:47,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-12 11:18:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:47,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:47,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:47,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-12 11:18:47,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:47,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-12 11:18:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:47,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-12 11:18:47,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:47,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:47,888 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-12 11:18:47,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:18:47,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009604659] [2022-07-12 11:18:47,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009604659] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:18:47,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:18:47,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 11:18:47,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039033511] [2022-07-12 11:18:47,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:18:47,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 11:18:47,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:18:47,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 11:18:47,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 11:18:47,891 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-12 11:18:54,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:18:54,691 INFO L93 Difference]: Finished difference Result 8065 states and 11861 transitions. [2022-07-12 11:18:54,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:18:54,696 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-12 11:18:54,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:18:54,739 INFO L225 Difference]: With dead ends: 8065 [2022-07-12 11:18:54,740 INFO L226 Difference]: Without dead ends: 8062 [2022-07-12 11:18:54,745 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-12 11:18:54,746 INFO L413 NwaCegarLoop]: 2909 mSDtfsCounter, 5886 mSDsluCounter, 3324 mSDsCounter, 0 mSdLazyCounter, 3777 mSolverCounterSat, 2545 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6354 SdHoareTripleChecker+Valid, 6233 SdHoareTripleChecker+Invalid, 6322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2545 IncrementalHoareTripleChecker+Valid, 3777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:18:54,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6354 Valid, 6233 Invalid, 6322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2545 Valid, 3777 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-07-12 11:18:54,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8062 states. [2022-07-12 11:18:55,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8062 to 6361. [2022-07-12 11:18:55,144 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-12 11:18:55,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6361 states to 6361 states and 8876 transitions. [2022-07-12 11:18:55,169 INFO L78 Accepts]: Start accepts. Automaton has 6361 states and 8876 transitions. Word has length 248 [2022-07-12 11:18:55,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:18:55,169 INFO L495 AbstractCegarLoop]: Abstraction has 6361 states and 8876 transitions. [2022-07-12 11:18:55,170 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-12 11:18:55,170 INFO L276 IsEmpty]: Start isEmpty. Operand 6361 states and 8876 transitions. [2022-07-12 11:18:55,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2022-07-12 11:18:55,175 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:18:55,176 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-12 11:18:55,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 11:18:55,176 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:18:55,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:18:55,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1635323117, now seen corresponding path program 1 times [2022-07-12 11:18:55,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:18:55,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743303120] [2022-07-12 11:18:55,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:18:55,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:18:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 11:18:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:55,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:18:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:18:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 11:18:55,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 11:18:55,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:55,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:18:55,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 11:18:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:18:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 11:18:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 11:18:55,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 11:18:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:55,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 11:18:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-12 11:18:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-12 11:18:55,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-12 11:18:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:55,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-12 11:18:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-12 11:18:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-12 11:18:55,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-07-12 11:18:55,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,603 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-12 11:18:55,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:18:55,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743303120] [2022-07-12 11:18:55,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743303120] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:18:55,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:18:55,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 11:18:55,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015171762] [2022-07-12 11:18:55,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:18:55,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:18:55,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:18:55,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:18:55,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:18:55,606 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-12 11:18:58,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:18:58,144 INFO L93 Difference]: Finished difference Result 14925 states and 21806 transitions. [2022-07-12 11:18:58,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:18:58,145 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-12 11:18:58,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:18:58,192 INFO L225 Difference]: With dead ends: 14925 [2022-07-12 11:18:58,192 INFO L226 Difference]: Without dead ends: 8671 [2022-07-12 11:18:58,220 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-12 11:18:58,220 INFO L413 NwaCegarLoop]: 1459 mSDtfsCounter, 1201 mSDsluCounter, 1800 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 675 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:18:58,221 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.2s Time] [2022-07-12 11:18:58,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8671 states. [2022-07-12 11:18:58,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8671 to 7004. [2022-07-12 11:18:58,598 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-12 11:18:58,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7004 states to 7004 states and 9933 transitions. [2022-07-12 11:18:58,625 INFO L78 Accepts]: Start accepts. Automaton has 7004 states and 9933 transitions. Word has length 254 [2022-07-12 11:18:58,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:18:58,625 INFO L495 AbstractCegarLoop]: Abstraction has 7004 states and 9933 transitions. [2022-07-12 11:18:58,625 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-12 11:18:58,626 INFO L276 IsEmpty]: Start isEmpty. Operand 7004 states and 9933 transitions. [2022-07-12 11:18:58,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2022-07-12 11:18:58,630 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:18:58,630 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-12 11:18:58,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 11:18:58,631 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:18:58,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:18:58,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1210188346, now seen corresponding path program 1 times [2022-07-12 11:18:58,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:18:58,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252328185] [2022-07-12 11:18:58,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:18:58,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:18:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:58,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 11:18:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:58,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:58,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:58,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:18:58,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:58,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:18:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:58,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:58,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:58,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 11:18:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:58,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 11:18:58,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:58,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:58,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:18:58,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:58,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 11:18:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:58,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:58,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:18:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:58,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 11:18:58,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:58,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:58,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 11:18:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:58,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 11:18:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:58,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:58,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 11:18:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:58,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-12 11:18:59,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:59,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:59,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-12 11:18:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:59,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-12 11:18:59,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:59,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:59,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:59,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-12 11:18:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:59,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-12 11:18:59,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:59,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2022-07-12 11:18:59,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:59,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-07-12 11:18:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:59,054 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-12 11:18:59,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:18:59,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252328185] [2022-07-12 11:18:59,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252328185] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:18:59,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58634054] [2022-07-12 11:18:59,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:18:59,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:18:59,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:18:59,060 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-12 11:18:59,088 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-12 11:18:59,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:59,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 2714 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 11:18:59,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:18:59,889 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-12 11:18:59,889 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:18:59,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58634054] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:18:59,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:18:59,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-12 11:18:59,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475521342] [2022-07-12 11:18:59,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:18:59,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:18:59,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:18:59,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:18:59,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:18:59,891 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-12 11:19:00,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:19:00,175 INFO L93 Difference]: Finished difference Result 14011 states and 19874 transitions. [2022-07-12 11:19:00,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:19:00,176 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-12 11:19:00,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:19:00,209 INFO L225 Difference]: With dead ends: 14011 [2022-07-12 11:19:00,210 INFO L226 Difference]: Without dead ends: 6993 [2022-07-12 11:19:00,237 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-12 11:19:00,238 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-12 11:19:00,238 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-12 11:19:00,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6993 states. [2022-07-12 11:19:00,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6993 to 6993. [2022-07-12 11:19:00,564 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-12 11:19:00,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6993 states to 6993 states and 9919 transitions. [2022-07-12 11:19:00,592 INFO L78 Accepts]: Start accepts. Automaton has 6993 states and 9919 transitions. Word has length 256 [2022-07-12 11:19:00,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:19:00,593 INFO L495 AbstractCegarLoop]: Abstraction has 6993 states and 9919 transitions. [2022-07-12 11:19:00,593 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-12 11:19:00,593 INFO L276 IsEmpty]: Start isEmpty. Operand 6993 states and 9919 transitions. [2022-07-12 11:19:00,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2022-07-12 11:19:00,601 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:19:00,601 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-12 11:19:00,634 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-12 11:19:00,815 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-12 11:19:00,815 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:19:00,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:19:00,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1841619178, now seen corresponding path program 1 times [2022-07-12 11:19:00,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:19:00,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281839161] [2022-07-12 11:19:00,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:19:00,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:19:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 11:19:01,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 11:19:01,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 11:19:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:19:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:19:01,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 11:19:01,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 11:19:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 11:19:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:19:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 11:19:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 11:19:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 11:19:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 11:19:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:19:01,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 11:19:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 11:19:01,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 11:19:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 11:19:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:19:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-12 11:19:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-12 11:19:01,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:01,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 11:19:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 11:19:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:19:01,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-12 11:19:01,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-07-12 11:19:01,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 11:19:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 11:19:01,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:19:01,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-07-12 11:19:01,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-07-12 11:19:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:01,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 11:19:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 11:19:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:19:01,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2022-07-12 11:19:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2022-07-12 11:19:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:01,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 11:19:01,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 11:19:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:19:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2022-07-12 11:19:01,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 404 [2022-07-12 11:19:01,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 416 [2022-07-12 11:19:01,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 422 [2022-07-12 11:19:01,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:01,859 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-12 11:19:01,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:19:01,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281839161] [2022-07-12 11:19:01,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281839161] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:19:01,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872247317] [2022-07-12 11:19:01,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:19:01,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:19:01,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:19:01,861 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-12 11:19:01,863 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-12 11:19:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:03,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 4690 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-12 11:19:03,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:19:03,552 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-12 11:19:03,553 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:19:03,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872247317] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:19:03,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:19:03,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 10 [2022-07-12 11:19:03,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804016308] [2022-07-12 11:19:03,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:19:03,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 11:19:03,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:19:03,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 11:19:03,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:19:03,558 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-12 11:19:04,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:19:04,009 INFO L93 Difference]: Finished difference Result 13986 states and 19859 transitions. [2022-07-12 11:19:04,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:19:04,009 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-12 11:19:04,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:19:04,046 INFO L225 Difference]: With dead ends: 13986 [2022-07-12 11:19:04,046 INFO L226 Difference]: Without dead ends: 7001 [2022-07-12 11:19:04,074 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-12 11:19:04,075 INFO L413 NwaCegarLoop]: 1517 mSDtfsCounter, 6 mSDsluCounter, 9082 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-12 11:19:04,076 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-12 11:19:04,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7001 states. [2022-07-12 11:19:04,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7001 to 6995. [2022-07-12 11:19:04,360 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-12 11:19:04,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6995 states to 6995 states and 9926 transitions. [2022-07-12 11:19:04,393 INFO L78 Accepts]: Start accepts. Automaton has 6995 states and 9926 transitions. Word has length 440 [2022-07-12 11:19:04,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:19:04,393 INFO L495 AbstractCegarLoop]: Abstraction has 6995 states and 9926 transitions. [2022-07-12 11:19:04,393 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-12 11:19:04,394 INFO L276 IsEmpty]: Start isEmpty. Operand 6995 states and 9926 transitions. [2022-07-12 11:19:04,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2022-07-12 11:19:04,404 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:19:04,404 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-12 11:19:04,444 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-12 11:19:04,622 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-12 11:19:04,623 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:19:04,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:19:04,623 INFO L85 PathProgramCache]: Analyzing trace with hash -969582626, now seen corresponding path program 1 times [2022-07-12 11:19:04,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:19:04,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142517675] [2022-07-12 11:19:04,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:19:04,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:19:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 11:19:05,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:05,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:19:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:19:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 11:19:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:19:05,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 11:19:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:19:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:05,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:19:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:19:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 11:19:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:19:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 11:19:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 11:19:05,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:05,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:19:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:19:05,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 11:19:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:19:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-12 11:19:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-12 11:19:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:05,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:19:05,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:19:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 11:19:05,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:19:05,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-12 11:19:05,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-07-12 11:19:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:19:05,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:19:05,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 11:19:05,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:19:05,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-12 11:19:05,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-12 11:19:05,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:05,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:19:05,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:19:05,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 11:19:05,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:19:05,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2022-07-12 11:19:05,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2022-07-12 11:19:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:05,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:19:05,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:19:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 11:19:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:19:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 382 [2022-07-12 11:19:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 389 [2022-07-12 11:19:05,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:19:05,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:19:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 11:19:05,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:19:05,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 436 [2022-07-12 11:19:05,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 460 [2022-07-12 11:19:05,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 472 [2022-07-12 11:19:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 478 [2022-07-12 11:19:05,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:05,699 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-12 11:19:05,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:19:05,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142517675] [2022-07-12 11:19:05,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142517675] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:19:05,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42631122] [2022-07-12 11:19:05,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:19:05,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:19:05,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:19:05,704 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-12 11:19:05,732 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-12 11:19:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:08,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 4986 conjuncts, 76 conjunts are in the unsatisfiable core [2022-07-12 11:19:08,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:19:08,501 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-12 11:19:08,568 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-12 11:19:08,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:19:08,978 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-12 11:19:08,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42631122] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:19:08,979 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:19:08,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 6] total 22 [2022-07-12 11:19:08,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301082521] [2022-07-12 11:19:08,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:19:08,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-12 11:19:08,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:19:08,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-12 11:19:08,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2022-07-12 11:19:08,981 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-12 11:19:19,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:19:19,555 INFO L93 Difference]: Finished difference Result 15645 states and 22950 transitions. [2022-07-12 11:19:19,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 11:19:19,555 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-12 11:19:19,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:19:19,600 INFO L225 Difference]: With dead ends: 15645 [2022-07-12 11:19:19,600 INFO L226 Difference]: Without dead ends: 8657 [2022-07-12 11:19:19,628 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-12 11:19:19,629 INFO L413 NwaCegarLoop]: 1385 mSDtfsCounter, 703 mSDsluCounter, 15147 mSDsCounter, 0 mSdLazyCounter, 9490 mSolverCounterSat, 347 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s 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, 9.8s IncrementalHoareTripleChecker+Time [2022-07-12 11:19:19,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 16532 Invalid, 9837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [347 Valid, 9490 Invalid, 0 Unknown, 0 Unchecked, 9.8s Time] [2022-07-12 11:19:19,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8657 states. [2022-07-12 11:19:19,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8657 to 6995. [2022-07-12 11:19:20,006 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-12 11:19:20,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6995 states to 6995 states and 9924 transitions. [2022-07-12 11:19:20,036 INFO L78 Accepts]: Start accepts. Automaton has 6995 states and 9924 transitions. Word has length 496 [2022-07-12 11:19:20,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:19:20,036 INFO L495 AbstractCegarLoop]: Abstraction has 6995 states and 9924 transitions. [2022-07-12 11:19:20,037 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-12 11:19:20,037 INFO L276 IsEmpty]: Start isEmpty. Operand 6995 states and 9924 transitions. [2022-07-12 11:19:20,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2022-07-12 11:19:20,048 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:19:20,048 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-12 11:19:20,091 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-12 11:19:20,269 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-12 11:19:20,269 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:19:20,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:19:20,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1290540974, now seen corresponding path program 1 times [2022-07-12 11:19:20,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:19:20,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269451097] [2022-07-12 11:19:20,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:19:20,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:19:22,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:24,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 11:19:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:28,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:28,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:29,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:19:29,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:29,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:19:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:29,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:19:29,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:29,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:19:29,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:29,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:19:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:29,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:19:29,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:29,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 11:19:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:29,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 11:19:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:34,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:34,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:19:34,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:34,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:19:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:35,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:19:35,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:35,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:19:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:35,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:19:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:35,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:19:35,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:35,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 11:19:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:35,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 11:19:35,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:37,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:37,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:37,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:19:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:37,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:19:37,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:37,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:19:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:37,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:19:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:37,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:19:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:37,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:19:37,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:37,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-12 11:19:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:37,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-07-12 11:19:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:41,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:41,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:19:41,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:41,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:19:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:41,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:19:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:41,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:19:41,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:41,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:19:41,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:41,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:19:41,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:41,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2022-07-12 11:19:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:41,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2022-07-12 11:19:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:45,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:45,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:45,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:19:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:45,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:19:45,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:45,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:19:45,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:45,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:19:45,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:45,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:19:45,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:45,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:19:45,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:45,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2022-07-12 11:19:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:45,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2022-07-12 11:19:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:48,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:48,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:48,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:19:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:48,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:19:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:48,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:19:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:48,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:19:48,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:48,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:19:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:48,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:19:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:48,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 412 [2022-07-12 11:19:48,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:48,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 419 [2022-07-12 11:19:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:52,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:52,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:52,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:19:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:52,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:19:52,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:52,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:19:52,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:52,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:19:52,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:52,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:19:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:53,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:19:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:53,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 480 [2022-07-12 11:19:53,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:53,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 487 [2022-07-12 11:19:53,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:58,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:58,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:19:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:58,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:19:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:58,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:19:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:59,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:19:59,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:59,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:19:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:59,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:19:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:59,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 548 [2022-07-12 11:19:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:59,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 572 [2022-07-12 11:19:59,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:59,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 584 [2022-07-12 11:19:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:59,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 590 [2022-07-12 11:19:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:59,401 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-12 11:19:59,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:19:59,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269451097] [2022-07-12 11:19:59,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269451097] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:19:59,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401523603] [2022-07-12 11:19:59,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:19:59,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:19:59,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:19:59,408 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-12 11:19:59,409 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-12 11:20:47,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:47,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 5578 conjuncts, 774 conjunts are in the unsatisfiable core [2022-07-12 11:20:47,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:20:47,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:47,537 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-12 11:20:47,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:47,544 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-12 11:20:47,865 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-12 11:20:47,874 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-12 11:20:48,522 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-12 11:20:48,523 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-12 11:20:48,929 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-12 11:20:52,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:52,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:52,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:52,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:52,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:52,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:52,328 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-12 11:20:52,329 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-12 11:20:52,592 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-12 11:20:54,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:54,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:54,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:54,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:54,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:54,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:54,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:54,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:54,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:54,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:54,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:54,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:54,304 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-07-12 11:20:54,305 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-12 11:20:54,313 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-12 11:20:54,318 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-12 11:20:54,346 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-12 11:20:59,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:59,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:59,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:59,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:59,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:59,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:59,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:59,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:59,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:59,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:59,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:59,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:59,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:59,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:59,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:59,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:59,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:59,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:59,505 INFO L356 Elim1Store]: treesize reduction 129, result has 17.8 percent of original size [2022-07-12 11:20:59,506 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-12 11:20:59,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, 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-12 11:20:59,549 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-12 11:21:03,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:03,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:03,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:03,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:03,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:03,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:03,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:03,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:03,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:04,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:04,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:04,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:04,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:04,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:04,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:04,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:04,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:04,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:04,337 INFO L356 Elim1Store]: treesize reduction 573, result has 16.7 percent of original size [2022-07-12 11:21:04,338 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-12 11:21:04,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:04,376 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-12 11:21:04,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:04,395 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-12 11:21:05,646 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-12 11:21:05,651 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-12 11:21:05,656 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-12 11:21:06,311 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-12 11:21:10,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:10,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:10,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:10,255 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-12 11:21:10,738 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-12 11:21:13,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:13,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:13,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:13,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:13,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:13,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:13,503 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 11:21:13,503 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-12 11:21:13,511 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-12 11:21:13,517 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-12 11:21:13,544 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-12 11:21:20,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:20,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:20,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:20,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:20,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:20,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:20,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:20,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:20,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:20,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:20,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:20,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:20,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:20,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:20,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:20,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:20,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:20,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:20,287 INFO L356 Elim1Store]: treesize reduction 101, result has 24.1 percent of original size [2022-07-12 11:21:20,287 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-12 11:21:20,324 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-12 11:21:20,352 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-12 11:21:25,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:25,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:25,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:25,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:25,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:25,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:25,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:25,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:25,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:25,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:25,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:25,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:25,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:25,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:25,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:25,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:25,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:25,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:25,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:25,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:25,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:25,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:25,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:25,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:26,008 INFO L356 Elim1Store]: treesize reduction 601, result has 19.7 percent of original size [2022-07-12 11:21:26,008 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-12 11:21:26,050 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-12 11:21:26,075 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-12 11:21:31,043 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-12 11:21:31,048 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-12 11:21:31,077 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-12 11:21:32,436 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-12 11:21:43,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:43,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:43,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:43,825 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-12 11:21:43,849 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-12 11:21:51,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:51,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:51,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:51,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:51,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:51,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:51,414 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 11:21:51,415 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-12 11:21:51,422 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-12 11:21:51,427 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-12 11:21:52,558 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