./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-pktcdvd.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 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-pktcdvd.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 f81c0ae249d872dcfa63b19fa0949c00123fc4e906e065a111b2d70e300e79eb --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 01:25:36,860 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 01:25:36,862 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 01:25:36,894 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 01:25:36,898 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 01:25:36,899 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 01:25:36,900 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 01:25:36,903 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 01:25:36,905 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 01:25:36,905 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 01:25:36,906 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 01:25:36,907 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 01:25:36,908 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 01:25:36,910 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 01:25:36,916 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 01:25:36,917 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 01:25:36,918 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 01:25:36,921 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 01:25:36,922 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 01:25:36,927 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 01:25:36,929 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 01:25:36,930 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 01:25:36,931 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 01:25:36,932 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 01:25:36,933 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 01:25:36,935 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 01:25:36,936 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 01:25:36,936 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 01:25:36,937 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 01:25:36,938 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 01:25:36,938 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 01:25:36,938 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 01:25:36,939 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 01:25:36,940 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 01:25:36,941 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 01:25:36,941 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 01:25:36,942 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 01:25:36,942 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 01:25:36,942 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 01:25:36,943 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 01:25:36,943 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 01:25:36,944 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-18 01:25:36,961 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 01:25:36,961 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 01:25:36,962 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 01:25:36,962 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 01:25:36,962 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 01:25:36,962 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 01:25:36,963 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 01:25:36,963 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 01:25:36,963 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 01:25:36,963 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 01:25:36,964 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 01:25:36,964 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 01:25:36,964 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-18 01:25:36,964 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 01:25:36,964 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-18 01:25:36,964 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-18 01:25:36,965 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 01:25:36,965 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-18 01:25:36,965 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 01:25:36,965 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 01:25:36,965 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 01:25:36,965 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 01:25:36,966 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 01:25:36,966 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 01:25:36,966 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-18 01:25:36,966 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-18 01:25:36,967 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-18 01:25:36,967 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-18 01:25:36,968 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-18 01:25:36,968 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-18 01:25:36,968 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 01:25:36,968 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 -> f81c0ae249d872dcfa63b19fa0949c00123fc4e906e065a111b2d70e300e79eb [2021-12-18 01:25:37,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 01:25:37,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 01:25:37,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 01:25:37,210 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 01:25:37,210 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 01:25:37,212 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-pktcdvd.ko.cil.out.i [2021-12-18 01:25:37,267 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aba0e23c1/43c2cf6a4cfb4469bcb3680bbc22760b/FLAG14e33b1fd [2021-12-18 01:25:37,865 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 01:25:37,866 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-pktcdvd.ko.cil.out.i [2021-12-18 01:25:37,905 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aba0e23c1/43c2cf6a4cfb4469bcb3680bbc22760b/FLAG14e33b1fd [2021-12-18 01:25:38,307 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aba0e23c1/43c2cf6a4cfb4469bcb3680bbc22760b [2021-12-18 01:25:38,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 01:25:38,310 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 01:25:38,313 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 01:25:38,313 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 01:25:38,315 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 01:25:38,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:25:38" (1/1) ... [2021-12-18 01:25:38,316 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5227eb89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:25:38, skipping insertion in model container [2021-12-18 01:25:38,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:25:38" (1/1) ... [2021-12-18 01:25:38,321 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 01:25:38,408 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 01:25:39,498 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-pktcdvd.ko.cil.out.i[265142,265155] [2021-12-18 01:25:39,537 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 01:25:39,552 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 01:25:39,796 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-pktcdvd.ko.cil.out.i[265142,265155] [2021-12-18 01:25:39,803 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 01:25:39,877 INFO L208 MainTranslator]: Completed translation [2021-12-18 01:25:39,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:25:39 WrapperNode [2021-12-18 01:25:39,878 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 01:25:39,879 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 01:25:39,879 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 01:25:39,879 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 01:25:39,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:25:39" (1/1) ... [2021-12-18 01:25:39,951 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:25:39" (1/1) ... [2021-12-18 01:25:40,054 INFO L137 Inliner]: procedures = 309, calls = 2428, calls flagged for inlining = 139, calls inlined = 90, statements flattened = 3931 [2021-12-18 01:25:40,055 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 01:25:40,056 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 01:25:40,056 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 01:25:40,056 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 01:25:40,068 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:25:39" (1/1) ... [2021-12-18 01:25:40,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:25:39" (1/1) ... [2021-12-18 01:25:40,096 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:25:39" (1/1) ... [2021-12-18 01:25:40,096 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:25:39" (1/1) ... [2021-12-18 01:25:40,180 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:25:39" (1/1) ... [2021-12-18 01:25:40,196 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:25:39" (1/1) ... [2021-12-18 01:25:40,207 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:25:39" (1/1) ... [2021-12-18 01:25:40,226 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 01:25:40,227 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 01:25:40,227 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 01:25:40,227 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 01:25:40,228 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:25:39" (1/1) ... [2021-12-18 01:25:40,234 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 01:25:40,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:25:40,256 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) [2021-12-18 01:25:40,274 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 [2021-12-18 01:25:40,292 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2021-12-18 01:25:40,292 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2021-12-18 01:25:40,292 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2021-12-18 01:25:40,292 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2021-12-18 01:25:40,293 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_ctl_ioctl [2021-12-18 01:25:40,293 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_ctl_ioctl [2021-12-18 01:25:40,293 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_kobj_release [2021-12-18 01:25:40,293 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_kobj_release [2021-12-18 01:25:40,293 INFO L130 BoogieDeclarations]: Found specification of procedure bdev_get_queue [2021-12-18 01:25:40,293 INFO L138 BoogieDeclarations]: Found implementation of procedure bdev_get_queue [2021-12-18 01:25:40,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-12-18 01:25:40,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-12-18 01:25:40,294 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_get_disc_info [2021-12-18 01:25:40,294 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_get_disc_info [2021-12-18 01:25:40,294 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_bio_alloc [2021-12-18 01:25:40,294 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_bio_alloc [2021-12-18 01:25:40,294 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-18 01:25:40,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-18 01:25:40,295 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_setup_dev [2021-12-18 01:25:40,295 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_setup_dev [2021-12-18 01:25:40,295 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2021-12-18 01:25:40,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2021-12-18 01:25:40,295 INFO L130 BoogieDeclarations]: Found specification of procedure bdget [2021-12-18 01:25:40,295 INFO L138 BoogieDeclarations]: Found implementation of procedure bdget [2021-12-18 01:25:40,295 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_set_speed [2021-12-18 01:25:40,296 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_set_speed [2021-12-18 01:25:40,296 INFO L130 BoogieDeclarations]: Found specification of procedure bdevname [2021-12-18 01:25:40,296 INFO L138 BoogieDeclarations]: Found implementation of procedure bdevname [2021-12-18 01:25:40,296 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2021-12-18 01:25:40,296 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2021-12-18 01:25:40,296 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_shrink_pktlist [2021-12-18 01:25:40,296 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_shrink_pktlist [2021-12-18 01:25:40,296 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2021-12-18 01:25:40,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2021-12-18 01:25:40,297 INFO L130 BoogieDeclarations]: Found specification of procedure set_capacity [2021-12-18 01:25:40,297 INFO L138 BoogieDeclarations]: Found implementation of procedure set_capacity [2021-12-18 01:25:40,297 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2021-12-18 01:25:40,298 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2021-12-18 01:25:40,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-12-18 01:25:40,298 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-12-18 01:25:40,298 INFO L130 BoogieDeclarations]: Found specification of procedure blkdev_put [2021-12-18 01:25:40,298 INFO L138 BoogieDeclarations]: Found implementation of procedure blkdev_put [2021-12-18 01:25:40,298 INFO L130 BoogieDeclarations]: Found specification of procedure new_encode_dev [2021-12-18 01:25:40,298 INFO L138 BoogieDeclarations]: Found implementation of procedure new_encode_dev [2021-12-18 01:25:40,299 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2021-12-18 01:25:40,299 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2021-12-18 01:25:40,299 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_mode_select [2021-12-18 01:25:40,299 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_mode_select [2021-12-18 01:25:40,299 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_kobj_remove [2021-12-18 01:25:40,299 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_kobj_remove [2021-12-18 01:25:40,300 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2021-12-18 01:25:40,300 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2021-12-18 01:25:40,300 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_debugfs_cleanup [2021-12-18 01:25:40,300 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_debugfs_cleanup [2021-12-18 01:25:40,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-18 01:25:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2021-12-18 01:25:40,301 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2021-12-18 01:25:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure bio_init [2021-12-18 01:25:40,302 INFO L138 BoogieDeclarations]: Found implementation of procedure bio_init [2021-12-18 01:25:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure set_blocksize [2021-12-18 01:25:40,303 INFO L138 BoogieDeclarations]: Found implementation of procedure set_blocksize [2021-12-18 01:25:40,303 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_dump_sense [2021-12-18 01:25:40,303 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_dump_sense [2021-12-18 01:25:40,303 INFO L130 BoogieDeclarations]: Found specification of procedure mempool_create_kmalloc_pool [2021-12-18 01:25:40,303 INFO L138 BoogieDeclarations]: Found implementation of procedure mempool_create_kmalloc_pool [2021-12-18 01:25:40,303 INFO L130 BoogieDeclarations]: Found specification of procedure mempool_destroy [2021-12-18 01:25:40,304 INFO L138 BoogieDeclarations]: Found implementation of procedure mempool_destroy [2021-12-18 01:25:40,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 01:25:40,304 INFO L130 BoogieDeclarations]: Found specification of procedure remove_proc_entry [2021-12-18 01:25:40,304 INFO L138 BoogieDeclarations]: Found implementation of procedure remove_proc_entry [2021-12-18 01:25:40,304 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_lock_door [2021-12-18 01:25:40,304 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_lock_door [2021-12-18 01:25:40,305 INFO L130 BoogieDeclarations]: Found specification of procedure blkdev_get [2021-12-18 01:25:40,305 INFO L138 BoogieDeclarations]: Found implementation of procedure blkdev_get [2021-12-18 01:25:40,305 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_remove_dev [2021-12-18 01:25:40,305 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_remove_dev [2021-12-18 01:25:40,305 INFO L130 BoogieDeclarations]: Found specification of procedure __free_pages [2021-12-18 01:25:40,305 INFO L138 BoogieDeclarations]: Found implementation of procedure __free_pages [2021-12-18 01:25:40,305 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2021-12-18 01:25:40,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2021-12-18 01:25:40,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 01:25:40,306 INFO L130 BoogieDeclarations]: Found specification of procedure bio_put [2021-12-18 01:25:40,306 INFO L138 BoogieDeclarations]: Found implementation of procedure bio_put [2021-12-18 01:25:40,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-18 01:25:40,306 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2021-12-18 01:25:40,306 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2021-12-18 01:25:40,306 INFO L130 BoogieDeclarations]: Found specification of procedure capable [2021-12-18 01:25:40,306 INFO L138 BoogieDeclarations]: Found implementation of procedure capable [2021-12-18 01:25:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure debugfs_remove [2021-12-18 01:25:40,307 INFO L138 BoogieDeclarations]: Found implementation of procedure debugfs_remove [2021-12-18 01:25:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure debugfs_create_dir [2021-12-18 01:25:40,307 INFO L138 BoogieDeclarations]: Found implementation of procedure debugfs_create_dir [2021-12-18 01:25:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2021-12-18 01:25:40,308 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2021-12-18 01:25:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2021-12-18 01:25:40,308 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2021-12-18 01:25:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2021-12-18 01:25:40,309 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2021-12-18 01:25:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2021-12-18 01:25:40,309 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2021-12-18 01:25:40,310 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2021-12-18 01:25:40,310 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2021-12-18 01:25:40,310 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_sysfs_cleanup [2021-12-18 01:25:40,310 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_sysfs_cleanup [2021-12-18 01:25:40,310 INFO L130 BoogieDeclarations]: Found specification of procedure bio_list_init [2021-12-18 01:25:40,310 INFO L138 BoogieDeclarations]: Found implementation of procedure bio_list_init [2021-12-18 01:25:40,310 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_find_dev_from_minor [2021-12-18 01:25:40,310 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_find_dev_from_minor [2021-12-18 01:25:40,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-12-18 01:25:40,311 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2021-12-18 01:25:40,311 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2021-12-18 01:25:40,311 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2021-12-18 01:25:40,312 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2021-12-18 01:25:40,312 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~int [2021-12-18 01:25:40,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~int [2021-12-18 01:25:40,312 INFO L130 BoogieDeclarations]: Found specification of procedure init_write_congestion_marks [2021-12-18 01:25:40,312 INFO L138 BoogieDeclarations]: Found implementation of procedure init_write_congestion_marks [2021-12-18 01:25:40,313 INFO L130 BoogieDeclarations]: Found specification of procedure list_empty [2021-12-18 01:25:40,313 INFO L138 BoogieDeclarations]: Found implementation of procedure list_empty [2021-12-18 01:25:40,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-12-18 01:25:40,315 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_get_track_info [2021-12-18 01:25:40,315 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_get_track_info [2021-12-18 01:25:40,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-18 01:25:40,316 INFO L130 BoogieDeclarations]: Found specification of procedure single_open [2021-12-18 01:25:40,317 INFO L138 BoogieDeclarations]: Found implementation of procedure single_open [2021-12-18 01:25:40,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2021-12-18 01:25:40,317 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2021-12-18 01:25:40,317 INFO L130 BoogieDeclarations]: Found specification of procedure new_decode_dev [2021-12-18 01:25:40,321 INFO L138 BoogieDeclarations]: Found implementation of procedure new_decode_dev [2021-12-18 01:25:40,321 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2021-12-18 01:25:40,322 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2021-12-18 01:25:40,322 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_kobj_create [2021-12-18 01:25:40,322 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_kobj_create [2021-12-18 01:25:40,322 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-12-18 01:25:40,322 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-12-18 01:25:40,322 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_blkdev [2021-12-18 01:25:40,322 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_blkdev [2021-12-18 01:25:40,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-18 01:25:40,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 01:25:40,322 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2021-12-18 01:25:40,323 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2021-12-18 01:25:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 01:25:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure kobject_put [2021-12-18 01:25:40,323 INFO L138 BoogieDeclarations]: Found implementation of procedure kobject_put [2021-12-18 01:25:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 01:25:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure blk_cleanup_queue [2021-12-18 01:25:40,323 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_cleanup_queue [2021-12-18 01:25:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure queue_max_segments [2021-12-18 01:25:40,323 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_max_segments [2021-12-18 01:25:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_check_events [2021-12-18 01:25:40,324 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_check_events [2021-12-18 01:25:40,324 INFO L130 BoogieDeclarations]: Found specification of procedure init_cdrom_command [2021-12-18 01:25:40,324 INFO L138 BoogieDeclarations]: Found implementation of procedure init_cdrom_command [2021-12-18 01:25:40,324 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2021-12-18 01:25:40,324 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2021-12-18 01:25:40,324 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_mode_sense [2021-12-18 01:25:40,324 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_mode_sense [2021-12-18 01:25:40,324 INFO L130 BoogieDeclarations]: Found specification of procedure put_disk [2021-12-18 01:25:40,324 INFO L138 BoogieDeclarations]: Found implementation of procedure put_disk [2021-12-18 01:25:40,324 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_generic_packet [2021-12-18 01:25:40,324 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_generic_packet [2021-12-18 01:25:40,325 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2021-12-18 01:25:40,325 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2021-12-18 01:25:40,325 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2021-12-18 01:25:40,325 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2021-12-18 01:25:40,325 INFO L130 BoogieDeclarations]: Found specification of procedure blk_queue_max_hw_sectors [2021-12-18 01:25:40,325 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_queue_max_hw_sectors [2021-12-18 01:25:40,325 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_flush_cache [2021-12-18 01:25:40,325 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_flush_cache [2021-12-18 01:25:40,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-18 01:25:40,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 01:25:40,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 01:25:40,326 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2021-12-18 01:25:40,326 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2021-12-18 01:25:40,847 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 01:25:40,854 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 01:25:40,958 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-18 01:25:41,043 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2021-12-18 01:25:41,043 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2021-12-18 01:25:41,661 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-18 01:25:41,664 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-18 01:25:41,664 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-18 01:25:41,665 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-18 01:25:41,667 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-18 01:25:41,667 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-18 01:25:41,670 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-18 01:25:42,450 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##282: assume !false; [2021-12-18 01:25:42,450 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##281: assume false; [2021-12-18 01:25:42,450 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##214: assume !false; [2021-12-18 01:25:42,450 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##213: assume false; [2021-12-18 01:25:42,451 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##301: assume !false; [2021-12-18 01:25:42,451 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##300: assume false; [2021-12-18 01:25:42,451 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##177: assume !false; [2021-12-18 01:25:42,451 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##176: assume false; [2021-12-18 01:25:42,451 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##45: assume !false; [2021-12-18 01:25:42,451 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume false; [2021-12-18 01:25:42,451 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##393: assume !false; [2021-12-18 01:25:42,451 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##392: assume false; [2021-12-18 01:25:42,451 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##153: assume !false; [2021-12-18 01:25:42,451 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##152: assume false; [2021-12-18 01:25:42,484 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 01:25:42,499 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 01:25:42,499 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-18 01:25:42,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:25:42 BoogieIcfgContainer [2021-12-18 01:25:42,502 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 01:25:42,505 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 01:25:42,505 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 01:25:42,507 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 01:25:42,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:25:38" (1/3) ... [2021-12-18 01:25:42,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26bd2a55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:25:42, skipping insertion in model container [2021-12-18 01:25:42,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:25:39" (2/3) ... [2021-12-18 01:25:42,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26bd2a55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:25:42, skipping insertion in model container [2021-12-18 01:25:42,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:25:42" (3/3) ... [2021-12-18 01:25:42,509 INFO L111 eAbstractionObserver]: Analyzing ICFG module_get_put-drivers-block-pktcdvd.ko.cil.out.i [2021-12-18 01:25:42,513 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 01:25:42,513 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-18 01:25:42,555 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 01:25:42,559 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-18 01:25:42,559 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-18 01:25:42,584 INFO L276 IsEmpty]: Start isEmpty. Operand has 1174 states, 836 states have (on average 1.3181818181818181) internal successors, (1102), 856 states have internal predecessors, (1102), 257 states have call successors, (257), 79 states have call predecessors, (257), 79 states have return successors, (257), 254 states have call predecessors, (257), 257 states have call successors, (257) [2021-12-18 01:25:42,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-18 01:25:42,588 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:25:42,588 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:25:42,589 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:25:42,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:25:42,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1329987391, now seen corresponding path program 1 times [2021-12-18 01:25:42,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:25:42,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542947842] [2021-12-18 01:25:42,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:25:42,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:25:42,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:42,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 01:25:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:43,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:25:43,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:43,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 01:25:43,021 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:25:43,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542947842] [2021-12-18 01:25:43,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542947842] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:25:43,022 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:25:43,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 01:25:43,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037979581] [2021-12-18 01:25:43,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:25:43,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 01:25:43,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:25:43,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 01:25:43,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 01:25:43,068 INFO L87 Difference]: Start difference. First operand has 1174 states, 836 states have (on average 1.3181818181818181) internal successors, (1102), 856 states have internal predecessors, (1102), 257 states have call successors, (257), 79 states have call predecessors, (257), 79 states have return successors, (257), 254 states have call predecessors, (257), 257 states have call successors, (257) Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 01:25:45,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:25:45,020 INFO L93 Difference]: Finished difference Result 3663 states and 5242 transitions. [2021-12-18 01:25:45,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 01:25:45,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2021-12-18 01:25:45,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:25:45,045 INFO L225 Difference]: With dead ends: 3663 [2021-12-18 01:25:45,045 INFO L226 Difference]: Without dead ends: 2471 [2021-12-18 01:25:45,058 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 01:25:45,060 INFO L933 BasicCegarLoop]: 1853 mSDtfsCounter, 2074 mSDsluCounter, 2206 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 671 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2274 SdHoareTripleChecker+Valid, 4059 SdHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 671 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-12-18 01:25:45,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2274 Valid, 4059 Invalid, 1587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [671 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-12-18 01:25:45,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2471 states. [2021-12-18 01:25:45,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2471 to 2274. [2021-12-18 01:25:45,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2274 states, 1620 states have (on average 1.3092592592592593) internal successors, (2121), 1653 states have internal predecessors, (2121), 497 states have call successors, (497), 157 states have call predecessors, (497), 156 states have return successors, (498), 489 states have call predecessors, (498), 495 states have call successors, (498) [2021-12-18 01:25:45,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2274 states to 2274 states and 3116 transitions. [2021-12-18 01:25:45,210 INFO L78 Accepts]: Start accepts. Automaton has 2274 states and 3116 transitions. Word has length 23 [2021-12-18 01:25:45,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:25:45,210 INFO L470 AbstractCegarLoop]: Abstraction has 2274 states and 3116 transitions. [2021-12-18 01:25:45,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 01:25:45,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2274 states and 3116 transitions. [2021-12-18 01:25:45,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-12-18 01:25:45,218 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:25:45,218 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 01:25:45,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-18 01:25:45,218 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:25:45,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:25:45,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1907254522, now seen corresponding path program 1 times [2021-12-18 01:25:45,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:25:45,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577323940] [2021-12-18 01:25:45,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:25:45,219 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:25:45,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:45,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 01:25:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:45,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:25:45,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:45,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-18 01:25:45,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:45,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-18 01:25:45,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:45,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-18 01:25:45,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:45,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 01:25:45,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:45,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-18 01:25:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:45,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-18 01:25:45,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:45,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-18 01:25:45,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:45,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-18 01:25:45,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:45,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-18 01:25:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:45,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-18 01:25:45,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:45,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-18 01:25:45,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:45,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-18 01:25:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:45,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-18 01:25:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:45,543 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-18 01:25:45,544 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:25:45,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577323940] [2021-12-18 01:25:45,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577323940] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:25:45,544 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:25:45,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 01:25:45,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374378159] [2021-12-18 01:25:45,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:25:45,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 01:25:45,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:25:45,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 01:25:45,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-18 01:25:45,546 INFO L87 Difference]: Start difference. First operand 2274 states and 3116 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-18 01:25:46,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:25:46,712 INFO L93 Difference]: Finished difference Result 4693 states and 6491 transitions. [2021-12-18 01:25:46,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 01:25:46,713 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2021-12-18 01:25:46,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:25:46,723 INFO L225 Difference]: With dead ends: 4693 [2021-12-18 01:25:46,723 INFO L226 Difference]: Without dead ends: 2468 [2021-12-18 01:25:46,729 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-18 01:25:46,730 INFO L933 BasicCegarLoop]: 1569 mSDtfsCounter, 611 mSDsluCounter, 3494 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 592 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 5063 SdHoareTripleChecker+Invalid, 1509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 592 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-18 01:25:46,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [641 Valid, 5063 Invalid, 1509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [592 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-18 01:25:46,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2468 states. [2021-12-18 01:25:46,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2468 to 2274. [2021-12-18 01:25:46,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2274 states, 1620 states have (on average 1.308641975308642) internal successors, (2120), 1653 states have internal predecessors, (2120), 497 states have call successors, (497), 157 states have call predecessors, (497), 156 states have return successors, (498), 489 states have call predecessors, (498), 495 states have call successors, (498) [2021-12-18 01:25:46,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2274 states to 2274 states and 3115 transitions. [2021-12-18 01:25:46,806 INFO L78 Accepts]: Start accepts. Automaton has 2274 states and 3115 transitions. Word has length 130 [2021-12-18 01:25:46,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:25:46,807 INFO L470 AbstractCegarLoop]: Abstraction has 2274 states and 3115 transitions. [2021-12-18 01:25:46,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-18 01:25:46,807 INFO L276 IsEmpty]: Start isEmpty. Operand 2274 states and 3115 transitions. [2021-12-18 01:25:46,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-18 01:25:46,822 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:25:46,822 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 01:25:46,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-18 01:25:46,823 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:25:46,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:25:46,823 INFO L85 PathProgramCache]: Analyzing trace with hash -579514170, now seen corresponding path program 1 times [2021-12-18 01:25:46,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:25:46,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891001075] [2021-12-18 01:25:46,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:25:46,824 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:25:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:46,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 01:25:46,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:46,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:25:46,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:46,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-18 01:25:46,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:46,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-18 01:25:46,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:46,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-18 01:25:46,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:46,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 01:25:46,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:46,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-18 01:25:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:46,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-18 01:25:46,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:46,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-18 01:25:46,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:46,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-18 01:25:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:46,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-18 01:25:46,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:46,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-18 01:25:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:46,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-18 01:25:46,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:46,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-18 01:25:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:47,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-18 01:25:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:47,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-12-18 01:25:47,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:47,016 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-18 01:25:47,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:25:47,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891001075] [2021-12-18 01:25:47,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891001075] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:25:47,017 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:25:47,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 01:25:47,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181905783] [2021-12-18 01:25:47,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:25:47,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 01:25:47,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:25:47,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 01:25:47,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-18 01:25:47,019 INFO L87 Difference]: Start difference. First operand 2274 states and 3115 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-18 01:25:48,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:25:48,147 INFO L93 Difference]: Finished difference Result 4795 states and 6646 transitions. [2021-12-18 01:25:48,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 01:25:48,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 137 [2021-12-18 01:25:48,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:25:48,158 INFO L225 Difference]: With dead ends: 4795 [2021-12-18 01:25:48,158 INFO L226 Difference]: Without dead ends: 2572 [2021-12-18 01:25:48,164 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-18 01:25:48,165 INFO L933 BasicCegarLoop]: 1629 mSDtfsCounter, 368 mSDsluCounter, 2997 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 4626 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 310 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-18 01:25:48,165 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [400 Valid, 4626 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [310 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-18 01:25:48,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2021-12-18 01:25:48,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 2284. [2021-12-18 01:25:48,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2284 states, 1630 states have (on average 1.30920245398773) internal successors, (2134), 1663 states have internal predecessors, (2134), 497 states have call successors, (497), 157 states have call predecessors, (497), 156 states have return successors, (498), 489 states have call predecessors, (498), 495 states have call successors, (498) [2021-12-18 01:25:48,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 2284 states and 3129 transitions. [2021-12-18 01:25:48,221 INFO L78 Accepts]: Start accepts. Automaton has 2284 states and 3129 transitions. Word has length 137 [2021-12-18 01:25:48,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:25:48,222 INFO L470 AbstractCegarLoop]: Abstraction has 2284 states and 3129 transitions. [2021-12-18 01:25:48,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-18 01:25:48,222 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 3129 transitions. [2021-12-18 01:25:48,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-12-18 01:25:48,224 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:25:48,225 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 01:25:48,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-18 01:25:48,225 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:25:48,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:25:48,225 INFO L85 PathProgramCache]: Analyzing trace with hash -399599362, now seen corresponding path program 1 times [2021-12-18 01:25:48,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:25:48,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113463481] [2021-12-18 01:25:48,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:25:48,226 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:25:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:48,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 01:25:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:48,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:25:48,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:48,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-18 01:25:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:48,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-18 01:25:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:48,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-18 01:25:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:48,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-18 01:25:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:48,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-18 01:25:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:48,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-18 01:25:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:48,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-18 01:25:48,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:48,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-18 01:25:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:48,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-18 01:25:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:48,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-18 01:25:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:48,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-18 01:25:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:48,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-18 01:25:48,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:48,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-12-18 01:25:48,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:48,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-12-18 01:25:48,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:48,470 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-18 01:25:48,471 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:25:48,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113463481] [2021-12-18 01:25:48,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113463481] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:25:48,474 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:25:48,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 01:25:48,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471705404] [2021-12-18 01:25:48,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:25:48,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 01:25:48,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:25:48,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 01:25:48,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-18 01:25:48,475 INFO L87 Difference]: Start difference. First operand 2284 states and 3129 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 3 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2021-12-18 01:25:51,342 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:25:53,401 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:25:54,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:25:54,026 INFO L93 Difference]: Finished difference Result 4715 states and 6521 transitions. [2021-12-18 01:25:54,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 01:25:54,027 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 3 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 143 [2021-12-18 01:25:54,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:25:54,036 INFO L225 Difference]: With dead ends: 4715 [2021-12-18 01:25:54,037 INFO L226 Difference]: Without dead ends: 2478 [2021-12-18 01:25:54,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-18 01:25:54,043 INFO L933 BasicCegarLoop]: 1605 mSDtfsCounter, 308 mSDsluCounter, 5737 mSDsCounter, 0 mSdLazyCounter, 1534 mSolverCounterSat, 279 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 7342 SdHoareTripleChecker+Invalid, 1815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 1534 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2021-12-18 01:25:54,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [338 Valid, 7342 Invalid, 1815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 1534 Invalid, 2 Unknown, 0 Unchecked, 5.4s Time] [2021-12-18 01:25:54,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2478 states. [2021-12-18 01:25:54,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2478 to 2284. [2021-12-18 01:25:54,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2284 states, 1630 states have (on average 1.3085889570552147) internal successors, (2133), 1662 states have internal predecessors, (2133), 497 states have call successors, (497), 157 states have call predecessors, (497), 156 states have return successors, (498), 489 states have call predecessors, (498), 495 states have call successors, (498) [2021-12-18 01:25:54,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 2284 states and 3128 transitions. [2021-12-18 01:25:54,096 INFO L78 Accepts]: Start accepts. Automaton has 2284 states and 3128 transitions. Word has length 143 [2021-12-18 01:25:54,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:25:54,097 INFO L470 AbstractCegarLoop]: Abstraction has 2284 states and 3128 transitions. [2021-12-18 01:25:54,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 3 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2021-12-18 01:25:54,097 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 3128 transitions. [2021-12-18 01:25:54,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2021-12-18 01:25:54,101 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:25:54,102 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 01:25:54,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-18 01:25:54,102 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:25:54,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:25:54,102 INFO L85 PathProgramCache]: Analyzing trace with hash -166705447, now seen corresponding path program 1 times [2021-12-18 01:25:54,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:25:54,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458666123] [2021-12-18 01:25:54,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:25:54,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:25:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:54,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 01:25:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:54,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:25:54,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:54,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-18 01:25:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:54,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:25:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:54,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:25:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:54,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:25:54,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:54,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-18 01:25:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:54,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 01:25:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:54,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-18 01:25:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:54,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-18 01:25:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:54,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-18 01:25:54,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:54,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-18 01:25:54,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:54,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-18 01:25:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:54,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-18 01:25:54,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:54,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-12-18 01:25:54,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:54,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-12-18 01:25:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:54,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-18 01:25:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:54,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2021-12-18 01:25:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:54,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-12-18 01:25:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:54,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-12-18 01:25:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:54,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2021-12-18 01:25:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:25:54,362 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-18 01:25:54,362 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:25:54,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458666123] [2021-12-18 01:25:54,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458666123] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:25:54,363 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:25:54,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 01:25:54,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530767567] [2021-12-18 01:25:54,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:25:54,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 01:25:54,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:25:54,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 01:25:54,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-18 01:25:54,365 INFO L87 Difference]: Start difference. First operand 2284 states and 3128 transitions. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 6 states have internal predecessors, (116), 3 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2021-12-18 01:25:57,462 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:25:59,515 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:26:01,571 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:26:03,494 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:26:05,662 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:26:06,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:26:06,187 INFO L93 Difference]: Finished difference Result 4749 states and 6565 transitions. [2021-12-18 01:26:06,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 01:26:06,187 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 6 states have internal predecessors, (116), 3 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 170 [2021-12-18 01:26:06,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:26:06,199 INFO L225 Difference]: With dead ends: 4749 [2021-12-18 01:26:06,200 INFO L226 Difference]: Without dead ends: 2478 [2021-12-18 01:26:06,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-12-18 01:26:06,206 INFO L933 BasicCegarLoop]: 1572 mSDtfsCounter, 312 mSDsluCounter, 6979 mSDsCounter, 0 mSdLazyCounter, 1824 mSolverCounterSat, 287 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 8551 SdHoareTripleChecker+Invalid, 2115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 287 IncrementalHoareTripleChecker+Valid, 1824 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2021-12-18 01:26:06,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [342 Valid, 8551 Invalid, 2115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [287 Valid, 1824 Invalid, 4 Unknown, 0 Unchecked, 11.7s Time] [2021-12-18 01:26:06,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2478 states. [2021-12-18 01:26:06,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2478 to 2284. [2021-12-18 01:26:06,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2284 states, 1630 states have (on average 1.3079754601226994) internal successors, (2132), 1662 states have internal predecessors, (2132), 497 states have call successors, (497), 157 states have call predecessors, (497), 156 states have return successors, (498), 489 states have call predecessors, (498), 495 states have call successors, (498) [2021-12-18 01:26:06,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 2284 states and 3127 transitions. [2021-12-18 01:26:06,268 INFO L78 Accepts]: Start accepts. Automaton has 2284 states and 3127 transitions. Word has length 170 [2021-12-18 01:26:06,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:26:06,269 INFO L470 AbstractCegarLoop]: Abstraction has 2284 states and 3127 transitions. [2021-12-18 01:26:06,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 6 states have internal predecessors, (116), 3 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2021-12-18 01:26:06,269 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 3127 transitions. [2021-12-18 01:26:06,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-12-18 01:26:06,272 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:26:06,272 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 01:26:06,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-18 01:26:06,272 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:26:06,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:26:06,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1466388562, now seen corresponding path program 1 times [2021-12-18 01:26:06,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:26:06,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289387908] [2021-12-18 01:26:06,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:26:06,273 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:26:06,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:06,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 01:26:06,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:06,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:26:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:06,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-18 01:26:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:06,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:26:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:06,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:26:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:06,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:26:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:06,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-18 01:26:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:06,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 01:26:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:06,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-18 01:26:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:06,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-18 01:26:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:06,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-18 01:26:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:06,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-18 01:26:06,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:06,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-12-18 01:26:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:06,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-18 01:26:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:06,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-18 01:26:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:06,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-18 01:26:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:06,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-18 01:26:06,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:06,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-12-18 01:26:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:06,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-12-18 01:26:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:06,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2021-12-18 01:26:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:06,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2021-12-18 01:26:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:06,513 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-18 01:26:06,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:26:06,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289387908] [2021-12-18 01:26:06,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289387908] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:26:06,514 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:26:06,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 01:26:06,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930880046] [2021-12-18 01:26:06,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:26:06,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 01:26:06,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:26:06,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 01:26:06,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-18 01:26:06,515 INFO L87 Difference]: Start difference. First operand 2284 states and 3127 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-12-18 01:26:09,528 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:26:10,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:26:10,713 INFO L93 Difference]: Finished difference Result 7653 states and 11236 transitions. [2021-12-18 01:26:10,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 01:26:10,714 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 175 [2021-12-18 01:26:10,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:26:10,734 INFO L225 Difference]: With dead ends: 7653 [2021-12-18 01:26:10,735 INFO L226 Difference]: Without dead ends: 5412 [2021-12-18 01:26:10,740 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-18 01:26:10,741 INFO L933 BasicCegarLoop]: 2878 mSDtfsCounter, 2499 mSDsluCounter, 5872 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 912 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2808 SdHoareTripleChecker+Valid, 8750 SdHoareTripleChecker+Invalid, 2220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 912 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2021-12-18 01:26:10,741 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2808 Valid, 8750 Invalid, 2220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [912 Valid, 1307 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2021-12-18 01:26:10,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5412 states. [2021-12-18 01:26:10,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5412 to 2286. [2021-12-18 01:26:10,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2286 states, 1632 states have (on average 1.3075980392156863) internal successors, (2134), 1664 states have internal predecessors, (2134), 497 states have call successors, (497), 157 states have call predecessors, (497), 156 states have return successors, (498), 489 states have call predecessors, (498), 495 states have call successors, (498) [2021-12-18 01:26:10,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2286 states to 2286 states and 3129 transitions. [2021-12-18 01:26:10,826 INFO L78 Accepts]: Start accepts. Automaton has 2286 states and 3129 transitions. Word has length 175 [2021-12-18 01:26:10,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:26:10,826 INFO L470 AbstractCegarLoop]: Abstraction has 2286 states and 3129 transitions. [2021-12-18 01:26:10,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-12-18 01:26:10,826 INFO L276 IsEmpty]: Start isEmpty. Operand 2286 states and 3129 transitions. [2021-12-18 01:26:10,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2021-12-18 01:26:10,829 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:26:10,829 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 01:26:10,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-18 01:26:10,829 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:26:10,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:26:10,830 INFO L85 PathProgramCache]: Analyzing trace with hash 355077106, now seen corresponding path program 1 times [2021-12-18 01:26:10,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:26:10,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132280518] [2021-12-18 01:26:10,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:26:10,830 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:26:10,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:11,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 01:26:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:11,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:26:11,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:11,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-18 01:26:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:11,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:26:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:11,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:26:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:11,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:26:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:11,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-18 01:26:11,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:11,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-18 01:26:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:11,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-18 01:26:11,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:11,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-18 01:26:11,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:11,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-18 01:26:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:11,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-18 01:26:11,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:11,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-18 01:26:11,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:11,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-18 01:26:11,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:11,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-12-18 01:26:11,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:11,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-12-18 01:26:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:11,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-18 01:26:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:11,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-18 01:26:11,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:11,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-12-18 01:26:11,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:11,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-18 01:26:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:11,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-18 01:26:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:11,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-12-18 01:26:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:11,223 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 01:26:11,223 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:26:11,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132280518] [2021-12-18 01:26:11,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132280518] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:26:11,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334818258] [2021-12-18 01:26:11,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:26:11,224 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:26:11,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:26:11,226 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) [2021-12-18 01:26:11,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-18 01:26:11,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:11,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 3095 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-18 01:26:11,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:26:12,131 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-18 01:26:12,131 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:26:12,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334818258] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:26:12,131 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 01:26:12,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2021-12-18 01:26:12,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485435442] [2021-12-18 01:26:12,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:26:12,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 01:26:12,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:26:12,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 01:26:12,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2021-12-18 01:26:12,133 INFO L87 Difference]: Start difference. First operand 2286 states and 3129 transitions. Second operand has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 4 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2021-12-18 01:26:12,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:26:12,292 INFO L93 Difference]: Finished difference Result 4557 states and 6239 transitions. [2021-12-18 01:26:12,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 01:26:12,293 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 4 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 177 [2021-12-18 01:26:12,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:26:12,301 INFO L225 Difference]: With dead ends: 4557 [2021-12-18 01:26:12,301 INFO L226 Difference]: Without dead ends: 2264 [2021-12-18 01:26:12,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2021-12-18 01:26:12,308 INFO L933 BasicCegarLoop]: 1592 mSDtfsCounter, 15 mSDsluCounter, 7932 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 9524 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 01:26:12,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 9524 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 01:26:12,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2021-12-18 01:26:12,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 2264. [2021-12-18 01:26:12,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2264 states, 1619 states have (on average 1.3069796170475603) internal successors, (2116), 1650 states have internal predecessors, (2116), 491 states have call successors, (491), 154 states have call predecessors, (491), 153 states have return successors, (492), 483 states have call predecessors, (492), 489 states have call successors, (492) [2021-12-18 01:26:12,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 2264 states and 3099 transitions. [2021-12-18 01:26:12,370 INFO L78 Accepts]: Start accepts. Automaton has 2264 states and 3099 transitions. Word has length 177 [2021-12-18 01:26:12,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:26:12,370 INFO L470 AbstractCegarLoop]: Abstraction has 2264 states and 3099 transitions. [2021-12-18 01:26:12,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 4 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2021-12-18 01:26:12,371 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 3099 transitions. [2021-12-18 01:26:12,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2021-12-18 01:26:12,373 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:26:12,373 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 01:26:12,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-18 01:26:12,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:26:12,589 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:26:12,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:26:12,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1012368946, now seen corresponding path program 1 times [2021-12-18 01:26:12,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:26:12,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251675424] [2021-12-18 01:26:12,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:26:12,590 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:26:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:12,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 01:26:12,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:12,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:26:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:12,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-18 01:26:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:12,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:26:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:12,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:26:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:12,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:26:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:12,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-18 01:26:12,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:12,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:26:12,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:12,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-18 01:26:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:12,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-18 01:26:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:12,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-18 01:26:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:12,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-18 01:26:12,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:12,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-18 01:26:12,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:12,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-18 01:26:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:12,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-18 01:26:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:12,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-12-18 01:26:12,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:12,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-18 01:26:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:12,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-12-18 01:26:12,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:12,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-12-18 01:26:12,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:12,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2021-12-18 01:26:12,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:12,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2021-12-18 01:26:12,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:12,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2021-12-18 01:26:12,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:12,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2021-12-18 01:26:12,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:12,852 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-12-18 01:26:12,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:26:12,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251675424] [2021-12-18 01:26:12,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251675424] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:26:12,852 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:26:12,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 01:26:12,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210876864] [2021-12-18 01:26:12,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:26:12,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 01:26:12,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:26:12,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 01:26:12,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-18 01:26:12,854 INFO L87 Difference]: Start difference. First operand 2264 states and 3099 transitions. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2021-12-18 01:26:14,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:26:14,195 INFO L93 Difference]: Finished difference Result 4743 states and 6547 transitions. [2021-12-18 01:26:14,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 01:26:14,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 190 [2021-12-18 01:26:14,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:26:14,205 INFO L225 Difference]: With dead ends: 4743 [2021-12-18 01:26:14,205 INFO L226 Difference]: Without dead ends: 2510 [2021-12-18 01:26:14,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-18 01:26:14,210 INFO L933 BasicCegarLoop]: 1568 mSDtfsCounter, 1975 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 710 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2140 SdHoareTripleChecker+Valid, 2431 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 710 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-18 01:26:14,210 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2140 Valid, 2431 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [710 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-18 01:26:14,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2510 states. [2021-12-18 01:26:14,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2510 to 2299. [2021-12-18 01:26:14,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2299 states, 1642 states have (on average 1.3002436053593178) internal successors, (2135), 1673 states have internal predecessors, (2135), 496 states have call successors, (496), 161 states have call predecessors, (496), 160 states have return successors, (497), 488 states have call predecessors, (497), 494 states have call successors, (497) [2021-12-18 01:26:14,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2299 states to 2299 states and 3128 transitions. [2021-12-18 01:26:14,280 INFO L78 Accepts]: Start accepts. Automaton has 2299 states and 3128 transitions. Word has length 190 [2021-12-18 01:26:14,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:26:14,281 INFO L470 AbstractCegarLoop]: Abstraction has 2299 states and 3128 transitions. [2021-12-18 01:26:14,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2021-12-18 01:26:14,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2299 states and 3128 transitions. [2021-12-18 01:26:14,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-12-18 01:26:14,284 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:26:14,284 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 01:26:14,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-18 01:26:14,284 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:26:14,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:26:14,285 INFO L85 PathProgramCache]: Analyzing trace with hash -717257111, now seen corresponding path program 1 times [2021-12-18 01:26:14,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:26:14,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338974017] [2021-12-18 01:26:14,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:26:14,285 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:26:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:14,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 01:26:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:14,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:26:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:14,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-18 01:26:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:14,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:26:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:14,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:26:14,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:14,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:26:14,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:14,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-18 01:26:14,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:14,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:26:14,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:14,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-18 01:26:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:14,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-18 01:26:14,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:14,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-18 01:26:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:14,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-18 01:26:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:14,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-18 01:26:14,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:14,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-18 01:26:14,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:14,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-18 01:26:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:14,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-12-18 01:26:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:14,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-18 01:26:14,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:14,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-12-18 01:26:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:14,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2021-12-18 01:26:14,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:14,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2021-12-18 01:26:14,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:14,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2021-12-18 01:26:14,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:14,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2021-12-18 01:26:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:14,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2021-12-18 01:26:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:14,570 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-18 01:26:14,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:26:14,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338974017] [2021-12-18 01:26:14,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338974017] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:26:14,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787946468] [2021-12-18 01:26:14,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:26:14,571 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:26:14,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:26:14,572 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) [2021-12-18 01:26:14,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-18 01:26:15,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:15,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 3197 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-18 01:26:15,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:26:15,492 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-18 01:26:15,493 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:26:15,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787946468] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:26:15,493 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 01:26:15,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2021-12-18 01:26:15,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596153] [2021-12-18 01:26:15,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:26:15,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 01:26:15,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:26:15,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 01:26:15,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-12-18 01:26:15,496 INFO L87 Difference]: Start difference. First operand 2299 states and 3128 transitions. Second operand has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 3 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2021-12-18 01:26:15,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:26:15,595 INFO L93 Difference]: Finished difference Result 4545 states and 6206 transitions. [2021-12-18 01:26:15,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 01:26:15,596 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 3 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 191 [2021-12-18 01:26:15,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:26:15,603 INFO L225 Difference]: With dead ends: 4545 [2021-12-18 01:26:15,603 INFO L226 Difference]: Without dead ends: 2309 [2021-12-18 01:26:15,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-12-18 01:26:15,637 INFO L933 BasicCegarLoop]: 1573 mSDtfsCounter, 21 mSDsluCounter, 4708 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 6281 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 01:26:15,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 6281 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 01:26:15,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2309 states. [2021-12-18 01:26:15,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2309 to 2307. [2021-12-18 01:26:15,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2307 states, 1649 states have (on average 1.2989690721649485) internal successors, (2142), 1681 states have internal predecessors, (2142), 496 states have call successors, (496), 161 states have call predecessors, (496), 161 states have return successors, (499), 488 states have call predecessors, (499), 494 states have call successors, (499) [2021-12-18 01:26:15,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3137 transitions. [2021-12-18 01:26:15,701 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3137 transitions. Word has length 191 [2021-12-18 01:26:15,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:26:15,701 INFO L470 AbstractCegarLoop]: Abstraction has 2307 states and 3137 transitions. [2021-12-18 01:26:15,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 3 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2021-12-18 01:26:15,702 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3137 transitions. [2021-12-18 01:26:15,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2021-12-18 01:26:15,705 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:26:15,705 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 01:26:15,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-18 01:26:15,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-12-18 01:26:15,928 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:26:15,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:26:15,928 INFO L85 PathProgramCache]: Analyzing trace with hash -289792324, now seen corresponding path program 1 times [2021-12-18 01:26:15,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:26:15,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298022126] [2021-12-18 01:26:15,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:26:15,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:26:16,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:16,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 01:26:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:16,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:26:16,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:16,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-18 01:26:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:16,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:26:16,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:16,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:26:16,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:16,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:26:16,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:16,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-18 01:26:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:16,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:26:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:16,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-18 01:26:16,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:16,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-18 01:26:16,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:16,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-18 01:26:16,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:16,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-18 01:26:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:16,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-18 01:26:16,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:16,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-18 01:26:16,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:16,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-12-18 01:26:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:16,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-18 01:26:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:16,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-18 01:26:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:16,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-12-18 01:26:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:16,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2021-12-18 01:26:16,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:16,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2021-12-18 01:26:16,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:16,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-12-18 01:26:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:16,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-12-18 01:26:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:16,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2021-12-18 01:26:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:16,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2021-12-18 01:26:16,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:16,230 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-18 01:26:16,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:26:16,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298022126] [2021-12-18 01:26:16,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298022126] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:26:16,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163393013] [2021-12-18 01:26:16,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:26:16,231 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:26:16,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:26:16,232 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) [2021-12-18 01:26:16,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-18 01:26:16,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:16,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 3245 conjuncts, 54 conjunts are in the unsatisfiable core [2021-12-18 01:26:16,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:26:17,367 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-18 01:26:17,367 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:26:17,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163393013] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:26:17,367 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 01:26:17,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 18 [2021-12-18 01:26:17,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391951884] [2021-12-18 01:26:17,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:26:17,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-18 01:26:17,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:26:17,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-18 01:26:17,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2021-12-18 01:26:17,369 INFO L87 Difference]: Start difference. First operand 2307 states and 3137 transitions. Second operand has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 7 states have internal predecessors, (136), 2 states have call successors, (28), 2 states have call predecessors, (28), 6 states have return successors, (24), 6 states have call predecessors, (24), 2 states have call successors, (24) [2021-12-18 01:26:17,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:26:17,664 INFO L93 Difference]: Finished difference Result 4605 states and 6291 transitions. [2021-12-18 01:26:17,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-18 01:26:17,664 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 7 states have internal predecessors, (136), 2 states have call successors, (28), 2 states have call predecessors, (28), 6 states have return successors, (24), 6 states have call predecessors, (24), 2 states have call successors, (24) Word has length 197 [2021-12-18 01:26:17,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:26:17,681 INFO L225 Difference]: With dead ends: 4605 [2021-12-18 01:26:17,682 INFO L226 Difference]: Without dead ends: 2333 [2021-12-18 01:26:17,686 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 235 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2021-12-18 01:26:17,687 INFO L933 BasicCegarLoop]: 1580 mSDtfsCounter, 65 mSDsluCounter, 14177 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 15757 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 01:26:17,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 15757 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 01:26:17,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2333 states. [2021-12-18 01:26:17,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2333 to 2309. [2021-12-18 01:26:17,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2309 states, 1650 states have (on average 1.2987878787878788) internal successors, (2143), 1683 states have internal predecessors, (2143), 496 states have call successors, (496), 161 states have call predecessors, (496), 162 states have return successors, (500), 488 states have call predecessors, (500), 494 states have call successors, (500) [2021-12-18 01:26:17,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 2309 states and 3139 transitions. [2021-12-18 01:26:17,750 INFO L78 Accepts]: Start accepts. Automaton has 2309 states and 3139 transitions. Word has length 197 [2021-12-18 01:26:17,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:26:17,750 INFO L470 AbstractCegarLoop]: Abstraction has 2309 states and 3139 transitions. [2021-12-18 01:26:17,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 7 states have internal predecessors, (136), 2 states have call successors, (28), 2 states have call predecessors, (28), 6 states have return successors, (24), 6 states have call predecessors, (24), 2 states have call successors, (24) [2021-12-18 01:26:17,751 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 3139 transitions. [2021-12-18 01:26:17,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2021-12-18 01:26:17,754 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:26:17,754 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 01:26:17,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-18 01:26:17,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:26:17,964 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:26:17,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:26:17,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1264891567, now seen corresponding path program 1 times [2021-12-18 01:26:17,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:26:17,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226631021] [2021-12-18 01:26:17,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:26:17,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:26:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:18,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 01:26:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:18,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:26:18,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:18,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-18 01:26:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:18,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:26:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:18,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:26:18,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:18,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:26:18,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:18,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:26:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:18,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-18 01:26:18,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:18,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:26:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:18,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-18 01:26:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:18,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-18 01:26:18,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:18,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-18 01:26:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:18,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-18 01:26:18,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:18,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-12-18 01:26:18,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:18,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-18 01:26:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:18,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-18 01:26:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:18,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-18 01:26:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:18,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-12-18 01:26:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:18,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-12-18 01:26:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:18,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2021-12-18 01:26:18,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:18,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2021-12-18 01:26:18,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:18,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2021-12-18 01:26:18,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:18,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2021-12-18 01:26:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:18,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2021-12-18 01:26:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:18,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2021-12-18 01:26:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:18,268 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-12-18 01:26:18,268 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:26:18,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226631021] [2021-12-18 01:26:18,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226631021] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:26:18,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713896661] [2021-12-18 01:26:18,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:26:18,269 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:26:18,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:26:18,270 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) [2021-12-18 01:26:18,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-18 01:26:18,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:18,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 3253 conjuncts, 100 conjunts are in the unsatisfiable core [2021-12-18 01:26:18,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:26:18,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:26:18,891 INFO L388 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 [2021-12-18 01:26:18,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:26:18,898 INFO L388 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 [2021-12-18 01:26:18,950 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-18 01:26:18,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-18 01:26:19,276 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-18 01:26:19,276 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-18 01:26:19,530 INFO L388 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 [2021-12-18 01:26:20,196 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-18 01:26:20,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-18 01:26:20,344 INFO L388 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 [2021-12-18 01:26:20,351 INFO L388 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 [2021-12-18 01:26:20,436 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2021-12-18 01:26:21,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2021-12-18 01:26:21,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:26:21,438 INFO L388 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 [2021-12-18 01:26:21,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:26:21,446 INFO L388 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 [2021-12-18 01:26:22,038 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-18 01:26:22,053 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-18 01:26:22,154 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 01:26:22,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 01:26:23,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713896661] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:26:23,193 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 01:26:23,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 24] total 33 [2021-12-18 01:26:23,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234444334] [2021-12-18 01:26:23,194 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 01:26:23,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-18 01:26:23,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:26:23,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-18 01:26:23,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1305, Unknown=9, NotChecked=0, Total=1482 [2021-12-18 01:26:23,196 INFO L87 Difference]: Start difference. First operand 2309 states and 3139 transitions. Second operand has 33 states, 32 states have (on average 7.8125) internal successors, (250), 25 states have internal predecessors, (250), 10 states have call successors, (56), 10 states have call predecessors, (56), 13 states have return successors, (50), 14 states have call predecessors, (50), 9 states have call successors, (50) [2021-12-18 01:26:27,754 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:26:29,810 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:26:31,862 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:26:33,927 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:26:37,075 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:26:39,063 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:26:41,117 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:26:42,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:26:42,254 INFO L93 Difference]: Finished difference Result 4812 states and 6601 transitions. [2021-12-18 01:26:42,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-18 01:26:42,255 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 7.8125) internal successors, (250), 25 states have internal predecessors, (250), 10 states have call successors, (56), 10 states have call predecessors, (56), 13 states have return successors, (50), 14 states have call predecessors, (50), 9 states have call successors, (50) Word has length 201 [2021-12-18 01:26:42,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:26:42,263 INFO L225 Difference]: With dead ends: 4812 [2021-12-18 01:26:42,263 INFO L226 Difference]: Without dead ends: 2506 [2021-12-18 01:26:42,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 342 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=388, Invalid=2795, Unknown=9, NotChecked=0, Total=3192 [2021-12-18 01:26:42,269 INFO L933 BasicCegarLoop]: 1564 mSDtfsCounter, 383 mSDsluCounter, 13210 mSDsCounter, 0 mSdLazyCounter, 3193 mSolverCounterSat, 326 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 14774 SdHoareTripleChecker+Invalid, 4639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 3193 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 1114 IncrementalHoareTripleChecker+Unchecked, 18.2s IncrementalHoareTripleChecker+Time [2021-12-18 01:26:42,269 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [413 Valid, 14774 Invalid, 4639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 3193 Invalid, 6 Unknown, 1114 Unchecked, 18.2s Time] [2021-12-18 01:26:42,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2021-12-18 01:26:42,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2307. [2021-12-18 01:26:42,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2307 states, 1649 states have (on average 1.2983626440266829) internal successors, (2141), 1681 states have internal predecessors, (2141), 496 states have call successors, (496), 161 states have call predecessors, (496), 161 states have return successors, (499), 488 states have call predecessors, (499), 494 states have call successors, (499) [2021-12-18 01:26:42,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3136 transitions. [2021-12-18 01:26:42,336 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3136 transitions. Word has length 201 [2021-12-18 01:26:42,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:26:42,336 INFO L470 AbstractCegarLoop]: Abstraction has 2307 states and 3136 transitions. [2021-12-18 01:26:42,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 7.8125) internal successors, (250), 25 states have internal predecessors, (250), 10 states have call successors, (56), 10 states have call predecessors, (56), 13 states have return successors, (50), 14 states have call predecessors, (50), 9 states have call successors, (50) [2021-12-18 01:26:42,336 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3136 transitions. [2021-12-18 01:26:42,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2021-12-18 01:26:42,339 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:26:42,339 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 01:26:42,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-18 01:26:42,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:26:42,560 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:26:42,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:26:42,560 INFO L85 PathProgramCache]: Analyzing trace with hash 631681022, now seen corresponding path program 2 times [2021-12-18 01:26:42,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:26:42,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194664082] [2021-12-18 01:26:42,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:26:42,560 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:26:42,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:42,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 01:26:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:42,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:26:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:42,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:26:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:42,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-18 01:26:42,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:42,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:26:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:42,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:26:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:42,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:26:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:42,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:26:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:42,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-18 01:26:42,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:42,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:26:42,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:42,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-18 01:26:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:42,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-18 01:26:42,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:43,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-12-18 01:26:43,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:43,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-18 01:26:43,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:43,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-18 01:26:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:43,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-18 01:26:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:43,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-18 01:26:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:43,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-12-18 01:26:43,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:43,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-18 01:26:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:43,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-12-18 01:26:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:43,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-12-18 01:26:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:43,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-12-18 01:26:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:43,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-12-18 01:26:43,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:43,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2021-12-18 01:26:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:43,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-12-18 01:26:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:43,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-18 01:26:43,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:26:43,110 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-12-18 01:26:43,111 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:26:43,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194664082] [2021-12-18 01:26:43,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194664082] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:26:43,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429274258] [2021-12-18 01:26:43,111 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 01:26:43,111 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:26:43,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:26:43,112 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) [2021-12-18 01:26:43,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-18 01:26:44,122 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 01:26:44,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 01:26:44,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 3290 conjuncts, 111 conjunts are in the unsatisfiable core [2021-12-18 01:26:44,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:26:44,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:26:44,158 INFO L388 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 [2021-12-18 01:26:44,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:26:44,162 INFO L388 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 [2021-12-18 01:26:44,225 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-18 01:26:44,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-18 01:26:44,393 INFO L388 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 [2021-12-18 01:26:44,673 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-18 01:26:44,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-18 01:26:44,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:26:44,886 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-18 01:26:44,886 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2021-12-18 01:26:44,968 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 01:26:45,106 INFO L388 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 [2021-12-18 01:26:45,819 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-12-18 01:26:45,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-12-18 01:26:46,086 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2021-12-18 01:26:46,092 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2021-12-18 01:26:46,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:26:46,205 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-12-18 01:26:46,313 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 01:26:46,990 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 01:26:47,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:26:47,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-12-18 01:26:47,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:26:47,863 INFO L388 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 [2021-12-18 01:26:47,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:26:47,873 INFO L388 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 [2021-12-18 01:26:48,497 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-18 01:26:48,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-18 01:26:48,602 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-18 01:26:48,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 01:26:49,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429274258] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:26:49,727 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 01:26:49,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 27] total 38 [2021-12-18 01:26:49,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054657939] [2021-12-18 01:26:49,727 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 01:26:49,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-12-18 01:26:49,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:26:49,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-18 01:26:49,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=1734, Unknown=11, NotChecked=0, Total=1980 [2021-12-18 01:26:49,729 INFO L87 Difference]: Start difference. First operand 2307 states and 3136 transitions. Second operand has 38 states, 37 states have (on average 7.0) internal successors, (259), 29 states have internal predecessors, (259), 12 states have call successors, (57), 11 states have call predecessors, (57), 16 states have return successors, (51), 15 states have call predecessors, (51), 11 states have call successors, (51) [2021-12-18 01:26:54,444 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:26:56,498 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:26:58,557 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:27:00,619 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:27:02,676 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:27:04,735 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:27:06,793 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:27:08,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:27:08,161 INFO L93 Difference]: Finished difference Result 4787 states and 6570 transitions. [2021-12-18 01:27:08,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-12-18 01:27:08,162 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 7.0) internal successors, (259), 29 states have internal predecessors, (259), 12 states have call successors, (57), 11 states have call predecessors, (57), 16 states have return successors, (51), 15 states have call predecessors, (51), 11 states have call successors, (51) Word has length 208 [2021-12-18 01:27:08,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:27:08,168 INFO L225 Difference]: With dead ends: 4787 [2021-12-18 01:27:08,168 INFO L226 Difference]: Without dead ends: 2535 [2021-12-18 01:27:08,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 350 SyntacticMatches, 7 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=416, Invalid=3605, Unknown=11, NotChecked=0, Total=4032 [2021-12-18 01:27:08,174 INFO L933 BasicCegarLoop]: 1551 mSDtfsCounter, 685 mSDsluCounter, 21101 mSDsCounter, 0 mSdLazyCounter, 3492 mSolverCounterSat, 584 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 22652 SdHoareTripleChecker+Invalid, 7562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 584 IncrementalHoareTripleChecker+Valid, 3492 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 3479 IncrementalHoareTripleChecker+Unchecked, 17.5s IncrementalHoareTripleChecker+Time [2021-12-18 01:27:08,175 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [715 Valid, 22652 Invalid, 7562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [584 Valid, 3492 Invalid, 7 Unknown, 3479 Unchecked, 17.5s Time] [2021-12-18 01:27:08,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2535 states. [2021-12-18 01:27:08,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2535 to 2343. [2021-12-18 01:27:08,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2343 states, 1673 states have (on average 1.2946802151823071) internal successors, (2166), 1706 states have internal predecessors, (2166), 499 states have call successors, (499), 167 states have call predecessors, (499), 170 states have return successors, (517), 493 states have call predecessors, (517), 497 states have call successors, (517) [2021-12-18 01:27:08,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 3182 transitions. [2021-12-18 01:27:08,235 INFO L78 Accepts]: Start accepts. Automaton has 2343 states and 3182 transitions. Word has length 208 [2021-12-18 01:27:08,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:27:08,236 INFO L470 AbstractCegarLoop]: Abstraction has 2343 states and 3182 transitions. [2021-12-18 01:27:08,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 7.0) internal successors, (259), 29 states have internal predecessors, (259), 12 states have call successors, (57), 11 states have call predecessors, (57), 16 states have return successors, (51), 15 states have call predecessors, (51), 11 states have call successors, (51) [2021-12-18 01:27:08,236 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 3182 transitions. [2021-12-18 01:27:08,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2021-12-18 01:27:08,238 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:27:08,239 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 01:27:08,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-18 01:27:08,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-18 01:27:08,452 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:27:08,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:27:08,452 INFO L85 PathProgramCache]: Analyzing trace with hash -576133922, now seen corresponding path program 1 times [2021-12-18 01:27:08,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:27:08,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177962506] [2021-12-18 01:27:08,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:27:08,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:27:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:09,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 01:27:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:09,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:27:09,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:09,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:27:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:09,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-18 01:27:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:09,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:27:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:09,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:27:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:09,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:27:09,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:09,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:27:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:09,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-18 01:27:09,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:09,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:27:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:09,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-18 01:27:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:09,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-18 01:27:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:09,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-18 01:27:09,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:09,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-12-18 01:27:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:09,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-12-18 01:27:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:09,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-12-18 01:27:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:09,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-12-18 01:27:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:09,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-18 01:27:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:09,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2021-12-18 01:27:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:09,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2021-12-18 01:27:09,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:09,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2021-12-18 01:27:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:09,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2021-12-18 01:27:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:09,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2021-12-18 01:27:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:09,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2021-12-18 01:27:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:09,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2021-12-18 01:27:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:09,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-12-18 01:27:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:09,992 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-12-18 01:27:09,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:27:09,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177962506] [2021-12-18 01:27:09,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177962506] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:27:09,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970379386] [2021-12-18 01:27:09,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:27:09,993 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:27:09,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:27:09,994 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) [2021-12-18 01:27:09,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-18 01:27:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:10,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 3316 conjuncts, 101 conjunts are in the unsatisfiable core [2021-12-18 01:27:10,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:27:10,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:27:10,653 INFO L388 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 [2021-12-18 01:27:10,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:27:10,659 INFO L388 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 [2021-12-18 01:27:10,716 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-18 01:27:10,717 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-18 01:27:10,899 INFO L388 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 [2021-12-18 01:27:11,143 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-18 01:27:11,144 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-18 01:27:11,342 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-12-18 01:27:11,342 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-12-18 01:27:11,569 INFO L388 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 [2021-12-18 01:27:12,341 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-12-18 01:27:12,341 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-12-18 01:27:12,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2021-12-18 01:27:12,590 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2021-12-18 01:27:12,680 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-12-18 01:27:13,178 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 01:27:13,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2021-12-18 01:27:13,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:27:13,433 INFO L388 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 [2021-12-18 01:27:13,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:27:13,444 INFO L388 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 [2021-12-18 01:27:13,768 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-18 01:27:13,779 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-18 01:27:13,900 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-18 01:27:13,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 01:27:14,216 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_21| Int) (v_ArrVal_842 (Array Int Int)) (|v_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_27| Int) (v_ArrVal_840 (Array Int Int))) (or (<= |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_21| |c_#StackHeapBarrier|) (= 0 (mod (+ (select (select (store |c_#memory_$Pointer$.offset| |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_21| v_ArrVal_842) |c_~#pkt_devs~0.base|) |c_~#pkt_devs~0.offset|) (select (select (store |c_#memory_$Pointer$.base| |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_21| v_ArrVal_840) |c_~#pkt_devs~0.base|) |c_~#pkt_devs~0.offset|)) 18446744073709551616)) (not (= 0 (select (store |c_#valid| |v_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_27| 1) |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_21|))))) is different from false [2021-12-18 01:27:14,638 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_21| Int) (v_ArrVal_842 (Array Int Int)) (v_ArrVal_839 Int) (|v_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_27| Int) (v_ArrVal_840 (Array Int Int))) (or (<= |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_21| |c_#StackHeapBarrier|) (= 0 (mod (+ (select (select (store |c_#memory_$Pointer$.offset| |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_21| v_ArrVal_842) |c_~#pkt_devs~0.base|) |c_~#pkt_devs~0.offset|) (select (select (store |c_#memory_$Pointer$.base| |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_21| v_ArrVal_840) |c_~#pkt_devs~0.base|) |c_~#pkt_devs~0.offset|)) 18446744073709551616)) (not (= 0 (select (store (store |c_#valid| |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_839) |v_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_27| 1) |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_21|))))) is different from false [2021-12-18 01:27:14,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970379386] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:27:14,694 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 01:27:14,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 45 [2021-12-18 01:27:14,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026643428] [2021-12-18 01:27:14,695 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 01:27:14,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-18 01:27:14,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:27:14,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-18 01:27:14,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=2009, Unknown=2, NotChecked=186, Total=2450 [2021-12-18 01:27:14,697 INFO L87 Difference]: Start difference. First operand 2343 states and 3182 transitions. Second operand has 45 states, 44 states have (on average 5.931818181818182) internal successors, (261), 35 states have internal predecessors, (261), 16 states have call successors, (57), 11 states have call predecessors, (57), 17 states have return successors, (51), 21 states have call predecessors, (51), 14 states have call successors, (51) [2021-12-18 01:27:25,951 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:27:29,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:27:29,640 INFO L93 Difference]: Finished difference Result 5585 states and 7672 transitions. [2021-12-18 01:27:29,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2021-12-18 01:27:29,641 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 5.931818181818182) internal successors, (261), 35 states have internal predecessors, (261), 16 states have call successors, (57), 11 states have call predecessors, (57), 17 states have return successors, (51), 21 states have call predecessors, (51), 14 states have call successors, (51) Word has length 211 [2021-12-18 01:27:29,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:27:29,649 INFO L225 Difference]: With dead ends: 5585 [2021-12-18 01:27:29,649 INFO L226 Difference]: Without dead ends: 3330 [2021-12-18 01:27:29,656 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 379 SyntacticMatches, 5 SemanticMatches, 83 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2236 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=773, Invalid=6039, Unknown=2, NotChecked=326, Total=7140 [2021-12-18 01:27:29,657 INFO L933 BasicCegarLoop]: 1547 mSDtfsCounter, 2878 mSDsluCounter, 21949 mSDsCounter, 0 mSdLazyCounter, 14635 mSolverCounterSat, 1538 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2977 SdHoareTripleChecker+Valid, 23496 SdHoareTripleChecker+Invalid, 22752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1538 IncrementalHoareTripleChecker+Valid, 14635 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 6578 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2021-12-18 01:27:29,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2977 Valid, 23496 Invalid, 22752 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1538 Valid, 14635 Invalid, 1 Unknown, 6578 Unchecked, 13.0s Time] [2021-12-18 01:27:29,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3330 states. [2021-12-18 01:27:29,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3330 to 2895. [2021-12-18 01:27:29,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2895 states, 2073 states have (on average 1.3014954172696576) internal successors, (2698), 2118 states have internal predecessors, (2698), 598 states have call successors, (598), 217 states have call predecessors, (598), 223 states have return successors, (616), 584 states have call predecessors, (616), 596 states have call successors, (616) [2021-12-18 01:27:29,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2895 states to 2895 states and 3912 transitions. [2021-12-18 01:27:29,745 INFO L78 Accepts]: Start accepts. Automaton has 2895 states and 3912 transitions. Word has length 211 [2021-12-18 01:27:29,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:27:29,745 INFO L470 AbstractCegarLoop]: Abstraction has 2895 states and 3912 transitions. [2021-12-18 01:27:29,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 5.931818181818182) internal successors, (261), 35 states have internal predecessors, (261), 16 states have call successors, (57), 11 states have call predecessors, (57), 17 states have return successors, (51), 21 states have call predecessors, (51), 14 states have call successors, (51) [2021-12-18 01:27:29,746 INFO L276 IsEmpty]: Start isEmpty. Operand 2895 states and 3912 transitions. [2021-12-18 01:27:29,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2021-12-18 01:27:29,750 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:27:29,751 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 01:27:29,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-18 01:27:29,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:27:29,956 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:27:29,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:27:29,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1431304386, now seen corresponding path program 1 times [2021-12-18 01:27:29,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:27:29,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066827441] [2021-12-18 01:27:29,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:27:29,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:27:30,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:30,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 01:27:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:30,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:27:30,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:30,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:27:30,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:30,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-18 01:27:30,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:30,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:27:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:30,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:27:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:30,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:27:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:30,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:27:30,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:30,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-18 01:27:30,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:30,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:27:30,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:30,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-18 01:27:30,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:30,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-18 01:27:30,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:30,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-12-18 01:27:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:30,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-18 01:27:30,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:30,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-18 01:27:30,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:30,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-18 01:27:30,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:30,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-18 01:27:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:30,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-12-18 01:27:30,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:30,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-12-18 01:27:30,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:30,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2021-12-18 01:27:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:30,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2021-12-18 01:27:30,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:30,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2021-12-18 01:27:30,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:30,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2021-12-18 01:27:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:30,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2021-12-18 01:27:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:30,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2021-12-18 01:27:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:30,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2021-12-18 01:27:30,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:30,178 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-18 01:27:30,179 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:27:30,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066827441] [2021-12-18 01:27:30,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066827441] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:27:30,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525443493] [2021-12-18 01:27:30,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:27:30,179 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:27:30,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:27:30,192 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) [2021-12-18 01:27:30,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-18 01:27:30,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:30,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 3287 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 01:27:30,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:27:31,050 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-12-18 01:27:31,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 01:27:31,353 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-18 01:27:31,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525443493] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 01:27:31,353 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 01:27:31,353 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2021-12-18 01:27:31,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130300157] [2021-12-18 01:27:31,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 01:27:31,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 01:27:31,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:27:31,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 01:27:31,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-12-18 01:27:31,355 INFO L87 Difference]: Start difference. First operand 2895 states and 3912 transitions. Second operand has 9 states, 9 states have (on average 18.666666666666668) internal successors, (168), 7 states have internal predecessors, (168), 2 states have call successors, (48), 4 states have call predecessors, (48), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2021-12-18 01:27:32,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:27:32,858 INFO L93 Difference]: Finished difference Result 6159 states and 8452 transitions. [2021-12-18 01:27:32,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 01:27:32,859 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.666666666666668) internal successors, (168), 7 states have internal predecessors, (168), 2 states have call successors, (48), 4 states have call predecessors, (48), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 209 [2021-12-18 01:27:32,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:27:32,867 INFO L225 Difference]: With dead ends: 6159 [2021-12-18 01:27:32,868 INFO L226 Difference]: Without dead ends: 3646 [2021-12-18 01:27:32,874 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2021-12-18 01:27:32,874 INFO L933 BasicCegarLoop]: 1661 mSDtfsCounter, 714 mSDsluCounter, 2990 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 494 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 4651 SdHoareTripleChecker+Invalid, 1684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 494 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-18 01:27:32,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [752 Valid, 4651 Invalid, 1684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [494 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-12-18 01:27:32,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3646 states. [2021-12-18 01:27:32,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3646 to 2932. [2021-12-18 01:27:32,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2932 states, 2110 states have (on average 1.3018957345971565) internal successors, (2747), 2155 states have internal predecessors, (2747), 598 states have call successors, (598), 217 states have call predecessors, (598), 223 states have return successors, (616), 584 states have call predecessors, (616), 596 states have call successors, (616) [2021-12-18 01:27:32,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2932 states to 2932 states and 3961 transitions. [2021-12-18 01:27:32,988 INFO L78 Accepts]: Start accepts. Automaton has 2932 states and 3961 transitions. Word has length 209 [2021-12-18 01:27:32,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:27:32,988 INFO L470 AbstractCegarLoop]: Abstraction has 2932 states and 3961 transitions. [2021-12-18 01:27:32,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.666666666666668) internal successors, (168), 7 states have internal predecessors, (168), 2 states have call successors, (48), 4 states have call predecessors, (48), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2021-12-18 01:27:32,988 INFO L276 IsEmpty]: Start isEmpty. Operand 2932 states and 3961 transitions. [2021-12-18 01:27:32,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2021-12-18 01:27:32,994 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:27:32,994 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 01:27:33,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-18 01:27:33,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:27:33,200 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:27:33,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:27:33,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1396780750, now seen corresponding path program 1 times [2021-12-18 01:27:33,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:27:33,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128449397] [2021-12-18 01:27:33,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:27:33,200 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:27:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:34,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 01:27:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:34,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:27:34,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:34,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:27:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:34,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-18 01:27:34,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:34,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:27:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:34,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:27:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:34,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:27:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:34,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:27:34,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:34,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-18 01:27:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:34,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:27:34,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:34,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-18 01:27:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:34,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-18 01:27:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:34,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-12-18 01:27:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:34,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-18 01:27:34,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:34,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-18 01:27:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:34,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-18 01:27:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:34,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-18 01:27:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:34,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-12-18 01:27:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:34,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2021-12-18 01:27:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:34,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-12-18 01:27:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:34,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2021-12-18 01:27:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:34,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2021-12-18 01:27:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:34,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2021-12-18 01:27:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:34,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2021-12-18 01:27:34,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:34,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2021-12-18 01:27:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:34,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-12-18 01:27:34,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:34,722 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-12-18 01:27:34,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:27:34,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128449397] [2021-12-18 01:27:34,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128449397] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:27:34,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676185827] [2021-12-18 01:27:34,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:27:34,722 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:27:34,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:27:34,724 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 01:27:34,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-18 01:27:35,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:27:35,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 3296 conjuncts, 107 conjunts are in the unsatisfiable core [2021-12-18 01:27:35,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:27:35,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:27:35,361 INFO L388 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 16 treesize of output 18 [2021-12-18 01:27:35,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:27:35,365 INFO L388 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 16 treesize of output 18 [2021-12-18 01:27:35,421 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-18 01:27:35,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-18 01:27:35,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 01:27:35,636 INFO L388 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 [2021-12-18 01:27:35,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:27:35,984 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-18 01:27:35,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2021-12-18 01:27:36,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:27:36,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:27:36,260 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-12-18 01:27:36,260 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2021-12-18 01:27:36,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:27:36,377 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2021-12-18 01:27:36,570 INFO L388 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 [2021-12-18 01:27:37,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:27:37,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:27:37,457 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-12-18 01:27:37,457 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2021-12-18 01:27:37,749 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 01:27:37,756 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 01:27:37,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:27:37,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:27:37,893 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2021-12-18 01:27:38,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:27:38,029 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2021-12-18 01:27:38,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:27:38,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2021-12-18 01:27:38,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:27:38,776 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2021-12-18 01:27:39,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:27:39,296 INFO L388 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 16 treesize of output 18 [2021-12-18 01:27:39,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:27:39,303 INFO L388 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 16 treesize of output 18 [2021-12-18 01:27:39,760 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-18 01:27:39,764 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-18 01:27:39,893 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-18 01:27:39,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 01:27:40,315 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_22| Int) (v_ArrVal_1079 (Array Int Int)) (|v_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_28| Int) (v_ArrVal_1078 (Array Int Int))) (or (= 0 (mod (let ((.cse0 (+ |c_~#pkt_devs~0.offset| 8))) (+ (select (select (store |c_#memory_$Pointer$.base| |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_22| v_ArrVal_1079) |c_~#pkt_devs~0.base|) .cse0) (select (select (store |c_#memory_$Pointer$.offset| |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_22| v_ArrVal_1078) |c_~#pkt_devs~0.base|) .cse0))) 18446744073709551616)) (not (= 0 (select (store |c_#valid| |v_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_28| 1) |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_22|))) (<= |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_22| |c_#StackHeapBarrier|))) is different from false [2021-12-18 01:27:40,686 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_22| Int) (v_ArrVal_1075 Int) (v_ArrVal_1079 (Array Int Int)) (|v_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_28| Int) (v_ArrVal_1078 (Array Int Int))) (or (= 0 (mod (let ((.cse0 (+ |c_~#pkt_devs~0.offset| 8))) (+ (select (select (store |c_#memory_$Pointer$.base| |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_22| v_ArrVal_1079) |c_~#pkt_devs~0.base|) .cse0) (select (select (store |c_#memory_$Pointer$.offset| |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_22| v_ArrVal_1078) |c_~#pkt_devs~0.base|) .cse0))) 18446744073709551616)) (not (= 0 (select (store (store |c_#valid| |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_1075) |v_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_28| 1) |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_22|))) (<= |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_22| |c_#StackHeapBarrier|))) is different from false [2021-12-18 01:27:40,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676185827] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:27:40,732 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 01:27:40,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 48 [2021-12-18 01:27:40,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912284081] [2021-12-18 01:27:40,733 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 01:27:40,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-12-18 01:27:40,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:27:40,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-12-18 01:27:40,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=2404, Unknown=2, NotChecked=202, Total=2862 [2021-12-18 01:27:40,735 INFO L87 Difference]: Start difference. First operand 2932 states and 3961 transitions. Second operand has 48 states, 47 states have (on average 5.595744680851064) internal successors, (263), 38 states have internal predecessors, (263), 16 states have call successors, (57), 11 states have call predecessors, (57), 17 states have return successors, (51), 21 states have call predecessors, (51), 14 states have call successors, (51) [2021-12-18 01:27:52,922 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:27:54,991 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:27:57,056 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:27:59,121 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:28:01,177 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:28:03,238 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:28:05,293 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:28:07,354 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:28:09,330 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:28:11,390 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:28:13,452 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:28:15,517 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:28:17,584 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:28:19,644 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:28:23,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:28:23,390 INFO L93 Difference]: Finished difference Result 6176 states and 8362 transitions. [2021-12-18 01:28:23,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2021-12-18 01:28:23,391 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 5.595744680851064) internal successors, (263), 38 states have internal predecessors, (263), 16 states have call successors, (57), 11 states have call predecessors, (57), 17 states have return successors, (51), 21 states have call predecessors, (51), 14 states have call successors, (51) Word has length 212 [2021-12-18 01:28:23,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:28:23,398 INFO L225 Difference]: With dead ends: 6176 [2021-12-18 01:28:23,398 INFO L226 Difference]: Without dead ends: 3627 [2021-12-18 01:28:23,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 373 SyntacticMatches, 11 SemanticMatches, 102 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3385 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=863, Invalid=9445, Unknown=2, NotChecked=402, Total=10712 [2021-12-18 01:28:23,403 INFO L933 BasicCegarLoop]: 1694 mSDtfsCounter, 1405 mSDsluCounter, 25869 mSDsCounter, 0 mSdLazyCounter, 14789 mSolverCounterSat, 856 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1450 SdHoareTripleChecker+Valid, 27563 SdHoareTripleChecker+Invalid, 27046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 856 IncrementalHoareTripleChecker+Valid, 14789 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 11388 IncrementalHoareTripleChecker+Unchecked, 39.9s IncrementalHoareTripleChecker+Time [2021-12-18 01:28:23,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1450 Valid, 27563 Invalid, 27046 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [856 Valid, 14789 Invalid, 13 Unknown, 11388 Unchecked, 39.9s Time] [2021-12-18 01:28:23,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3627 states. [2021-12-18 01:28:23,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3627 to 3287. [2021-12-18 01:28:23,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3287 states, 2370 states have (on average 1.29831223628692) internal successors, (3077), 2427 states have internal predecessors, (3077), 648 states have call successors, (648), 256 states have call predecessors, (648), 268 states have return successors, (677), 629 states have call predecessors, (677), 646 states have call successors, (677) [2021-12-18 01:28:23,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3287 states to 3287 states and 4402 transitions. [2021-12-18 01:28:23,493 INFO L78 Accepts]: Start accepts. Automaton has 3287 states and 4402 transitions. Word has length 212 [2021-12-18 01:28:23,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:28:23,493 INFO L470 AbstractCegarLoop]: Abstraction has 3287 states and 4402 transitions. [2021-12-18 01:28:23,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 5.595744680851064) internal successors, (263), 38 states have internal predecessors, (263), 16 states have call successors, (57), 11 states have call predecessors, (57), 17 states have return successors, (51), 21 states have call predecessors, (51), 14 states have call successors, (51) [2021-12-18 01:28:23,494 INFO L276 IsEmpty]: Start isEmpty. Operand 3287 states and 4402 transitions. [2021-12-18 01:28:23,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2021-12-18 01:28:23,499 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:28:23,499 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 01:28:23,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-18 01:28:23,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-18 01:28:23,720 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:28:23,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:28:23,720 INFO L85 PathProgramCache]: Analyzing trace with hash 205853571, now seen corresponding path program 2 times [2021-12-18 01:28:23,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:28:23,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856867806] [2021-12-18 01:28:23,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:28:23,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:28:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:28:24,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 01:28:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:28:24,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:28:24,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:28:24,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:28:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:28:24,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-18 01:28:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:28:24,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:28:24,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:28:24,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:28:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:28:24,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:28:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:28:25,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:28:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:28:25,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-18 01:28:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:28:25,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:28:25,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:28:25,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-18 01:28:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:28:25,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-18 01:28:25,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:28:25,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:28:25,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:28:25,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-18 01:28:25,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:28:25,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-18 01:28:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:28:25,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-12-18 01:28:25,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:28:25,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-12-18 01:28:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:28:25,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-18 01:28:25,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:28:25,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-12-18 01:28:25,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:28:25,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-12-18 01:28:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:28:25,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2021-12-18 01:28:25,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:28:25,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2021-12-18 01:28:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:28:25,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2021-12-18 01:28:25,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:28:25,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-12-18 01:28:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:28:25,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-18 01:28:25,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:28:25,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2021-12-18 01:28:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:28:25,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2021-12-18 01:28:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:28:25,183 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-18 01:28:25,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:28:25,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856867806] [2021-12-18 01:28:25,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856867806] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:28:25,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581691027] [2021-12-18 01:28:25,184 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 01:28:25,184 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:28:25,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:28:25,185 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 01:28:25,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-18 01:28:26,287 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 01:28:26,287 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 01:28:26,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 3353 conjuncts, 506 conjunts are in the unsatisfiable core [2021-12-18 01:28:26,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:28:26,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:28:26,827 INFO L388 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 [2021-12-18 01:28:26,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:28:26,842 INFO L388 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 [2021-12-18 01:28:31,057 INFO L244 Elim1Store]: Index analysis took 164 ms [2021-12-18 01:28:51,756 WARN L227 SmtUtils]: Spent 20.67s on a formula simplification. DAG size of input: 2107 DAG size of output: 1059 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-12-18 01:28:51,760 INFO L354 Elim1Store]: treesize reduction 3168, result has 33.3 percent of original size [2021-12-18 01:28:51,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 177 select indices, 177 select index equivalence classes, 15400 disjoint index pairs (out of 15576 index pairs), introduced 177 new quantified variables, introduced 352 case distinctions, treesize of input 892 treesize of output 2121 [2021-12-18 01:29:04,390 WARN L227 SmtUtils]: Spent 5.25s on a formula simplification that was a NOOP. DAG size: 908 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 01:29:12,398 INFO L388 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 [2021-12-18 01:29:28,428 WARN L227 SmtUtils]: Spent 12.82s on a formula simplification. DAG size of input: 2047 DAG size of output: 1059 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-12-18 01:29:28,430 INFO L354 Elim1Store]: treesize reduction 3168, result has 33.3 percent of original size [2021-12-18 01:29:28,431 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 177 select indices, 177 select index equivalence classes, 15400 disjoint index pairs (out of 15576 index pairs), introduced 177 new quantified variables, introduced 352 case distinctions, treesize of input 892 treesize of output 2121 [2021-12-18 01:29:41,539 WARN L227 SmtUtils]: Spent 5.66s on a formula simplification that was a NOOP. DAG size: 1265 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 01:30:45,492 INFO L244 Elim1Store]: Index analysis took 136 ms [2021-12-18 01:31:07,083 WARN L227 SmtUtils]: Spent 21.57s on a formula simplification. DAG size of input: 2264 DAG size of output: 1065 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-12-18 01:31:07,085 INFO L354 Elim1Store]: treesize reduction 3186, result has 33.3 percent of original size [2021-12-18 01:31:07,086 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 178 select indices, 178 select index equivalence classes, 15576 disjoint index pairs (out of 15753 index pairs), introduced 178 new quantified variables, introduced 354 case distinctions, treesize of input 897 treesize of output 2133 [2021-12-18 01:31:41,776 WARN L227 SmtUtils]: Spent 16.27s on a formula simplification that was a NOOP. DAG size: 1621 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 01:31:43,292 INFO L388 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 [2021-12-18 01:31:49,706 INFO L244 Elim1Store]: Index analysis took 137 ms [2021-12-18 01:32:09,510 WARN L227 SmtUtils]: Spent 19.78s on a formula simplification. DAG size of input: 2190 DAG size of output: 1065 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-12-18 01:32:09,512 INFO L354 Elim1Store]: treesize reduction 3186, result has 33.3 percent of original size [2021-12-18 01:32:09,514 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 178 select indices, 178 select index equivalence classes, 15577 disjoint index pairs (out of 15753 index pairs), introduced 178 new quantified variables, introduced 354 case distinctions, treesize of input 897 treesize of output 2133 [2021-12-18 01:33:10,472 WARN L227 SmtUtils]: Spent 32.11s on a formula simplification that was a NOOP. DAG size: 1979 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 01:34:21,851 WARN L227 SmtUtils]: Spent 31.64s on a formula simplification that was a NOOP. DAG size: 1977 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 01:34:40,312 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 177 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 [2021-12-18 01:34:40,598 INFO L354 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2021-12-18 01:34:40,598 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 177 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 32 [2021-12-18 01:34:41,101 INFO L388 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 7 treesize of output 3 [2021-12-18 01:35:09,748 WARN L227 SmtUtils]: Spent 15.42s on a formula simplification that was a NOOP. DAG size: 1613 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 01:35:40,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 177 select indices, 177 select index equivalence classes, 15753 disjoint index pairs (out of 15576 index pairs), introduced 177 new quantified variables, introduced 0 case distinctions, treesize of input 892 treesize of output 1422 [2021-12-18 01:35:56,560 WARN L227 SmtUtils]: Spent 6.18s on a formula simplification that was a NOOP. DAG size: 1257 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 01:38:51,445 INFO L388 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 [2021-12-18 01:39:07,520 WARN L227 SmtUtils]: Spent 13.46s on a formula simplification. DAG size of input: 2166 DAG size of output: 1065 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-12-18 01:39:07,522 INFO L354 Elim1Store]: treesize reduction 3186, result has 33.3 percent of original size [2021-12-18 01:39:07,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 178 select indices, 178 select index equivalence classes, 15576 disjoint index pairs (out of 15753 index pairs), introduced 178 new quantified variables, introduced 354 case distinctions, treesize of input 897 treesize of output 2133 Killed by 15