./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5450e765-5baf-4b70-be28-854b31259ace/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5450e765-5baf-4b70-be28-854b31259ace/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5450e765-5baf-4b70-be28-854b31259ace/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5450e765-5baf-4b70-be28-854b31259ace/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5450e765-5baf-4b70-be28-854b31259ace/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5450e765-5baf-4b70-be28-854b31259ace/bin/uautomizer-DrprNOufMa --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 c0e62a2f55ddaeb08563a2d9bb0bfed8d8d740037b0faa92e9ebf8fe89adc120 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 20:17:42,466 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 20:17:42,468 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 20:17:42,497 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 20:17:42,498 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 20:17:42,499 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 20:17:42,501 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 20:17:42,503 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 20:17:42,505 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 20:17:42,506 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 20:17:42,507 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 20:17:42,508 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 20:17:42,508 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 20:17:42,510 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 20:17:42,511 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 20:17:42,513 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 20:17:42,514 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 20:17:42,515 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 20:17:42,517 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 20:17:42,519 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 20:17:42,521 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 20:17:42,523 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 20:17:42,524 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 20:17:42,525 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 20:17:42,529 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 20:17:42,529 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 20:17:42,530 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 20:17:42,531 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 20:17:42,531 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 20:17:42,532 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 20:17:42,533 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 20:17:42,533 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 20:17:42,534 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 20:17:42,535 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 20:17:42,536 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 20:17:42,536 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 20:17:42,537 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 20:17:42,537 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 20:17:42,537 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 20:17:42,538 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 20:17:42,539 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 20:17:42,540 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5450e765-5baf-4b70-be28-854b31259ace/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-06 20:17:42,562 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 20:17:42,562 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 20:17:42,562 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 20:17:42,563 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 20:17:42,563 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 20:17:42,563 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 20:17:42,564 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 20:17:42,564 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 20:17:42,564 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 20:17:42,565 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 20:17:42,565 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 20:17:42,565 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 20:17:42,565 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 20:17:42,565 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 20:17:42,565 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 20:17:42,566 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 20:17:42,566 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 20:17:42,566 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 20:17:42,566 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 20:17:42,566 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 20:17:42,566 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 20:17:42,567 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 20:17:42,567 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 20:17:42,567 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 20:17:42,567 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 20:17:42,567 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 20:17:42,568 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 20:17:42,568 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 20:17:42,568 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 20:17:42,568 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 20:17:42,568 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 20:17:42,568 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5450e765-5baf-4b70-be28-854b31259ace/bin/uautomizer-DrprNOufMa/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5450e765-5baf-4b70-be28-854b31259ace/bin/uautomizer-DrprNOufMa 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 -> c0e62a2f55ddaeb08563a2d9bb0bfed8d8d740037b0faa92e9ebf8fe89adc120 [2021-12-06 20:17:42,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 20:17:42,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 20:17:42,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 20:17:42,763 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 20:17:42,764 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 20:17:42,765 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5450e765-5baf-4b70-be28-854b31259ace/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2021-12-06 20:17:42,807 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5450e765-5baf-4b70-be28-854b31259ace/bin/uautomizer-DrprNOufMa/data/332bb31e7/115b3900a563431ea5a65e3096316eae/FLAG3af385034 [2021-12-06 20:17:43,288 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 20:17:43,289 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5450e765-5baf-4b70-be28-854b31259ace/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2021-12-06 20:17:43,304 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5450e765-5baf-4b70-be28-854b31259ace/bin/uautomizer-DrprNOufMa/data/332bb31e7/115b3900a563431ea5a65e3096316eae/FLAG3af385034 [2021-12-06 20:17:43,322 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5450e765-5baf-4b70-be28-854b31259ace/bin/uautomizer-DrprNOufMa/data/332bb31e7/115b3900a563431ea5a65e3096316eae [2021-12-06 20:17:43,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 20:17:43,324 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 20:17:43,325 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 20:17:43,325 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 20:17:43,328 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 20:17:43,328 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 08:17:43" (1/1) ... [2021-12-06 20:17:43,329 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b55402c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:17:43, skipping insertion in model container [2021-12-06 20:17:43,329 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 08:17:43" (1/1) ... [2021-12-06 20:17:43,335 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 20:17:43,386 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 20:17:43,591 WARN L1240 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1764] [2021-12-06 20:17:43,592 WARN L1240 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1765-1766] [2021-12-06 20:17:43,664 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5450e765-5baf-4b70-be28-854b31259ace/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i[52456,52469] [2021-12-06 20:17:43,817 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 20:17:43,831 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 20:17:43,878 WARN L1240 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1764] [2021-12-06 20:17:43,879 WARN L1240 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1765-1766] [2021-12-06 20:17:43,888 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5450e765-5baf-4b70-be28-854b31259ace/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i[52456,52469] [2021-12-06 20:17:43,947 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 20:17:43,970 INFO L208 MainTranslator]: Completed translation [2021-12-06 20:17:43,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:17:43 WrapperNode [2021-12-06 20:17:43,971 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 20:17:43,972 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 20:17:43,972 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 20:17:43,972 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 20:17:43,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:17:43" (1/1) ... [2021-12-06 20:17:44,002 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:17:43" (1/1) ... [2021-12-06 20:17:44,042 INFO L137 Inliner]: procedures = 114, calls = 288, calls flagged for inlining = 49, calls inlined = 38, statements flattened = 878 [2021-12-06 20:17:44,042 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 20:17:44,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 20:17:44,043 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 20:17:44,043 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 20:17:44,052 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:17:43" (1/1) ... [2021-12-06 20:17:44,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:17:43" (1/1) ... [2021-12-06 20:17:44,062 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:17:43" (1/1) ... [2021-12-06 20:17:44,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:17:43" (1/1) ... [2021-12-06 20:17:44,083 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:17:43" (1/1) ... [2021-12-06 20:17:44,088 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:17:43" (1/1) ... [2021-12-06 20:17:44,092 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:17:43" (1/1) ... [2021-12-06 20:17:44,099 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 20:17:44,100 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 20:17:44,100 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 20:17:44,100 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 20:17:44,101 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:17:43" (1/1) ... [2021-12-06 20:17:44,108 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 20:17:44,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5450e765-5baf-4b70-be28-854b31259ace/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:17:44,127 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5450e765-5baf-4b70-be28-854b31259ace/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 20:17:44,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5450e765-5baf-4b70-be28-854b31259ace/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 20:17:44,156 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_stop_kthread [2021-12-06 20:17:44,157 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_stop_kthread [2021-12-06 20:17:44,157 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_lock [2021-12-06 20:17:44,157 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_lock [2021-12-06 20:17:44,157 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-12-06 20:17:44,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-12-06 20:17:44,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-06 20:17:44,157 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_delay [2021-12-06 20:17:44,157 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_delay [2021-12-06 20:17:44,157 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock [2021-12-06 20:17:44,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock [2021-12-06 20:17:44,158 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-06 20:17:44,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-06 20:17:44,158 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_create_kthread [2021-12-06 20:17:44,158 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_create_kthread [2021-12-06 20:17:44,158 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock [2021-12-06 20:17:44,158 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock [2021-12-06 20:17:44,158 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2021-12-06 20:17:44,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2021-12-06 20:17:44,158 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-12-06 20:17:44,159 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-12-06 20:17:44,159 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_spin_write_unlock_irq [2021-12-06 20:17:44,159 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_spin_write_unlock_irq [2021-12-06 20:17:44,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-06 20:17:44,159 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2021-12-06 20:17:44,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2021-12-06 20:17:44,159 INFO L130 BoogieDeclarations]: Found specification of procedure torture_random [2021-12-06 20:17:44,159 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_random [2021-12-06 20:17:44,159 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_cleanup [2021-12-06 20:17:44,159 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_cleanup [2021-12-06 20:17:44,160 INFO L130 BoogieDeclarations]: Found specification of procedure torture_init_end [2021-12-06 20:17:44,160 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_init_end [2021-12-06 20:17:44,160 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-06 20:17:44,160 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-06 20:17:44,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-06 20:17:44,160 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2021-12-06 20:17:44,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2021-12-06 20:17:44,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 20:17:44,160 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2021-12-06 20:17:44,160 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2021-12-06 20:17:44,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-06 20:17:44,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-06 20:17:44,161 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_stats_print [2021-12-06 20:17:44,161 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_stats_print [2021-12-06 20:17:44,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-06 20:17:44,161 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock [2021-12-06 20:17:44,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock [2021-12-06 20:17:44,161 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock_irq [2021-12-06 20:17:44,161 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock_irq [2021-12-06 20:17:44,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 20:17:44,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-06 20:17:44,162 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_delay [2021-12-06 20:17:44,162 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_delay [2021-12-06 20:17:44,162 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2021-12-06 20:17:44,162 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2021-12-06 20:17:44,162 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_unlock [2021-12-06 20:17:44,162 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_unlock [2021-12-06 20:17:44,162 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_print_module_parms [2021-12-06 20:17:44,162 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_print_module_parms [2021-12-06 20:17:44,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 20:17:44,163 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2021-12-06 20:17:44,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2021-12-06 20:17:44,163 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_unlock [2021-12-06 20:17:44,163 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_unlock [2021-12-06 20:17:44,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 20:17:44,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 20:17:44,327 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 20:17:44,329 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 20:17:44,429 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-12-06 20:17:44,818 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 20:17:44,827 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 20:17:44,827 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-06 20:17:44,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 08:17:44 BoogieIcfgContainer [2021-12-06 20:17:44,829 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 20:17:44,830 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 20:17:44,830 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 20:17:44,841 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 20:17:44,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 08:17:43" (1/3) ... [2021-12-06 20:17:44,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b5816e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 08:17:44, skipping insertion in model container [2021-12-06 20:17:44,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:17:43" (2/3) ... [2021-12-06 20:17:44,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b5816e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 08:17:44, skipping insertion in model container [2021-12-06 20:17:44,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 08:17:44" (3/3) ... [2021-12-06 20:17:44,843 INFO L111 eAbstractionObserver]: Analyzing ICFG 43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2021-12-06 20:17:44,846 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 20:17:44,847 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-06 20:17:44,883 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 20:17:44,888 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-06 20:17:44,888 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-06 20:17:44,908 INFO L276 IsEmpty]: Start isEmpty. Operand has 347 states, 258 states have (on average 1.4108527131782946) internal successors, (364), 274 states have internal predecessors, (364), 61 states have call successors, (61), 27 states have call predecessors, (61), 26 states have return successors, (56), 51 states have call predecessors, (56), 56 states have call successors, (56) [2021-12-06 20:17:44,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-06 20:17:44,919 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:17:44,919 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 20:17:44,920 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:17:44,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:17:44,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1909877325, now seen corresponding path program 1 times [2021-12-06 20:17:44,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:17:44,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420977148] [2021-12-06 20:17:44,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:17:44,931 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:17:45,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:45,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:17:45,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:45,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-06 20:17:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:45,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 20:17:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:45,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-06 20:17:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:45,225 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 20:17:45,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:17:45,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420977148] [2021-12-06 20:17:45,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420977148] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:17:45,226 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:17:45,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 20:17:45,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439927387] [2021-12-06 20:17:45,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:17:45,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 20:17:45,231 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:17:45,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 20:17:45,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 20:17:45,254 INFO L87 Difference]: Start difference. First operand has 347 states, 258 states have (on average 1.4108527131782946) internal successors, (364), 274 states have internal predecessors, (364), 61 states have call successors, (61), 27 states have call predecessors, (61), 26 states have return successors, (56), 51 states have call predecessors, (56), 56 states have call successors, (56) Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 20:17:45,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:17:45,851 INFO L93 Difference]: Finished difference Result 1016 states and 1435 transitions. [2021-12-06 20:17:45,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 20:17:45,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2021-12-06 20:17:45,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:17:45,871 INFO L225 Difference]: With dead ends: 1016 [2021-12-06 20:17:45,871 INFO L226 Difference]: Without dead ends: 571 [2021-12-06 20:17:45,877 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-06 20:17:45,880 INFO L933 BasicCegarLoop]: 540 mSDtfsCounter, 595 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 20:17:45,881 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [639 Valid, 987 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-06 20:17:45,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2021-12-06 20:17:45,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 524. [2021-12-06 20:17:45,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 397 states have (on average 1.3778337531486147) internal successors, (547), 408 states have internal predecessors, (547), 86 states have call successors, (86), 45 states have call predecessors, (86), 40 states have return successors, (81), 76 states have call predecessors, (81), 81 states have call successors, (81) [2021-12-06 20:17:45,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 714 transitions. [2021-12-06 20:17:45,965 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 714 transitions. Word has length 45 [2021-12-06 20:17:45,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:17:45,966 INFO L470 AbstractCegarLoop]: Abstraction has 524 states and 714 transitions. [2021-12-06 20:17:45,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 20:17:45,966 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 714 transitions. [2021-12-06 20:17:45,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-06 20:17:45,971 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:17:45,971 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 20:17:45,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 20:17:45,971 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:17:45,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:17:45,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1822185999, now seen corresponding path program 1 times [2021-12-06 20:17:45,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:17:45,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675012084] [2021-12-06 20:17:45,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:17:45,972 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:17:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:46,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:17:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:46,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-06 20:17:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:46,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 20:17:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:46,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 20:17:46,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:46,091 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 20:17:46,091 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:17:46,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675012084] [2021-12-06 20:17:46,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675012084] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:17:46,092 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:17:46,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 20:17:46,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225763123] [2021-12-06 20:17:46,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:17:46,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 20:17:46,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:17:46,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 20:17:46,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 20:17:46,094 INFO L87 Difference]: Start difference. First operand 524 states and 714 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 20:17:46,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:17:46,603 INFO L93 Difference]: Finished difference Result 1271 states and 1794 transitions. [2021-12-06 20:17:46,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 20:17:46,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2021-12-06 20:17:46,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:17:46,609 INFO L225 Difference]: With dead ends: 1271 [2021-12-06 20:17:46,609 INFO L226 Difference]: Without dead ends: 767 [2021-12-06 20:17:46,610 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-06 20:17:46,611 INFO L933 BasicCegarLoop]: 736 mSDtfsCounter, 744 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 1756 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 20:17:46,612 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [800 Valid, 1756 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 20:17:46,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2021-12-06 20:17:46,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 525. [2021-12-06 20:17:46,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 398 states have (on average 1.3768844221105527) internal successors, (548), 409 states have internal predecessors, (548), 86 states have call successors, (86), 45 states have call predecessors, (86), 40 states have return successors, (81), 76 states have call predecessors, (81), 81 states have call successors, (81) [2021-12-06 20:17:46,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 715 transitions. [2021-12-06 20:17:46,643 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 715 transitions. Word has length 47 [2021-12-06 20:17:46,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:17:46,643 INFO L470 AbstractCegarLoop]: Abstraction has 525 states and 715 transitions. [2021-12-06 20:17:46,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 20:17:46,643 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 715 transitions. [2021-12-06 20:17:46,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-06 20:17:46,645 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:17:46,646 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 20:17:46,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 20:17:46,646 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:17:46,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:17:46,646 INFO L85 PathProgramCache]: Analyzing trace with hash -478636591, now seen corresponding path program 1 times [2021-12-06 20:17:46,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:17:46,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263650306] [2021-12-06 20:17:46,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:17:46,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:17:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:46,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:17:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:46,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-06 20:17:46,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:46,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 20:17:46,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:46,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 20:17:46,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:46,732 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 20:17:46,732 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:17:46,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263650306] [2021-12-06 20:17:46,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263650306] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:17:46,732 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:17:46,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 20:17:46,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677974941] [2021-12-06 20:17:46,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:17:46,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 20:17:46,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:17:46,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 20:17:46,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 20:17:46,734 INFO L87 Difference]: Start difference. First operand 525 states and 715 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 20:17:46,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:17:46,952 INFO L93 Difference]: Finished difference Result 1074 states and 1473 transitions. [2021-12-06 20:17:46,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 20:17:46,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2021-12-06 20:17:46,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:17:46,956 INFO L225 Difference]: With dead ends: 1074 [2021-12-06 20:17:46,956 INFO L226 Difference]: Without dead ends: 569 [2021-12-06 20:17:46,957 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-06 20:17:46,958 INFO L933 BasicCegarLoop]: 437 mSDtfsCounter, 534 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 20:17:46,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [565 Valid, 645 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 20:17:46,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2021-12-06 20:17:46,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 525. [2021-12-06 20:17:46,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 398 states have (on average 1.3743718592964824) internal successors, (547), 409 states have internal predecessors, (547), 86 states have call successors, (86), 45 states have call predecessors, (86), 40 states have return successors, (81), 76 states have call predecessors, (81), 81 states have call successors, (81) [2021-12-06 20:17:46,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 714 transitions. [2021-12-06 20:17:46,984 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 714 transitions. Word has length 47 [2021-12-06 20:17:46,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:17:46,985 INFO L470 AbstractCegarLoop]: Abstraction has 525 states and 714 transitions. [2021-12-06 20:17:46,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 20:17:46,985 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 714 transitions. [2021-12-06 20:17:46,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-06 20:17:46,987 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:17:46,987 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 20:17:46,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 20:17:46,987 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:17:46,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:17:46,988 INFO L85 PathProgramCache]: Analyzing trace with hash -457513191, now seen corresponding path program 1 times [2021-12-06 20:17:46,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:17:46,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41425399] [2021-12-06 20:17:46,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:17:46,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:17:47,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:47,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:17:47,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:47,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-06 20:17:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:47,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 20:17:47,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:47,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-06 20:17:47,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:47,077 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 20:17:47,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:17:47,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41425399] [2021-12-06 20:17:47,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41425399] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:17:47,078 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:17:47,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 20:17:47,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620237124] [2021-12-06 20:17:47,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:17:47,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 20:17:47,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:17:47,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 20:17:47,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 20:17:47,079 INFO L87 Difference]: Start difference. First operand 525 states and 714 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-06 20:17:47,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:17:47,517 INFO L93 Difference]: Finished difference Result 1054 states and 1484 transitions. [2021-12-06 20:17:47,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 20:17:47,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 50 [2021-12-06 20:17:47,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:17:47,525 INFO L225 Difference]: With dead ends: 1054 [2021-12-06 20:17:47,525 INFO L226 Difference]: Without dead ends: 1025 [2021-12-06 20:17:47,526 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-06 20:17:47,527 INFO L933 BasicCegarLoop]: 499 mSDtfsCounter, 592 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 20:17:47,527 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [633 Valid, 1000 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 20:17:47,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2021-12-06 20:17:47,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 932. [2021-12-06 20:17:47,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 719 states have (on average 1.411682892906815) internal successors, (1015), 743 states have internal predecessors, (1015), 143 states have call successors, (143), 69 states have call predecessors, (143), 69 states have return successors, (147), 131 states have call predecessors, (147), 138 states have call successors, (147) [2021-12-06 20:17:47,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1305 transitions. [2021-12-06 20:17:47,573 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1305 transitions. Word has length 50 [2021-12-06 20:17:47,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:17:47,574 INFO L470 AbstractCegarLoop]: Abstraction has 932 states and 1305 transitions. [2021-12-06 20:17:47,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-06 20:17:47,574 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1305 transitions. [2021-12-06 20:17:47,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-06 20:17:47,577 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:17:47,577 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2021-12-06 20:17:47,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 20:17:47,577 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:17:47,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:17:47,577 INFO L85 PathProgramCache]: Analyzing trace with hash 638272764, now seen corresponding path program 1 times [2021-12-06 20:17:47,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:17:47,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474116333] [2021-12-06 20:17:47,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:17:47,578 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:17:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:47,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:17:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:47,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-06 20:17:47,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:47,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 20:17:47,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:47,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-06 20:17:47,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:47,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:17:47,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:47,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-06 20:17:47,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:47,659 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 20:17:47,659 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:17:47,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474116333] [2021-12-06 20:17:47,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474116333] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:17:47,660 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:17:47,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 20:17:47,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294754610] [2021-12-06 20:17:47,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:17:47,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 20:17:47,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:17:47,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 20:17:47,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 20:17:47,661 INFO L87 Difference]: Start difference. First operand 932 states and 1305 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-06 20:17:48,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:17:48,405 INFO L93 Difference]: Finished difference Result 2764 states and 3873 transitions. [2021-12-06 20:17:48,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 20:17:48,406 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 65 [2021-12-06 20:17:48,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:17:48,415 INFO L225 Difference]: With dead ends: 2764 [2021-12-06 20:17:48,415 INFO L226 Difference]: Without dead ends: 1852 [2021-12-06 20:17:48,417 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-06 20:17:48,418 INFO L933 BasicCegarLoop]: 462 mSDtfsCounter, 1176 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 567 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 567 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-06 20:17:48,418 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1214 Valid, 1156 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [567 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-06 20:17:48,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2021-12-06 20:17:48,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 1659. [2021-12-06 20:17:48,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1659 states, 1288 states have (on average 1.4122670807453417) internal successors, (1819), 1328 states have internal predecessors, (1819), 247 states have call successors, (247), 126 states have call predecessors, (247), 123 states have return successors, (246), 228 states have call predecessors, (246), 242 states have call successors, (246) [2021-12-06 20:17:48,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2312 transitions. [2021-12-06 20:17:48,494 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2312 transitions. Word has length 65 [2021-12-06 20:17:48,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:17:48,494 INFO L470 AbstractCegarLoop]: Abstraction has 1659 states and 2312 transitions. [2021-12-06 20:17:48,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-06 20:17:48,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2312 transitions. [2021-12-06 20:17:48,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-06 20:17:48,498 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:17:48,499 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-06 20:17:48,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-06 20:17:48,499 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:17:48,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:17:48,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1750010362, now seen corresponding path program 1 times [2021-12-06 20:17:48,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:17:48,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694770644] [2021-12-06 20:17:48,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:17:48,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:17:48,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:48,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:17:48,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:48,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-06 20:17:48,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:48,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 20:17:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:48,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 20:17:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:48,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:17:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:48,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-06 20:17:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:48,617 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-06 20:17:48,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:17:48,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694770644] [2021-12-06 20:17:48,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694770644] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:17:48,617 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:17:48,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 20:17:48,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50530015] [2021-12-06 20:17:48,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:17:48,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 20:17:48,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:17:48,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 20:17:48,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 20:17:48,619 INFO L87 Difference]: Start difference. First operand 1659 states and 2312 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-06 20:17:49,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:17:49,142 INFO L93 Difference]: Finished difference Result 3474 states and 4860 transitions. [2021-12-06 20:17:49,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 20:17:49,143 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2021-12-06 20:17:49,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:17:49,155 INFO L225 Difference]: With dead ends: 3474 [2021-12-06 20:17:49,155 INFO L226 Difference]: Without dead ends: 1803 [2021-12-06 20:17:49,160 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-06 20:17:49,161 INFO L933 BasicCegarLoop]: 416 mSDtfsCounter, 434 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 20:17:49,161 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [443 Valid, 1415 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 20:17:49,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2021-12-06 20:17:49,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1639. [2021-12-06 20:17:49,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1639 states, 1272 states have (on average 1.404874213836478) internal successors, (1787), 1312 states have internal predecessors, (1787), 243 states have call successors, (243), 126 states have call predecessors, (243), 123 states have return successors, (242), 224 states have call predecessors, (242), 238 states have call successors, (242) [2021-12-06 20:17:49,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1639 states and 2272 transitions. [2021-12-06 20:17:49,255 INFO L78 Accepts]: Start accepts. Automaton has 1639 states and 2272 transitions. Word has length 73 [2021-12-06 20:17:49,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:17:49,256 INFO L470 AbstractCegarLoop]: Abstraction has 1639 states and 2272 transitions. [2021-12-06 20:17:49,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-06 20:17:49,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1639 states and 2272 transitions. [2021-12-06 20:17:49,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-06 20:17:49,258 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:17:49,258 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2021-12-06 20:17:49,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-06 20:17:49,259 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:17:49,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:17:49,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1924223221, now seen corresponding path program 1 times [2021-12-06 20:17:49,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:17:49,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515963377] [2021-12-06 20:17:49,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:17:49,259 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:17:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:49,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:17:49,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:49,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-06 20:17:49,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:49,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 20:17:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:49,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-06 20:17:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:49,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:17:49,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:49,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-06 20:17:49,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:49,342 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 20:17:49,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:17:49,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515963377] [2021-12-06 20:17:49,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515963377] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:17:49,343 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:17:49,343 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 20:17:49,343 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788958466] [2021-12-06 20:17:49,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:17:49,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 20:17:49,344 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:17:49,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 20:17:49,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 20:17:49,344 INFO L87 Difference]: Start difference. First operand 1639 states and 2272 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-06 20:17:49,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:17:49,963 INFO L93 Difference]: Finished difference Result 4908 states and 6816 transitions. [2021-12-06 20:17:49,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 20:17:49,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 71 [2021-12-06 20:17:49,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:17:49,978 INFO L225 Difference]: With dead ends: 4908 [2021-12-06 20:17:49,978 INFO L226 Difference]: Without dead ends: 3289 [2021-12-06 20:17:49,982 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-06 20:17:49,983 INFO L933 BasicCegarLoop]: 529 mSDtfsCounter, 772 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 20:17:49,983 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [807 Valid, 1272 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-06 20:17:49,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3289 states. [2021-12-06 20:17:50,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3289 to 2936. [2021-12-06 20:17:50,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2936 states, 2278 states have (on average 1.3999122036874452) internal successors, (3189), 2354 states have internal predecessors, (3189), 428 states have call successors, (428), 230 states have call predecessors, (428), 229 states have return successors, (431), 395 states have call predecessors, (431), 423 states have call successors, (431) [2021-12-06 20:17:50,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2936 states to 2936 states and 4048 transitions. [2021-12-06 20:17:50,108 INFO L78 Accepts]: Start accepts. Automaton has 2936 states and 4048 transitions. Word has length 71 [2021-12-06 20:17:50,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:17:50,109 INFO L470 AbstractCegarLoop]: Abstraction has 2936 states and 4048 transitions. [2021-12-06 20:17:50,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-06 20:17:50,109 INFO L276 IsEmpty]: Start isEmpty. Operand 2936 states and 4048 transitions. [2021-12-06 20:17:50,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-12-06 20:17:50,113 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:17:50,113 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:17:50,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-06 20:17:50,114 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:17:50,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:17:50,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1077933097, now seen corresponding path program 1 times [2021-12-06 20:17:50,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:17:50,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606403269] [2021-12-06 20:17:50,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:17:50,114 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:17:50,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:50,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:17:50,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:50,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-06 20:17:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:50,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 20:17:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:50,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-06 20:17:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:50,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:17:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:50,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:17:50,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:50,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-06 20:17:50,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:50,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 20:17:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:50,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-06 20:17:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:50,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-06 20:17:50,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:50,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:17:50,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:50,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-06 20:17:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:50,236 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 20:17:50,236 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:17:50,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606403269] [2021-12-06 20:17:50,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606403269] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:17:50,236 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:17:50,236 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 20:17:50,236 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173390422] [2021-12-06 20:17:50,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:17:50,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 20:17:50,237 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:17:50,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 20:17:50,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-06 20:17:50,237 INFO L87 Difference]: Start difference. First operand 2936 states and 4048 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (17), 7 states have call predecessors, (17), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-06 20:17:51,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:17:51,121 INFO L93 Difference]: Finished difference Result 7847 states and 10900 transitions. [2021-12-06 20:17:51,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 20:17:51,121 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (17), 7 states have call predecessors, (17), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2021-12-06 20:17:51,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:17:51,144 INFO L225 Difference]: With dead ends: 7847 [2021-12-06 20:17:51,144 INFO L226 Difference]: Without dead ends: 4931 [2021-12-06 20:17:51,150 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-12-06 20:17:51,151 INFO L933 BasicCegarLoop]: 733 mSDtfsCounter, 1054 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 644 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 1267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 644 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-06 20:17:51,151 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1087 Valid, 1646 Invalid, 1267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [644 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-06 20:17:51,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4931 states. [2021-12-06 20:17:51,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4931 to 4414. [2021-12-06 20:17:51,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4414 states, 3444 states have (on average 1.3945993031358885) internal successors, (4803), 3560 states have internal predecessors, (4803), 627 states have call successors, (627), 341 states have call predecessors, (627), 342 states have return successors, (634), 580 states have call predecessors, (634), 622 states have call successors, (634) [2021-12-06 20:17:51,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4414 states to 4414 states and 6064 transitions. [2021-12-06 20:17:51,330 INFO L78 Accepts]: Start accepts. Automaton has 4414 states and 6064 transitions. Word has length 117 [2021-12-06 20:17:51,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:17:51,331 INFO L470 AbstractCegarLoop]: Abstraction has 4414 states and 6064 transitions. [2021-12-06 20:17:51,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (17), 7 states have call predecessors, (17), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-06 20:17:51,331 INFO L276 IsEmpty]: Start isEmpty. Operand 4414 states and 6064 transitions. [2021-12-06 20:17:51,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-12-06 20:17:51,336 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:17:51,336 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:17:51,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-06 20:17:51,336 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:17:51,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:17:51,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1717722878, now seen corresponding path program 1 times [2021-12-06 20:17:51,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:17:51,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774249720] [2021-12-06 20:17:51,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:17:51,337 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:17:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:51,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:17:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:51,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-06 20:17:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:51,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 20:17:51,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:51,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-06 20:17:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:51,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:17:51,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:51,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:17:51,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:51,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-06 20:17:51,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:51,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 20:17:51,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:51,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-06 20:17:51,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:51,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 20:17:51,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:51,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:17:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:51,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-06 20:17:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:51,464 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 20:17:51,465 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:17:51,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774249720] [2021-12-06 20:17:51,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774249720] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:17:51,465 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:17:51,465 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 20:17:51,465 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191904607] [2021-12-06 20:17:51,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:17:51,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 20:17:51,466 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:17:51,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 20:17:51,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-06 20:17:51,466 INFO L87 Difference]: Start difference. First operand 4414 states and 6064 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-06 20:17:52,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:17:52,348 INFO L93 Difference]: Finished difference Result 11777 states and 16307 transitions. [2021-12-06 20:17:52,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 20:17:52,349 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 123 [2021-12-06 20:17:52,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:17:52,382 INFO L225 Difference]: With dead ends: 11777 [2021-12-06 20:17:52,383 INFO L226 Difference]: Without dead ends: 7383 [2021-12-06 20:17:52,392 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-12-06 20:17:52,392 INFO L933 BasicCegarLoop]: 708 mSDtfsCounter, 788 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 427 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 1931 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 427 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-06 20:17:52,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [821 Valid, 1931 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [427 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-06 20:17:52,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7383 states. [2021-12-06 20:17:52,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7383 to 6624. [2021-12-06 20:17:52,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6624 states, 5195 states have (on average 1.3897978825794033) internal successors, (7220), 5371 states have internal predecessors, (7220), 918 states have call successors, (918), 506 states have call predecessors, (918), 510 states have return successors, (931), 850 states have call predecessors, (931), 913 states have call successors, (931) [2021-12-06 20:17:52,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6624 states to 6624 states and 9069 transitions. [2021-12-06 20:17:52,655 INFO L78 Accepts]: Start accepts. Automaton has 6624 states and 9069 transitions. Word has length 123 [2021-12-06 20:17:52,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:17:52,655 INFO L470 AbstractCegarLoop]: Abstraction has 6624 states and 9069 transitions. [2021-12-06 20:17:52,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-06 20:17:52,655 INFO L276 IsEmpty]: Start isEmpty. Operand 6624 states and 9069 transitions. [2021-12-06 20:17:52,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-12-06 20:17:52,660 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:17:52,661 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:17:52,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-06 20:17:52,661 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:17:52,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:17:52,661 INFO L85 PathProgramCache]: Analyzing trace with hash 723546157, now seen corresponding path program 1 times [2021-12-06 20:17:52,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:17:52,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928187468] [2021-12-06 20:17:52,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:17:52,662 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:17:52,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:52,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:17:52,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:52,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-06 20:17:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:52,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 20:17:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:52,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-06 20:17:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:52,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:17:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:52,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:17:52,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:52,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-06 20:17:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:52,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 20:17:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:52,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-06 20:17:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:52,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-06 20:17:52,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:52,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:17:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:52,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-06 20:17:52,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:52,796 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-06 20:17:52,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:17:52,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928187468] [2021-12-06 20:17:52,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928187468] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:17:52,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716344498] [2021-12-06 20:17:52,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:17:52,796 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:17:52,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5450e765-5baf-4b70-be28-854b31259ace/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:17:52,797 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5450e765-5baf-4b70-be28-854b31259ace/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 20:17:52,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5450e765-5baf-4b70-be28-854b31259ace/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 20:17:52,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:52,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 1059 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-06 20:17:52,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:17:53,125 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-06 20:17:53,126 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:17:53,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716344498] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:17:53,126 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 20:17:53,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2021-12-06 20:17:53,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396693765] [2021-12-06 20:17:53,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:17:53,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 20:17:53,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:17:53,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 20:17:53,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-12-06 20:17:53,127 INFO L87 Difference]: Start difference. First operand 6624 states and 9069 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-06 20:17:53,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:17:53,343 INFO L93 Difference]: Finished difference Result 13336 states and 18277 transitions. [2021-12-06 20:17:53,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 20:17:53,344 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 127 [2021-12-06 20:17:53,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:17:53,379 INFO L225 Difference]: With dead ends: 13336 [2021-12-06 20:17:53,379 INFO L226 Difference]: Without dead ends: 6606 [2021-12-06 20:17:53,391 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-12-06 20:17:53,392 INFO L933 BasicCegarLoop]: 448 mSDtfsCounter, 6 mSDsluCounter, 1319 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1767 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:17:53,392 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 1767 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 20:17:53,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6606 states. [2021-12-06 20:17:53,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6606 to 6606. [2021-12-06 20:17:53,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6606 states, 5159 states have (on average 1.3855398333010274) internal successors, (7148), 5344 states have internal predecessors, (7148), 936 states have call successors, (936), 506 states have call predecessors, (936), 510 states have return successors, (940), 859 states have call predecessors, (940), 922 states have call successors, (940) [2021-12-06 20:17:53,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6606 states to 6606 states and 9024 transitions. [2021-12-06 20:17:53,640 INFO L78 Accepts]: Start accepts. Automaton has 6606 states and 9024 transitions. Word has length 127 [2021-12-06 20:17:53,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:17:53,640 INFO L470 AbstractCegarLoop]: Abstraction has 6606 states and 9024 transitions. [2021-12-06 20:17:53,640 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-06 20:17:53,640 INFO L276 IsEmpty]: Start isEmpty. Operand 6606 states and 9024 transitions. [2021-12-06 20:17:53,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-12-06 20:17:53,646 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:17:53,646 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:17:53,681 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5450e765-5baf-4b70-be28-854b31259ace/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-06 20:17:53,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5450e765-5baf-4b70-be28-854b31259ace/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:17:53,847 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:17:53,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:17:53,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1165331384, now seen corresponding path program 1 times [2021-12-06 20:17:53,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:17:53,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626422199] [2021-12-06 20:17:53,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:17:53,848 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:17:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:53,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:17:53,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:53,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-06 20:17:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:53,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 20:17:53,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:53,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-06 20:17:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:53,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:17:53,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:53,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:17:53,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:53,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-06 20:17:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:53,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-06 20:17:53,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:53,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-06 20:17:53,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:54,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-06 20:17:54,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:54,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:17:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:54,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-06 20:17:54,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:54,019 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-06 20:17:54,019 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:17:54,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626422199] [2021-12-06 20:17:54,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626422199] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:17:54,019 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:17:54,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 20:17:54,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417989996] [2021-12-06 20:17:54,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:17:54,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 20:17:54,020 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:17:54,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 20:17:54,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-06 20:17:54,021 INFO L87 Difference]: Start difference. First operand 6606 states and 9024 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (17), 7 states have call predecessors, (17), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-06 20:17:54,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:17:54,597 INFO L93 Difference]: Finished difference Result 13880 states and 19040 transitions. [2021-12-06 20:17:54,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 20:17:54,598 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (17), 7 states have call predecessors, (17), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 129 [2021-12-06 20:17:54,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:17:54,619 INFO L225 Difference]: With dead ends: 13880 [2021-12-06 20:17:54,619 INFO L226 Difference]: Without dead ends: 7294 [2021-12-06 20:17:54,630 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-12-06 20:17:54,631 INFO L933 BasicCegarLoop]: 402 mSDtfsCounter, 785 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 333 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 333 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 20:17:54,631 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [810 Valid, 1187 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [333 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 20:17:54,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7294 states. [2021-12-06 20:17:54,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7294 to 6570. [2021-12-06 20:17:54,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6570 states, 5123 states have (on average 1.3812219402693735) internal successors, (7076), 5308 states have internal predecessors, (7076), 936 states have call successors, (936), 506 states have call predecessors, (936), 510 states have return successors, (940), 859 states have call predecessors, (940), 922 states have call successors, (940) [2021-12-06 20:17:54,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6570 states to 6570 states and 8952 transitions. [2021-12-06 20:17:54,852 INFO L78 Accepts]: Start accepts. Automaton has 6570 states and 8952 transitions. Word has length 129 [2021-12-06 20:17:54,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:17:54,852 INFO L470 AbstractCegarLoop]: Abstraction has 6570 states and 8952 transitions. [2021-12-06 20:17:54,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (17), 7 states have call predecessors, (17), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-06 20:17:54,853 INFO L276 IsEmpty]: Start isEmpty. Operand 6570 states and 8952 transitions. [2021-12-06 20:17:54,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-12-06 20:17:54,857 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:17:54,857 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:17:54,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-06 20:17:54,858 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:17:54,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:17:54,858 INFO L85 PathProgramCache]: Analyzing trace with hash -985966780, now seen corresponding path program 1 times [2021-12-06 20:17:54,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:17:54,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879940458] [2021-12-06 20:17:54,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:17:54,858 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:17:54,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:54,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:17:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:54,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-06 20:17:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:54,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 20:17:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:54,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-06 20:17:54,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:54,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:17:54,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:54,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:17:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:54,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-06 20:17:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:54,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-06 20:17:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:54,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-06 20:17:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:54,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-06 20:17:54,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:54,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:17:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:54,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-06 20:17:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:54,994 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-06 20:17:54,994 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:17:54,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879940458] [2021-12-06 20:17:54,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879940458] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:17:54,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977557714] [2021-12-06 20:17:54,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:17:54,995 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:17:54,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5450e765-5baf-4b70-be28-854b31259ace/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:17:54,996 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5450e765-5baf-4b70-be28-854b31259ace/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 20:17:54,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5450e765-5baf-4b70-be28-854b31259ace/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-06 20:17:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:55,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 1071 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 20:17:55,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:17:55,335 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-06 20:17:55,336 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:17:55,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977557714] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:17:55,336 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 20:17:55,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 10 [2021-12-06 20:17:55,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028899918] [2021-12-06 20:17:55,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:17:55,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 20:17:55,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:17:55,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 20:17:55,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-06 20:17:55,337 INFO L87 Difference]: Start difference. First operand 6570 states and 8952 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 4 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2021-12-06 20:17:55,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:17:55,882 INFO L93 Difference]: Finished difference Result 19649 states and 26785 transitions. [2021-12-06 20:17:55,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 20:17:55,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 4 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 130 [2021-12-06 20:17:55,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:17:55,926 INFO L225 Difference]: With dead ends: 19649 [2021-12-06 20:17:55,926 INFO L226 Difference]: Without dead ends: 19622 [2021-12-06 20:17:55,932 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-06 20:17:55,933 INFO L933 BasicCegarLoop]: 846 mSDtfsCounter, 774 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 20:17:55,933 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [774 Valid, 1682 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 20:17:55,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19622 states. [2021-12-06 20:17:56,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19622 to 19472. [2021-12-06 20:17:56,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19472 states, 15165 states have (on average 1.3853610286844709) internal successors, (21009), 15720 states have internal predecessors, (21009), 2784 states have call successors, (2784), 1500 states have call predecessors, (2784), 1522 states have return successors, (2806), 2563 states have call predecessors, (2806), 2752 states have call successors, (2806) [2021-12-06 20:17:56,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19472 states to 19472 states and 26599 transitions. [2021-12-06 20:17:56,578 INFO L78 Accepts]: Start accepts. Automaton has 19472 states and 26599 transitions. Word has length 130 [2021-12-06 20:17:56,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:17:56,578 INFO L470 AbstractCegarLoop]: Abstraction has 19472 states and 26599 transitions. [2021-12-06 20:17:56,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 4 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2021-12-06 20:17:56,579 INFO L276 IsEmpty]: Start isEmpty. Operand 19472 states and 26599 transitions. [2021-12-06 20:17:56,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-06 20:17:56,593 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:17:56,593 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-12-06 20:17:56,614 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5450e765-5baf-4b70-be28-854b31259ace/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-06 20:17:56,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5450e765-5baf-4b70-be28-854b31259ace/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:17:56,794 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:17:56,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:17:56,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1089963992, now seen corresponding path program 1 times [2021-12-06 20:17:56,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:17:56,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393314096] [2021-12-06 20:17:56,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:17:56,795 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:17:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:56,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:17:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:56,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-06 20:17:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:56,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 20:17:56,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:56,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-06 20:17:56,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:56,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:17:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:56,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:17:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:56,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-06 20:17:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:56,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-06 20:17:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:56,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-06 20:17:56,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:56,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-06 20:17:56,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:56,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:17:56,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:56,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-06 20:17:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:56,922 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-06 20:17:56,922 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:17:56,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393314096] [2021-12-06 20:17:56,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393314096] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:17:56,923 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:17:56,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 20:17:56,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611147942] [2021-12-06 20:17:56,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:17:56,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 20:17:56,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:17:56,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 20:17:56,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-06 20:17:56,925 INFO L87 Difference]: Start difference. First operand 19472 states and 26599 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (15), 7 states have call predecessors, (15), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-06 20:17:57,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:17:57,644 INFO L93 Difference]: Finished difference Result 26068 states and 35801 transitions. [2021-12-06 20:17:57,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 20:17:57,645 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (15), 7 states have call predecessors, (15), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 135 [2021-12-06 20:17:57,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:17:57,657 INFO L225 Difference]: With dead ends: 26068 [2021-12-06 20:17:57,657 INFO L226 Difference]: Without dead ends: 6429 [2021-12-06 20:17:57,684 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-12-06 20:17:57,685 INFO L933 BasicCegarLoop]: 516 mSDtfsCounter, 867 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 471 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 471 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 20:17:57,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [890 Valid, 1176 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [471 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 20:17:57,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6429 states. [2021-12-06 20:17:57,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6429 to 6299. [2021-12-06 20:17:57,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6299 states, 5043 states have (on average 1.403926234384295) internal successors, (7080), 5166 states have internal predecessors, (7080), 795 states have call successors, (795), 465 states have call predecessors, (795), 460 states have return successors, (790), 775 states have call predecessors, (790), 790 states have call successors, (790) [2021-12-06 20:17:57,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6299 states to 6299 states and 8665 transitions. [2021-12-06 20:17:57,857 INFO L78 Accepts]: Start accepts. Automaton has 6299 states and 8665 transitions. Word has length 135 [2021-12-06 20:17:57,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:17:57,857 INFO L470 AbstractCegarLoop]: Abstraction has 6299 states and 8665 transitions. [2021-12-06 20:17:57,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (15), 7 states have call predecessors, (15), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-06 20:17:57,857 INFO L276 IsEmpty]: Start isEmpty. Operand 6299 states and 8665 transitions. [2021-12-06 20:17:57,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-12-06 20:17:57,866 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:17:57,867 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:17:57,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-06 20:17:57,867 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:17:57,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:17:57,867 INFO L85 PathProgramCache]: Analyzing trace with hash 862404707, now seen corresponding path program 1 times [2021-12-06 20:17:57,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:17:57,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715578784] [2021-12-06 20:17:57,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:17:57,868 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:17:57,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:57,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:17:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:57,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-06 20:17:57,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:57,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 20:17:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:57,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-06 20:17:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:57,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:17:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:57,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:17:57,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:57,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-06 20:17:57,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:57,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-06 20:17:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:57,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-06 20:17:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:57,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-06 20:17:57,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:57,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:17:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:57,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-12-06 20:17:57,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:57,997 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-06 20:17:57,997 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:17:57,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715578784] [2021-12-06 20:17:57,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715578784] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:17:57,997 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:17:57,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 20:17:57,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45767054] [2021-12-06 20:17:57,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:17:57,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 20:17:57,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:17:57,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 20:17:57,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-06 20:17:57,999 INFO L87 Difference]: Start difference. First operand 6299 states and 8665 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 7 states have call predecessors, (17), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-06 20:17:58,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:17:58,934 INFO L93 Difference]: Finished difference Result 16405 states and 23360 transitions. [2021-12-06 20:17:58,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 20:17:58,934 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 7 states have call predecessors, (17), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 139 [2021-12-06 20:17:58,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:17:58,960 INFO L225 Difference]: With dead ends: 16405 [2021-12-06 20:17:58,960 INFO L226 Difference]: Without dead ends: 10126 [2021-12-06 20:17:58,971 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-12-06 20:17:58,972 INFO L933 BasicCegarLoop]: 475 mSDtfsCounter, 735 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 426 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 1139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 426 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-06 20:17:58,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [772 Valid, 1703 Invalid, 1139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [426 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-06 20:17:58,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10126 states. [2021-12-06 20:17:59,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10126 to 6302. [2021-12-06 20:17:59,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6302 states, 5046 states have (on average 1.4036860879904876) internal successors, (7083), 5169 states have internal predecessors, (7083), 795 states have call successors, (795), 465 states have call predecessors, (795), 460 states have return successors, (790), 775 states have call predecessors, (790), 790 states have call successors, (790) [2021-12-06 20:17:59,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6302 states to 6302 states and 8668 transitions. [2021-12-06 20:17:59,220 INFO L78 Accepts]: Start accepts. Automaton has 6302 states and 8668 transitions. Word has length 139 [2021-12-06 20:17:59,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:17:59,220 INFO L470 AbstractCegarLoop]: Abstraction has 6302 states and 8668 transitions. [2021-12-06 20:17:59,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 7 states have call predecessors, (17), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-06 20:17:59,220 INFO L276 IsEmpty]: Start isEmpty. Operand 6302 states and 8668 transitions. [2021-12-06 20:17:59,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-12-06 20:17:59,233 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:17:59,233 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:17:59,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-06 20:17:59,234 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:17:59,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:17:59,234 INFO L85 PathProgramCache]: Analyzing trace with hash -460523326, now seen corresponding path program 1 times [2021-12-06 20:17:59,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:17:59,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364608073] [2021-12-06 20:17:59,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:17:59,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:17:59,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:59,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:17:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:59,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-06 20:17:59,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:59,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 20:17:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:59,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 20:17:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:59,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-06 20:17:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:59,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:17:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:59,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-06 20:17:59,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:59,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-06 20:17:59,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:59,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 20:17:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:59,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-06 20:17:59,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:59,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:17:59,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:59,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-06 20:17:59,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:17:59,389 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-06 20:17:59,389 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:17:59,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364608073] [2021-12-06 20:17:59,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364608073] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:17:59,390 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:17:59,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 20:17:59,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273920401] [2021-12-06 20:17:59,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:17:59,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 20:17:59,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:17:59,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 20:17:59,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-12-06 20:17:59,391 INFO L87 Difference]: Start difference. First operand 6302 states and 8668 transitions. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (17), 7 states have call predecessors, (17), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-06 20:17:59,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:17:59,903 INFO L93 Difference]: Finished difference Result 6983 states and 9558 transitions. [2021-12-06 20:17:59,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 20:17:59,904 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (17), 7 states have call predecessors, (17), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 141 [2021-12-06 20:17:59,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:17:59,904 INFO L225 Difference]: With dead ends: 6983 [2021-12-06 20:17:59,904 INFO L226 Difference]: Without dead ends: 0 [2021-12-06 20:17:59,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-12-06 20:17:59,909 INFO L933 BasicCegarLoop]: 218 mSDtfsCounter, 706 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 20:17:59,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [723 Valid, 697 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 20:17:59,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-06 20:17:59,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-06 20:17:59,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:17:59,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-06 20:17:59,911 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 141 [2021-12-06 20:17:59,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:17:59,911 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-06 20:17:59,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (17), 7 states have call predecessors, (17), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-06 20:17:59,911 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-06 20:17:59,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-06 20:17:59,913 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-06 20:17:59,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-06 20:17:59,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-06 20:22:36,081 INFO L858 garLoopResultBuilder]: For program point _torture_stop_kthreadEXIT(lines 2972 2974) no Hoare annotation was computed. [2021-12-06 20:22:36,081 INFO L858 garLoopResultBuilder]: For program point _torture_stop_kthreadFINAL(lines 2972 2974) no Hoare annotation was computed. [2021-12-06 20:22:36,082 INFO L861 garLoopResultBuilder]: At program point _torture_stop_kthreadENTRY(lines 2972 2974) the Hoare annotation is: true [2021-12-06 20:22:36,082 INFO L858 garLoopResultBuilder]: For program point kfreeEXIT(lines 3078 3080) no Hoare annotation was computed. [2021-12-06 20:22:36,082 INFO L854 garLoopResultBuilder]: At program point kfreeENTRY(lines 3078 3080) the Hoare annotation is: (= |old(#valid)| |#valid|) [2021-12-06 20:22:36,082 INFO L858 garLoopResultBuilder]: For program point kfreeFINAL(lines 3078 3080) no Hoare annotation was computed. [2021-12-06 20:22:36,082 INFO L858 garLoopResultBuilder]: For program point torture_lock_busted_write_delayEXIT(lines 2087 2112) no Hoare annotation was computed. [2021-12-06 20:22:36,082 INFO L861 garLoopResultBuilder]: At program point torture_lock_busted_write_delayENTRY(lines 2087 2112) the Hoare annotation is: true [2021-12-06 20:22:36,082 INFO L858 garLoopResultBuilder]: For program point L2104(lines 2104 2107) no Hoare annotation was computed. [2021-12-06 20:22:36,082 INFO L861 garLoopResultBuilder]: At program point L2105(lines 2096 2108) the Hoare annotation is: true [2021-12-06 20:22:36,082 INFO L861 garLoopResultBuilder]: At program point L2100(lines 2096 2108) the Hoare annotation is: true [2021-12-06 20:22:36,082 INFO L858 garLoopResultBuilder]: For program point L2096(lines 2096 2109) no Hoare annotation was computed. [2021-12-06 20:22:36,082 INFO L858 garLoopResultBuilder]: For program point L2095-1(line 2095) no Hoare annotation was computed. [2021-12-06 20:22:36,083 INFO L858 garLoopResultBuilder]: For program point L2096-2(lines 2087 2112) no Hoare annotation was computed. [2021-12-06 20:22:36,083 INFO L861 garLoopResultBuilder]: At program point L2095(line 2095) the Hoare annotation is: true [2021-12-06 20:22:36,083 INFO L858 garLoopResultBuilder]: For program point L2865-1(line 2865) no Hoare annotation was computed. [2021-12-06 20:22:36,083 INFO L858 garLoopResultBuilder]: For program point torture_lock_spin_write_unlock_irqEXIT(lines 2182 2188) no Hoare annotation was computed. [2021-12-06 20:22:36,083 INFO L854 garLoopResultBuilder]: At program point L2865(line 2865) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~onoff_interval~0 0)) (= ~ldv_spin~0 |old(~ldv_spin~0)|) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2021-12-06 20:22:36,083 INFO L854 garLoopResultBuilder]: At program point L1929(lines 1925 1931) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~onoff_interval~0 0)) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (= ~ldv_spin~0 0) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2021-12-06 20:22:36,083 INFO L854 garLoopResultBuilder]: At program point L2966(lines 2965 2967) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~onoff_interval~0 0)) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (= ~ldv_spin~0 0) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2021-12-06 20:22:36,083 INFO L858 garLoopResultBuilder]: For program point torture_lock_spin_write_unlock_irqFINAL(lines 2182 2188) no Hoare annotation was computed. [2021-12-06 20:22:36,083 INFO L854 garLoopResultBuilder]: At program point torture_lock_spin_write_unlock_irqENTRY(lines 2182 2188) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~onoff_interval~0 0)) (= ~ldv_spin~0 |old(~ldv_spin~0)|) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2021-12-06 20:22:36,083 INFO L854 garLoopResultBuilder]: At program point L2867(lines 2862 2869) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~onoff_interval~0 0)) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (= ~ldv_spin~0 0) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2021-12-06 20:22:36,083 INFO L858 garLoopResultBuilder]: For program point __const_udelayFINAL(lines 2953 2955) no Hoare annotation was computed. [2021-12-06 20:22:36,084 INFO L858 garLoopResultBuilder]: For program point __const_udelayEXIT(lines 2953 2955) no Hoare annotation was computed. [2021-12-06 20:22:36,084 INFO L861 garLoopResultBuilder]: At program point __const_udelayENTRY(lines 2953 2955) the Hoare annotation is: true [2021-12-06 20:22:36,084 INFO L858 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 2009 2015) no Hoare annotation was computed. [2021-12-06 20:22:36,084 INFO L861 garLoopResultBuilder]: At program point ldv_errorENTRY(lines 2009 2015) the Hoare annotation is: true [2021-12-06 20:22:36,084 INFO L858 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2013) no Hoare annotation was computed. [2021-12-06 20:22:36,084 INFO L858 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 2009 2015) no Hoare annotation was computed. [2021-12-06 20:22:36,084 INFO L858 garLoopResultBuilder]: For program point torture_lock_busted_write_lockFINAL(lines 2081 2086) no Hoare annotation was computed. [2021-12-06 20:22:36,084 INFO L861 garLoopResultBuilder]: At program point torture_lock_busted_write_lockENTRY(lines 2081 2086) the Hoare annotation is: true [2021-12-06 20:22:36,084 INFO L858 garLoopResultBuilder]: For program point torture_lock_busted_write_lockEXIT(lines 2081 2086) no Hoare annotation was computed. [2021-12-06 20:22:36,084 INFO L854 garLoopResultBuilder]: At program point kmallocENTRY(lines 2871 2878) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (not (<= (+ ~nwriters_stress~0 1) 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2021-12-06 20:22:36,084 INFO L854 garLoopResultBuilder]: At program point L1937(line 1937) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (not (<= (+ ~nwriters_stress~0 1) 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2021-12-06 20:22:36,084 INFO L858 garLoopResultBuilder]: For program point L1937-1(line 1937) no Hoare annotation was computed. [2021-12-06 20:22:36,085 INFO L861 garLoopResultBuilder]: At program point L1937-2(lines 1935 1938) the Hoare annotation is: true [2021-12-06 20:22:36,085 INFO L854 garLoopResultBuilder]: At program point L2874(line 2874) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (not (<= (+ ~nwriters_stress~0 1) 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2021-12-06 20:22:36,085 INFO L861 garLoopResultBuilder]: At program point L1945(lines 1940 1947) the Hoare annotation is: true [2021-12-06 20:22:36,085 INFO L858 garLoopResultBuilder]: For program point kmallocFINAL(lines 2871 2878) no Hoare annotation was computed. [2021-12-06 20:22:36,085 INFO L858 garLoopResultBuilder]: For program point L2874-1(line 2874) no Hoare annotation was computed. [2021-12-06 20:22:36,085 INFO L858 garLoopResultBuilder]: For program point kmallocEXIT(lines 2871 2878) no Hoare annotation was computed. [2021-12-06 20:22:36,085 INFO L858 garLoopResultBuilder]: For program point torture_randomEXIT(lines 3056 3058) no Hoare annotation was computed. [2021-12-06 20:22:36,085 INFO L861 garLoopResultBuilder]: At program point torture_randomENTRY(lines 3056 3058) the Hoare annotation is: true [2021-12-06 20:22:36,085 INFO L858 garLoopResultBuilder]: For program point torture_randomFINAL(lines 3056 3058) no Hoare annotation was computed. [2021-12-06 20:22:36,085 INFO L858 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 2016 2022) no Hoare annotation was computed. [2021-12-06 20:22:36,085 INFO L861 garLoopResultBuilder]: At program point ldv_stopENTRY(lines 2016 2022) the Hoare annotation is: true [2021-12-06 20:22:36,085 INFO L861 garLoopResultBuilder]: At program point L2298(lines 2274 2312) the Hoare annotation is: true [2021-12-06 20:22:36,085 INFO L858 garLoopResultBuilder]: For program point L2323(lines 2323 2327) no Hoare annotation was computed. [2021-12-06 20:22:36,086 INFO L858 garLoopResultBuilder]: For program point L2282(lines 2282 2285) no Hoare annotation was computed. [2021-12-06 20:22:36,086 INFO L858 garLoopResultBuilder]: For program point L2282-2(lines 2282 2285) no Hoare annotation was computed. [2021-12-06 20:22:36,086 INFO L858 garLoopResultBuilder]: For program point L2307(lines 2307 2310) no Hoare annotation was computed. [2021-12-06 20:22:36,086 INFO L861 garLoopResultBuilder]: At program point L2307-2(lines 2265 2313) the Hoare annotation is: true [2021-12-06 20:22:36,086 INFO L858 garLoopResultBuilder]: For program point L2291(lines 2291 2294) no Hoare annotation was computed. [2021-12-06 20:22:36,086 INFO L858 garLoopResultBuilder]: For program point L2291-2(lines 2291 2294) no Hoare annotation was computed. [2021-12-06 20:22:36,086 INFO L861 garLoopResultBuilder]: At program point L1903(lines 1899 1905) the Hoare annotation is: true [2021-12-06 20:22:36,086 INFO L858 garLoopResultBuilder]: For program point L2287(lines 2287 2290) no Hoare annotation was computed. [2021-12-06 20:22:36,086 INFO L858 garLoopResultBuilder]: For program point L2287-2(lines 2287 2290) no Hoare annotation was computed. [2021-12-06 20:22:36,086 INFO L858 garLoopResultBuilder]: For program point L2304(line 2304) no Hoare annotation was computed. [2021-12-06 20:22:36,086 INFO L858 garLoopResultBuilder]: For program point L2304-2(lines 2303 2305) no Hoare annotation was computed. [2021-12-06 20:22:36,086 INFO L854 garLoopResultBuilder]: At program point lock_torture_stats_printENTRY(lines 2314 2333) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (not (<= (+ ~nwriters_stress~0 1) 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2021-12-06 20:22:36,086 INFO L858 garLoopResultBuilder]: For program point lock_torture_stats_printFINAL(lines 2314 2333) no Hoare annotation was computed. [2021-12-06 20:22:36,086 INFO L861 garLoopResultBuilder]: At program point L2296(lines 2274 2312) the Hoare annotation is: true [2021-12-06 20:22:36,087 INFO L858 garLoopResultBuilder]: For program point L2321-1(line 2321) no Hoare annotation was computed. [2021-12-06 20:22:36,087 INFO L854 garLoopResultBuilder]: At program point L2321(line 2321) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (not (<= (+ ~nwriters_stress~0 1) 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2021-12-06 20:22:36,087 INFO L858 garLoopResultBuilder]: For program point L2305-1(line 2305) no Hoare annotation was computed. [2021-12-06 20:22:36,087 INFO L858 garLoopResultBuilder]: For program point lock_torture_stats_printEXIT(lines 2314 2333) no Hoare annotation was computed. [2021-12-06 20:22:36,087 INFO L861 garLoopResultBuilder]: At program point L2330(line 2330) the Hoare annotation is: true [2021-12-06 20:22:36,087 INFO L861 garLoopResultBuilder]: At program point torture_lock_busted_write_unlockFINAL(lines 2113 2118) the Hoare annotation is: true [2021-12-06 20:22:36,087 INFO L858 garLoopResultBuilder]: For program point torture_lock_busted_write_unlockEXIT(lines 2113 2118) no Hoare annotation was computed. [2021-12-06 20:22:36,087 INFO L858 garLoopResultBuilder]: For program point lock_torture_print_module_parmsEXIT(lines 2361 2370) no Hoare annotation was computed. [2021-12-06 20:22:36,087 INFO L861 garLoopResultBuilder]: At program point lock_torture_print_module_parmsENTRY(lines 2361 2370) the Hoare annotation is: true [2021-12-06 20:22:36,087 INFO L858 garLoopResultBuilder]: For program point lock_torture_print_module_parmsFINAL(lines 2361 2370) no Hoare annotation was computed. [2021-12-06 20:22:36,087 INFO L858 garLoopResultBuilder]: For program point L2141-1(line 2141) no Hoare annotation was computed. [2021-12-06 20:22:36,087 INFO L861 garLoopResultBuilder]: At program point L2141(line 2141) the Hoare annotation is: true [2021-12-06 20:22:36,087 INFO L858 garLoopResultBuilder]: For program point torture_spin_lock_write_delayEXIT(lines 2130 2163) no Hoare annotation was computed. [2021-12-06 20:22:36,088 INFO L858 garLoopResultBuilder]: For program point L2156(line 2156) no Hoare annotation was computed. [2021-12-06 20:22:36,088 INFO L861 garLoopResultBuilder]: At program point L2957(lines 2956 2958) the Hoare annotation is: true [2021-12-06 20:22:36,088 INFO L858 garLoopResultBuilder]: For program point L2150(lines 2150 2153) no Hoare annotation was computed. [2021-12-06 20:22:36,088 INFO L861 garLoopResultBuilder]: At program point torture_spin_lock_write_delayENTRY(lines 2130 2163) the Hoare annotation is: true [2021-12-06 20:22:36,088 INFO L861 garLoopResultBuilder]: At program point L2146(lines 2142 2154) the Hoare annotation is: true [2021-12-06 20:22:36,088 INFO L858 garLoopResultBuilder]: For program point L2142(lines 2142 2155) no Hoare annotation was computed. [2021-12-06 20:22:36,088 INFO L861 garLoopResultBuilder]: At program point L2142-2(lines 2142 2155) the Hoare annotation is: true [2021-12-06 20:22:36,088 INFO L858 garLoopResultBuilder]: For program point L2157(lines 2157 2160) no Hoare annotation was computed. [2021-12-06 20:22:36,088 INFO L858 garLoopResultBuilder]: For program point L2157-2(lines 2130 2163) no Hoare annotation was computed. [2021-12-06 20:22:36,088 INFO L861 garLoopResultBuilder]: At program point L2151(lines 2142 2154) the Hoare annotation is: true [2021-12-06 20:22:36,088 INFO L858 garLoopResultBuilder]: For program point L2401(lines 2401 2410) no Hoare annotation was computed. [2021-12-06 20:22:36,088 INFO L858 garLoopResultBuilder]: For program point L2399(line 2399) no Hoare annotation was computed. [2021-12-06 20:22:36,088 INFO L854 garLoopResultBuilder]: At program point L3031(lines 3030 3032) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_spin~0 0))) (.cse1 (not (<= (+ ~nwriters_stress~0 1) 0)))) (and (or .cse0 .cse1 (not (= ~ldv_state_variable_0~0 1)) (and (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset))) (or .cse0 .cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))))) [2021-12-06 20:22:36,089 INFO L854 garLoopResultBuilder]: At program point L2391(lines 2383 2396) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_spin~0 0))) (.cse1 (not (<= (+ ~nwriters_stress~0 1) 0)))) (and (or .cse0 .cse1 (not (= ~ldv_state_variable_0~0 1)) (and (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset))) (or .cse0 .cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))))) [2021-12-06 20:22:36,089 INFO L854 garLoopResultBuilder]: At program point L2389(lines 2383 2396) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_spin~0 0))) (.cse1 (not (<= (+ ~nwriters_stress~0 1) 0)))) (and (or .cse0 .cse1 (not (= ~ldv_state_variable_0~0 1)) (and (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset))) (or .cse0 .cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))))) [2021-12-06 20:22:36,089 INFO L858 garLoopResultBuilder]: For program point L2387(line 2387) no Hoare annotation was computed. [2021-12-06 20:22:36,089 INFO L858 garLoopResultBuilder]: For program point L2383(lines 2383 2397) no Hoare annotation was computed. [2021-12-06 20:22:36,089 INFO L861 garLoopResultBuilder]: At program point L2383-2(lines 2383 2397) the Hoare annotation is: true [2021-12-06 20:22:36,089 INFO L858 garLoopResultBuilder]: For program point L2379(lines 2379 2382) no Hoare annotation was computed. [2021-12-06 20:22:36,089 INFO L861 garLoopResultBuilder]: At program point L2408(line 2408) the Hoare annotation is: true [2021-12-06 20:22:36,089 INFO L861 garLoopResultBuilder]: At program point L1896(lines 1893 1898) the Hoare annotation is: true [2021-12-06 20:22:36,089 INFO L861 garLoopResultBuilder]: At program point L2406(line 2406) the Hoare annotation is: true [2021-12-06 20:22:36,089 INFO L858 garLoopResultBuilder]: For program point lock_torture_cleanupEXIT(lines 2371 2413) no Hoare annotation was computed. [2021-12-06 20:22:36,089 INFO L858 garLoopResultBuilder]: For program point L2408-1(lines 2371 2413) no Hoare annotation was computed. [2021-12-06 20:22:36,089 INFO L854 garLoopResultBuilder]: At program point lock_torture_cleanupENTRY(lines 2371 2413) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_spin~0 0))) (.cse1 (not (<= (+ ~nwriters_stress~0 1) 0)))) (and (or .cse0 .cse1 (not (= ~ldv_state_variable_0~0 1)) (and (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset))) (or .cse0 .cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))))) [2021-12-06 20:22:36,089 INFO L861 garLoopResultBuilder]: At program point L2402(line 2402) the Hoare annotation is: true [2021-12-06 20:22:36,090 INFO L861 garLoopResultBuilder]: At program point L2398(line 2398) the Hoare annotation is: true [2021-12-06 20:22:36,090 INFO L854 garLoopResultBuilder]: At program point L2394(line 2394) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_spin~0 0))) (.cse1 (not (<= (+ ~nwriters_stress~0 1) 0)))) (and (or .cse0 .cse1 (not (= ~ldv_state_variable_0~0 1)) (and (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset))) (or .cse0 .cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))))) [2021-12-06 20:22:36,090 INFO L858 garLoopResultBuilder]: For program point L2394-1(line 2394) no Hoare annotation was computed. [2021-12-06 20:22:36,090 INFO L861 garLoopResultBuilder]: At program point L3049(lines 3048 3050) the Hoare annotation is: true [2021-12-06 20:22:36,090 INFO L858 garLoopResultBuilder]: For program point L2405(lines 2405 2409) no Hoare annotation was computed. [2021-12-06 20:22:36,090 INFO L861 garLoopResultBuilder]: At program point torture_init_endFINAL(lines 3037 3039) the Hoare annotation is: true [2021-12-06 20:22:36,090 INFO L858 garLoopResultBuilder]: For program point torture_init_endEXIT(lines 3037 3039) no Hoare annotation was computed. [2021-12-06 20:22:36,090 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 1956 1958) the Hoare annotation is: true [2021-12-06 20:22:36,090 INFO L858 garLoopResultBuilder]: For program point L1957(line 1957) no Hoare annotation was computed. [2021-12-06 20:22:36,090 INFO L858 garLoopResultBuilder]: For program point L1957-2(lines 1956 1958) no Hoare annotation was computed. [2021-12-06 20:22:36,090 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 1956 1958) no Hoare annotation was computed. [2021-12-06 20:22:36,090 INFO L854 garLoopResultBuilder]: At program point ldv_spin_unlockENTRY(lines 2929 2935) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~onoff_interval~0 0)) (= ~ldv_spin~0 |old(~ldv_spin~0)|) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2021-12-06 20:22:36,090 INFO L858 garLoopResultBuilder]: For program point ldv_spin_unlockFINAL(lines 2929 2935) no Hoare annotation was computed. [2021-12-06 20:22:36,091 INFO L858 garLoopResultBuilder]: For program point ldv_spin_unlockEXIT(lines 2929 2935) no Hoare annotation was computed. [2021-12-06 20:22:36,091 INFO L858 garLoopResultBuilder]: For program point ldv_spin_lockEXIT(lines 2922 2928) no Hoare annotation was computed. [2021-12-06 20:22:36,091 INFO L861 garLoopResultBuilder]: At program point ldv_spin_lockENTRY(lines 2922 2928) the Hoare annotation is: true [2021-12-06 20:22:36,091 INFO L858 garLoopResultBuilder]: For program point ldv_spin_lockFINAL(lines 2922 2928) no Hoare annotation was computed. [2021-12-06 20:22:36,091 INFO L858 garLoopResultBuilder]: For program point L2177-1(line 2177) no Hoare annotation was computed. [2021-12-06 20:22:36,091 INFO L861 garLoopResultBuilder]: At program point L2177(line 2177) the Hoare annotation is: true [2021-12-06 20:22:36,091 INFO L858 garLoopResultBuilder]: For program point torture_spin_lock_write_lock_irqEXIT(lines 2173 2181) no Hoare annotation was computed. [2021-12-06 20:22:36,091 INFO L861 garLoopResultBuilder]: At program point torture_spin_lock_write_lock_irqENTRY(lines 2173 2181) the Hoare annotation is: true [2021-12-06 20:22:36,091 INFO L858 garLoopResultBuilder]: For program point torture_spin_lock_write_lock_irqFINAL(lines 2173 2181) no Hoare annotation was computed. [2021-12-06 20:22:36,091 INFO L854 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 1959 1975) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2021-12-06 20:22:36,091 INFO L858 garLoopResultBuilder]: For program point L1966(lines 1966 1973) no Hoare annotation was computed. [2021-12-06 20:22:36,091 INFO L858 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 1959 1975) no Hoare annotation was computed. [2021-12-06 20:22:36,091 INFO L861 garLoopResultBuilder]: At program point L1971(line 1971) the Hoare annotation is: true [2021-12-06 20:22:36,091 INFO L858 garLoopResultBuilder]: For program point L1971-1(line 1971) no Hoare annotation was computed. [2021-12-06 20:22:36,092 INFO L858 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 1959 1975) no Hoare annotation was computed. [2021-12-06 20:22:36,092 INFO L858 garLoopResultBuilder]: For program point _torture_create_kthreadFINAL(lines 2969 2971) no Hoare annotation was computed. [2021-12-06 20:22:36,092 INFO L861 garLoopResultBuilder]: At program point _torture_create_kthreadENTRY(lines 2969 2971) the Hoare annotation is: true [2021-12-06 20:22:36,092 INFO L858 garLoopResultBuilder]: For program point _torture_create_kthreadEXIT(lines 2969 2971) no Hoare annotation was computed. [2021-12-06 20:22:36,092 INFO L858 garLoopResultBuilder]: For program point L2849-1(line 2849) no Hoare annotation was computed. [2021-12-06 20:22:36,092 INFO L861 garLoopResultBuilder]: At program point L2960(lines 2959 2961) the Hoare annotation is: true [2021-12-06 20:22:36,092 INFO L858 garLoopResultBuilder]: For program point torture_spin_lock_write_lockFINAL(lines 2123 2129) no Hoare annotation was computed. [2021-12-06 20:22:36,092 INFO L861 garLoopResultBuilder]: At program point L2849(line 2849) the Hoare annotation is: true [2021-12-06 20:22:36,092 INFO L861 garLoopResultBuilder]: At program point torture_spin_lock_write_lockENTRY(lines 2123 2129) the Hoare annotation is: true [2021-12-06 20:22:36,092 INFO L861 garLoopResultBuilder]: At program point L1913(lines 1909 1915) the Hoare annotation is: true [2021-12-06 20:22:36,092 INFO L858 garLoopResultBuilder]: For program point torture_spin_lock_write_lockEXIT(lines 2123 2129) no Hoare annotation was computed. [2021-12-06 20:22:36,092 INFO L861 garLoopResultBuilder]: At program point L2851(lines 2846 2853) the Hoare annotation is: true [2021-12-06 20:22:36,092 INFO L854 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= |old(~ldv_spin~0)| 0)) (and (= |old(#length)| |#length|) (= ~ldv_spin~0 0) (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(#valid)| |#valid|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset)) (not (= ~onoff_interval~0 0)) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2021-12-06 20:22:36,092 INFO L858 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2021-12-06 20:22:36,093 INFO L858 garLoopResultBuilder]: For program point ##fun~~TO~VOIDEXIT(line -1) no Hoare annotation was computed. [2021-12-06 20:22:36,093 INFO L854 garLoopResultBuilder]: At program point L-1-3(line -1) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= |old(~ldv_spin~0)| 0)) (not (= ~onoff_interval~0 0)) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (and (= |old(#length)| |#length|) (= ~ldv_spin~0 |old(~ldv_spin~0)|) (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(#valid)| |#valid|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset)) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2021-12-06 20:22:36,093 INFO L858 garLoopResultBuilder]: For program point L-1-5(line -1) no Hoare annotation was computed. [2021-12-06 20:22:36,093 INFO L854 garLoopResultBuilder]: At program point ##fun~~TO~VOIDENTRY(line -1) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= |old(~ldv_spin~0)| 0)) (and (= |old(#length)| |#length|) (= ~ldv_spin~0 0) (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(#valid)| |#valid|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset)) (not (= ~onoff_interval~0 0)) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2021-12-06 20:22:36,093 INFO L854 garLoopResultBuilder]: At program point L-1-6(line -1) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= |old(~ldv_spin~0)| 0)) (not (= ~onoff_interval~0 0)) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (and (= |old(#length)| |#length|) (= ~ldv_spin~0 |old(~ldv_spin~0)|) (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(#valid)| |#valid|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset)) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2021-12-06 20:22:36,093 INFO L854 garLoopResultBuilder]: At program point L-1-8(line -1) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= |old(~ldv_spin~0)| 0)) (and (= |old(#length)| |#length|) (= ~ldv_spin~0 0) (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(#valid)| |#valid|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset)) (not (= ~onoff_interval~0 0)) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2021-12-06 20:22:36,093 INFO L858 garLoopResultBuilder]: For program point L-1-9(line -1) no Hoare annotation was computed. [2021-12-06 20:22:36,093 INFO L858 garLoopResultBuilder]: For program point L1983(lines 1983 1990) no Hoare annotation was computed. [2021-12-06 20:22:36,093 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-06 20:22:36,093 INFO L858 garLoopResultBuilder]: For program point ldv_zallocEXIT(lines 1976 1992) no Hoare annotation was computed. [2021-12-06 20:22:36,093 INFO L854 garLoopResultBuilder]: At program point ldv_zallocENTRY(lines 1976 1992) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~onoff_interval~0 0)) (not (= 0 ~lwsa~0.base)) (not (= ~ldv_spin~0 0)) (not (<= (+ ~nwriters_stress~0 1) 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) (not (<= 0 ~ref_cnt~0)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2021-12-06 20:22:36,093 INFO L861 garLoopResultBuilder]: At program point L1988(line 1988) the Hoare annotation is: true [2021-12-06 20:22:36,093 INFO L858 garLoopResultBuilder]: For program point ldv_zallocFINAL(lines 1976 1992) no Hoare annotation was computed. [2021-12-06 20:22:36,094 INFO L858 garLoopResultBuilder]: For program point L1988-1(line 1988) no Hoare annotation was computed. [2021-12-06 20:22:36,094 INFO L854 garLoopResultBuilder]: At program point L1921(lines 1917 1923) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~onoff_interval~0 0)) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (= ~ldv_spin~0 0) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2021-12-06 20:22:36,094 INFO L858 garLoopResultBuilder]: For program point torture_spin_lock_write_unlockEXIT(lines 2164 2170) no Hoare annotation was computed. [2021-12-06 20:22:36,094 INFO L854 garLoopResultBuilder]: At program point torture_spin_lock_write_unlockENTRY(lines 2164 2170) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~onoff_interval~0 0)) (= ~ldv_spin~0 |old(~ldv_spin~0)|) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2021-12-06 20:22:36,094 INFO L858 garLoopResultBuilder]: For program point torture_spin_lock_write_unlockFINAL(lines 2164 2170) no Hoare annotation was computed. [2021-12-06 20:22:36,094 INFO L854 garLoopResultBuilder]: At program point L2859(lines 2854 2861) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~onoff_interval~0 0)) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (= ~ldv_spin~0 0) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2021-12-06 20:22:36,094 INFO L858 garLoopResultBuilder]: For program point L2857-1(line 2857) no Hoare annotation was computed. [2021-12-06 20:22:36,094 INFO L854 garLoopResultBuilder]: At program point L2857(line 2857) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~onoff_interval~0 0)) (= ~ldv_spin~0 |old(~ldv_spin~0)|) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2021-12-06 20:22:36,094 INFO L854 garLoopResultBuilder]: At program point L2963(lines 2962 2964) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~onoff_interval~0 0)) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (= ~ldv_spin~0 0) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2021-12-06 20:22:36,094 INFO L861 garLoopResultBuilder]: At program point L2843(lines 2596 2845) the Hoare annotation is: true [2021-12-06 20:22:36,094 INFO L858 garLoopResultBuilder]: For program point L2744(lines 2744 2748) no Hoare annotation was computed. [2021-12-06 20:22:36,094 INFO L858 garLoopResultBuilder]: For program point L2744-2(lines 2723 2773) no Hoare annotation was computed. [2021-12-06 20:22:36,095 INFO L854 garLoopResultBuilder]: At program point L2612(line 2612) the Hoare annotation is: (and (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-12-06 20:22:36,095 INFO L858 garLoopResultBuilder]: For program point L2612-1(line 2612) no Hoare annotation was computed. [2021-12-06 20:22:36,095 INFO L858 garLoopResultBuilder]: For program point L2579(line 2579) no Hoare annotation was computed. [2021-12-06 20:22:36,095 INFO L858 garLoopResultBuilder]: For program point L2778(line 2778) no Hoare annotation was computed. [2021-12-06 20:22:36,095 INFO L858 garLoopResultBuilder]: For program point L2745-1(line 2745) no Hoare annotation was computed. [2021-12-06 20:22:36,095 INFO L854 garLoopResultBuilder]: At program point L2745(line 2745) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2021-12-06 20:22:36,095 INFO L858 garLoopResultBuilder]: For program point L2779(lines 2779 2834) no Hoare annotation was computed. [2021-12-06 20:22:36,095 INFO L858 garLoopResultBuilder]: For program point L2713(line 2713) no Hoare annotation was computed. [2021-12-06 20:22:36,095 INFO L854 garLoopResultBuilder]: At program point L2614(line 2614) the Hoare annotation is: (and (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-12-06 20:22:36,095 INFO L858 garLoopResultBuilder]: For program point L2614-1(line 2614) no Hoare annotation was computed. [2021-12-06 20:22:36,095 INFO L858 garLoopResultBuilder]: For program point L2813(line 2813) no Hoare annotation was computed. [2021-12-06 20:22:36,095 INFO L861 garLoopResultBuilder]: At program point L2714(line 2714) the Hoare annotation is: true [2021-12-06 20:22:36,095 INFO L858 garLoopResultBuilder]: For program point L2648(line 2648) no Hoare annotation was computed. [2021-12-06 20:22:36,096 INFO L854 garLoopResultBuilder]: At program point L2582(line 2582) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (<= (+ |ULTIMATE.start_lock_torture_init_~firsterr~0#1| 12) 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-12-06 20:22:36,096 INFO L854 garLoopResultBuilder]: At program point L2450(lines 2425 2585) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-12-06 20:22:36,096 INFO L858 garLoopResultBuilder]: For program point L2516-1(lines 2425 2585) no Hoare annotation was computed. [2021-12-06 20:22:36,096 INFO L861 garLoopResultBuilder]: At program point L2979(lines 2978 2980) the Hoare annotation is: true [2021-12-06 20:22:36,096 INFO L858 garLoopResultBuilder]: For program point L2814(lines 2814 2819) no Hoare annotation was computed. [2021-12-06 20:22:36,096 INFO L858 garLoopResultBuilder]: For program point L2781(lines 2781 2831) no Hoare annotation was computed. [2021-12-06 20:22:36,096 INFO L858 garLoopResultBuilder]: For program point L2649(lines 2649 2653) no Hoare annotation was computed. [2021-12-06 20:22:36,096 INFO L858 garLoopResultBuilder]: For program point L2649-2(lines 2628 2678) no Hoare annotation was computed. [2021-12-06 20:22:36,096 INFO L858 garLoopResultBuilder]: For program point L2583(line 2583) no Hoare annotation was computed. [2021-12-06 20:22:36,096 INFO L858 garLoopResultBuilder]: For program point L2484(line 2484) no Hoare annotation was computed. [2021-12-06 20:22:36,096 INFO L854 garLoopResultBuilder]: At program point L1890(lines 1885 1892) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-12-06 20:22:36,096 INFO L858 garLoopResultBuilder]: For program point L2782(line 2782) no Hoare annotation was computed. [2021-12-06 20:22:36,096 INFO L854 garLoopResultBuilder]: At program point L2650(line 2650) the Hoare annotation is: false [2021-12-06 20:22:36,096 INFO L858 garLoopResultBuilder]: For program point L2683(line 2683) no Hoare annotation was computed. [2021-12-06 20:22:36,097 INFO L854 garLoopResultBuilder]: At program point L2584(lines 2414 2586) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 1)) (.cse1 (<= (+ ~nwriters_stress~0 1) 0))) (or (and .cse0 (<= (+ |ULTIMATE.start_lock_torture_init_#res#1| 16) 0) .cse1) (and .cse0 (<= (+ |ULTIMATE.start_lock_torture_init_~firsterr~0#1| 12) 0) (<= (+ |ULTIMATE.start_lock_torture_init_#res#1| 12) 0) .cse1))) [2021-12-06 20:22:36,097 INFO L858 garLoopResultBuilder]: For program point L2650-1(line 2650) no Hoare annotation was computed. [2021-12-06 20:22:36,097 INFO L858 garLoopResultBuilder]: For program point L2518(lines 2518 2521) no Hoare annotation was computed. [2021-12-06 20:22:36,097 INFO L854 garLoopResultBuilder]: At program point L2452(lines 2425 2585) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-12-06 20:22:36,097 INFO L854 garLoopResultBuilder]: At program point L2750(line 2750) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2021-12-06 20:22:36,097 INFO L858 garLoopResultBuilder]: For program point L2783(lines 2783 2787) no Hoare annotation was computed. [2021-12-06 20:22:36,097 INFO L858 garLoopResultBuilder]: For program point L2684(lines 2684 2718) no Hoare annotation was computed. [2021-12-06 20:22:36,097 INFO L858 garLoopResultBuilder]: For program point L2750-1(line 2750) no Hoare annotation was computed. [2021-12-06 20:22:36,097 INFO L854 garLoopResultBuilder]: At program point L2486(line 2486) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-12-06 20:22:36,097 INFO L858 garLoopResultBuilder]: For program point L2486-1(line 2486) no Hoare annotation was computed. [2021-12-06 20:22:36,097 INFO L854 garLoopResultBuilder]: At program point L2982(lines 2981 2983) the Hoare annotation is: (and (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-12-06 20:22:36,097 INFO L858 garLoopResultBuilder]: For program point L2883-1(line 2883) no Hoare annotation was computed. [2021-12-06 20:22:36,097 INFO L854 garLoopResultBuilder]: At program point L2883(line 2883) the Hoare annotation is: false [2021-12-06 20:22:36,098 INFO L854 garLoopResultBuilder]: At program point L2784(line 2784) the Hoare annotation is: false [2021-12-06 20:22:36,098 INFO L858 garLoopResultBuilder]: For program point L2784-1(line 2784) no Hoare annotation was computed. [2021-12-06 20:22:36,098 INFO L854 garLoopResultBuilder]: At program point L2884(lines 2880 2886) the Hoare annotation is: false [2021-12-06 20:22:36,098 INFO L858 garLoopResultBuilder]: For program point L2686(lines 2686 2715) no Hoare annotation was computed. [2021-12-06 20:22:36,098 INFO L858 garLoopResultBuilder]: For program point L2554(lines 2554 2557) no Hoare annotation was computed. [2021-12-06 20:22:36,098 INFO L858 garLoopResultBuilder]: For program point L2488(lines 2488 2496) no Hoare annotation was computed. [2021-12-06 20:22:36,098 INFO L854 garLoopResultBuilder]: At program point L2455(lines 2425 2585) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-12-06 20:22:36,098 INFO L854 garLoopResultBuilder]: At program point L2951(lines 2950 2952) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-12-06 20:22:36,098 INFO L858 garLoopResultBuilder]: For program point L2720(line 2720) no Hoare annotation was computed. [2021-12-06 20:22:36,098 INFO L858 garLoopResultBuilder]: For program point L2687(line 2687) no Hoare annotation was computed. [2021-12-06 20:22:36,098 INFO L858 garLoopResultBuilder]: For program point L2489(lines 2489 2492) no Hoare annotation was computed. [2021-12-06 20:22:36,098 INFO L858 garLoopResultBuilder]: For program point L2489-2(lines 2489 2492) no Hoare annotation was computed. [2021-12-06 20:22:36,098 INFO L858 garLoopResultBuilder]: For program point L2688(lines 2688 2693) no Hoare annotation was computed. [2021-12-06 20:22:36,098 INFO L858 garLoopResultBuilder]: For program point L2721(lines 2721 2776) no Hoare annotation was computed. [2021-12-06 20:22:36,098 INFO L858 garLoopResultBuilder]: For program point L2655-1(line 2655) no Hoare annotation was computed. [2021-12-06 20:22:36,099 INFO L854 garLoopResultBuilder]: At program point L2655(line 2655) the Hoare annotation is: false [2021-12-06 20:22:36,099 INFO L854 garLoopResultBuilder]: At program point L2986(lines 2985 2987) the Hoare annotation is: false [2021-12-06 20:22:36,099 INFO L858 garLoopResultBuilder]: For program point L2821(line 2821) no Hoare annotation was computed. [2021-12-06 20:22:36,099 INFO L858 garLoopResultBuilder]: For program point L2755(line 2755) no Hoare annotation was computed. [2021-12-06 20:22:36,099 INFO L858 garLoopResultBuilder]: For program point L2689-1(line 2689) no Hoare annotation was computed. [2021-12-06 20:22:36,099 INFO L854 garLoopResultBuilder]: At program point L2689(line 2689) the Hoare annotation is: (and (= ~ldv_spin~0 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-12-06 20:22:36,099 INFO L858 garLoopResultBuilder]: For program point L2524-1(lines 2425 2585) no Hoare annotation was computed. [2021-12-06 20:22:36,099 INFO L854 garLoopResultBuilder]: At program point L3053(lines 3052 3054) the Hoare annotation is: false [2021-12-06 20:22:36,099 INFO L858 garLoopResultBuilder]: For program point L2822(lines 2822 2827) no Hoare annotation was computed. [2021-12-06 20:22:36,099 INFO L858 garLoopResultBuilder]: For program point L2756(lines 2756 2761) no Hoare annotation was computed. [2021-12-06 20:22:36,099 INFO L858 garLoopResultBuilder]: For program point L2789(line 2789) no Hoare annotation was computed. [2021-12-06 20:22:36,099 INFO L858 garLoopResultBuilder]: For program point L2723(lines 2723 2773) no Hoare annotation was computed. [2021-12-06 20:22:36,099 INFO L858 garLoopResultBuilder]: For program point L2624(lines 2624 2838) no Hoare annotation was computed. [2021-12-06 20:22:36,099 INFO L858 garLoopResultBuilder]: For program point L2558(lines 2558 2561) no Hoare annotation was computed. [2021-12-06 20:22:36,099 INFO L858 garLoopResultBuilder]: For program point L2790(lines 2790 2794) no Hoare annotation was computed. [2021-12-06 20:22:36,100 INFO L858 garLoopResultBuilder]: For program point L2724(line 2724) no Hoare annotation was computed. [2021-12-06 20:22:36,100 INFO L858 garLoopResultBuilder]: For program point L2790-2(lines 2781 2831) no Hoare annotation was computed. [2021-12-06 20:22:36,100 INFO L858 garLoopResultBuilder]: For program point L2625(line 2625) no Hoare annotation was computed. [2021-12-06 20:22:36,100 INFO L858 garLoopResultBuilder]: For program point L2526(lines 2526 2529) no Hoare annotation was computed. [2021-12-06 20:22:36,100 INFO L858 garLoopResultBuilder]: For program point L2791-1(line 2791) no Hoare annotation was computed. [2021-12-06 20:22:36,100 INFO L854 garLoopResultBuilder]: At program point L2791(line 2791) the Hoare annotation is: false [2021-12-06 20:22:36,100 INFO L858 garLoopResultBuilder]: For program point L2725(lines 2725 2729) no Hoare annotation was computed. [2021-12-06 20:22:36,100 INFO L858 garLoopResultBuilder]: For program point L2626(lines 2626 2681) no Hoare annotation was computed. [2021-12-06 20:22:36,100 INFO L854 garLoopResultBuilder]: At program point L2990(lines 2989 2991) the Hoare annotation is: false [2021-12-06 20:22:36,100 INFO L854 garLoopResultBuilder]: At program point L2726(line 2726) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2021-12-06 20:22:36,100 INFO L858 garLoopResultBuilder]: For program point L2660(line 2660) no Hoare annotation was computed. [2021-12-06 20:22:36,100 INFO L858 garLoopResultBuilder]: For program point L2726-1(line 2726) no Hoare annotation was computed. [2021-12-06 20:22:36,100 INFO L858 garLoopResultBuilder]: For program point L2628(lines 2628 2678) no Hoare annotation was computed. [2021-12-06 20:22:36,100 INFO L858 garLoopResultBuilder]: For program point L2661(lines 2661 2666) no Hoare annotation was computed. [2021-12-06 20:22:36,101 INFO L858 garLoopResultBuilder]: For program point L2695(line 2695) no Hoare annotation was computed. [2021-12-06 20:22:36,101 INFO L858 garLoopResultBuilder]: For program point L2629(line 2629) no Hoare annotation was computed. [2021-12-06 20:22:36,101 INFO L854 garLoopResultBuilder]: At program point L2563(lines 2425 2585) the Hoare annotation is: false [2021-12-06 20:22:36,101 INFO L854 garLoopResultBuilder]: At program point L2464(lines 2456 2472) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ ~nwriters_stress~0 1) 0)) [2021-12-06 20:22:36,101 INFO L858 garLoopResultBuilder]: For program point L2431(lines 2431 2435) no Hoare annotation was computed. [2021-12-06 20:22:36,101 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-06 20:22:36,101 INFO L858 garLoopResultBuilder]: For program point L2431-2(lines 2425 2585) no Hoare annotation was computed. [2021-12-06 20:22:36,101 INFO L858 garLoopResultBuilder]: For program point L2696(lines 2696 2711) no Hoare annotation was computed. [2021-12-06 20:22:36,101 INFO L858 garLoopResultBuilder]: For program point L2630(lines 2630 2634) no Hoare annotation was computed. [2021-12-06 20:22:36,101 INFO L854 garLoopResultBuilder]: At program point L2994(lines 2993 2995) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2021-12-06 20:22:36,101 INFO L854 garLoopResultBuilder]: At program point L2796(line 2796) the Hoare annotation is: false [2021-12-06 20:22:36,101 INFO L858 garLoopResultBuilder]: For program point L2829(line 2829) no Hoare annotation was computed. [2021-12-06 20:22:36,101 INFO L858 garLoopResultBuilder]: For program point L2763(line 2763) no Hoare annotation was computed. [2021-12-06 20:22:36,101 INFO L858 garLoopResultBuilder]: For program point L2796-1(line 2796) no Hoare annotation was computed. [2021-12-06 20:22:36,102 INFO L858 garLoopResultBuilder]: For program point L2631-1(line 2631) no Hoare annotation was computed. [2021-12-06 20:22:36,102 INFO L854 garLoopResultBuilder]: At program point L2631(line 2631) the Hoare annotation is: false [2021-12-06 20:22:36,102 INFO L854 garLoopResultBuilder]: At program point L2565(lines 2425 2585) the Hoare annotation is: false [2021-12-06 20:22:36,102 INFO L854 garLoopResultBuilder]: At program point L2466(lines 2456 2472) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ ~nwriters_stress~0 1) 0)) [2021-12-06 20:22:36,102 INFO L858 garLoopResultBuilder]: For program point L2532-1(lines 2532 2539) no Hoare annotation was computed. [2021-12-06 20:22:36,102 INFO L854 garLoopResultBuilder]: At program point L3061(lines 3060 3062) the Hoare annotation is: false [2021-12-06 20:22:36,102 INFO L861 garLoopResultBuilder]: At program point L2830(line 2830) the Hoare annotation is: true [2021-12-06 20:22:36,102 INFO L858 garLoopResultBuilder]: For program point L2764(lines 2764 2769) no Hoare annotation was computed. [2021-12-06 20:22:36,102 INFO L858 garLoopResultBuilder]: For program point L2698(lines 2698 2704) no Hoare annotation was computed. [2021-12-06 20:22:36,102 INFO L858 garLoopResultBuilder]: For program point L2731(line 2731) no Hoare annotation was computed. [2021-12-06 20:22:36,102 INFO L858 garLoopResultBuilder]: For program point L2698-2(lines 2696 2710) no Hoare annotation was computed. [2021-12-06 20:22:36,102 INFO L858 garLoopResultBuilder]: For program point L2732(lines 2732 2736) no Hoare annotation was computed. [2021-12-06 20:22:36,102 INFO L858 garLoopResultBuilder]: For program point L2732-2(lines 2723 2773) no Hoare annotation was computed. [2021-12-06 20:22:36,102 INFO L858 garLoopResultBuilder]: For program point L2534(lines 2534 2537) no Hoare annotation was computed. [2021-12-06 20:22:36,102 INFO L858 garLoopResultBuilder]: For program point L2733-1(line 2733) no Hoare annotation was computed. [2021-12-06 20:22:36,103 INFO L854 garLoopResultBuilder]: At program point L2733(line 2733) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2021-12-06 20:22:36,103 INFO L858 garLoopResultBuilder]: For program point L2568(lines 2568 2578) no Hoare annotation was computed. [2021-12-06 20:22:36,103 INFO L854 garLoopResultBuilder]: At program point L2568-2(lines 2568 2578) the Hoare annotation is: false [2021-12-06 20:22:36,103 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-06 20:22:36,103 INFO L854 garLoopResultBuilder]: At program point L2998(lines 2997 2999) the Hoare annotation is: false [2021-12-06 20:22:36,103 INFO L858 garLoopResultBuilder]: For program point L2668(line 2668) no Hoare annotation was computed. [2021-12-06 20:22:36,103 INFO L858 garLoopResultBuilder]: For program point L2569-1(lines 2569 2572) no Hoare annotation was computed. [2021-12-06 20:22:36,103 INFO L854 garLoopResultBuilder]: At program point L2569(lines 2569 2572) the Hoare annotation is: false [2021-12-06 20:22:36,103 INFO L854 garLoopResultBuilder]: At program point L2470(line 2470) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ ~nwriters_stress~0 1) 0)) [2021-12-06 20:22:36,103 INFO L854 garLoopResultBuilder]: At program point L2503(lines 2425 2585) the Hoare annotation is: false [2021-12-06 20:22:36,103 INFO L858 garLoopResultBuilder]: For program point L2470-1(line 2470) no Hoare annotation was computed. [2021-12-06 20:22:36,103 INFO L858 garLoopResultBuilder]: For program point L2801(line 2801) no Hoare annotation was computed. [2021-12-06 20:22:36,103 INFO L858 garLoopResultBuilder]: For program point L2636(line 2636) no Hoare annotation was computed. [2021-12-06 20:22:36,103 INFO L858 garLoopResultBuilder]: For program point L2669(lines 2669 2674) no Hoare annotation was computed. [2021-12-06 20:22:36,104 INFO L858 garLoopResultBuilder]: For program point L2802(lines 2802 2806) no Hoare annotation was computed. [2021-12-06 20:22:36,104 INFO L858 garLoopResultBuilder]: For program point L2802-2(lines 2781 2831) no Hoare annotation was computed. [2021-12-06 20:22:36,104 INFO L858 garLoopResultBuilder]: For program point L2637(lines 2637 2641) no Hoare annotation was computed. [2021-12-06 20:22:36,104 INFO L858 garLoopResultBuilder]: For program point L2637-2(lines 2628 2678) no Hoare annotation was computed. [2021-12-06 20:22:36,104 INFO L854 garLoopResultBuilder]: At program point L2505(lines 2425 2585) the Hoare annotation is: false [2021-12-06 20:22:36,104 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-06 20:22:36,104 INFO L858 garLoopResultBuilder]: For program point L2836(line 2836) no Hoare annotation was computed. [2021-12-06 20:22:36,104 INFO L858 garLoopResultBuilder]: For program point L2803-1(line 2803) no Hoare annotation was computed. [2021-12-06 20:22:36,104 INFO L854 garLoopResultBuilder]: At program point L2803(line 2803) the Hoare annotation is: false [2021-12-06 20:22:36,104 INFO L854 garLoopResultBuilder]: At program point L2638(line 2638) the Hoare annotation is: false [2021-12-06 20:22:36,104 INFO L858 garLoopResultBuilder]: For program point L2638-1(line 2638) no Hoare annotation was computed. [2021-12-06 20:22:36,104 INFO L854 garLoopResultBuilder]: At program point L3068(lines 3067 3069) the Hoare annotation is: false [2021-12-06 20:22:36,104 INFO L854 garLoopResultBuilder]: At program point L3002(lines 3001 3003) the Hoare annotation is: false [2021-12-06 20:22:36,104 INFO L854 garLoopResultBuilder]: At program point L3035(lines 3034 3036) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-12-06 20:22:36,104 INFO L861 garLoopResultBuilder]: At program point L2837(line 2837) the Hoare annotation is: true [2021-12-06 20:22:36,105 INFO L854 garLoopResultBuilder]: At program point L2738(line 2738) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2021-12-06 20:22:36,105 INFO L858 garLoopResultBuilder]: For program point L2771(line 2771) no Hoare annotation was computed. [2021-12-06 20:22:36,105 INFO L858 garLoopResultBuilder]: For program point L2738-1(line 2738) no Hoare annotation was computed. [2021-12-06 20:22:36,105 INFO L858 garLoopResultBuilder]: For program point L2573(lines 2573 2576) no Hoare annotation was computed. [2021-12-06 20:22:36,105 INFO L858 garLoopResultBuilder]: For program point L2474(lines 2474 2477) no Hoare annotation was computed. [2021-12-06 20:22:36,105 INFO L858 garLoopResultBuilder]: For program point L2474-2(lines 2425 2585) no Hoare annotation was computed. [2021-12-06 20:22:36,105 INFO L854 garLoopResultBuilder]: At program point L1880(lines 1875 1882) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-12-06 20:22:36,105 INFO L861 garLoopResultBuilder]: At program point L2772(line 2772) the Hoare annotation is: true [2021-12-06 20:22:36,105 INFO L854 garLoopResultBuilder]: At program point L2574(lines 2425 2585) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (<= (+ |ULTIMATE.start_lock_torture_init_~firsterr~0#1| 12) 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-12-06 20:22:36,105 INFO L858 garLoopResultBuilder]: For program point L2508(lines 2508 2515) no Hoare annotation was computed. [2021-12-06 20:22:36,105 INFO L858 garLoopResultBuilder]: For program point L2475-1(line 2475) no Hoare annotation was computed. [2021-12-06 20:22:36,105 INFO L858 garLoopResultBuilder]: For program point L2508-2(lines 2425 2585) no Hoare annotation was computed. [2021-12-06 20:22:36,105 INFO L854 garLoopResultBuilder]: At program point L2475(line 2475) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-12-06 20:22:36,106 INFO L854 garLoopResultBuilder]: At program point L2839(lines 2609 2844) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2021-12-06 20:22:36,106 INFO L861 garLoopResultBuilder]: At program point L2707(lines 2609 2844) the Hoare annotation is: true [2021-12-06 20:22:36,106 INFO L858 garLoopResultBuilder]: For program point L2542(lines 2542 2550) no Hoare annotation was computed. [2021-12-06 20:22:36,106 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-06 20:22:36,106 INFO L858 garLoopResultBuilder]: For program point L2510(lines 2510 2513) no Hoare annotation was computed. [2021-12-06 20:22:36,106 INFO L858 garLoopResultBuilder]: For program point L2543(lines 2543 2546) no Hoare annotation was computed. [2021-12-06 20:22:36,106 INFO L858 garLoopResultBuilder]: For program point L2543-2(lines 2543 2546) no Hoare annotation was computed. [2021-12-06 20:22:36,106 INFO L854 garLoopResultBuilder]: At program point L3072(lines 3071 3073) the Hoare annotation is: false [2021-12-06 20:22:36,106 INFO L854 garLoopResultBuilder]: At program point L3006(lines 3005 3007) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2021-12-06 20:22:36,106 INFO L854 garLoopResultBuilder]: At program point L2808(line 2808) the Hoare annotation is: false [2021-12-06 20:22:36,106 INFO L858 garLoopResultBuilder]: For program point L2808-1(line 2808) no Hoare annotation was computed. [2021-12-06 20:22:36,106 INFO L858 garLoopResultBuilder]: For program point L2676(line 2676) no Hoare annotation was computed. [2021-12-06 20:22:36,106 INFO L854 garLoopResultBuilder]: At program point L2610(line 2610) the Hoare annotation is: (and (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-12-06 20:22:36,106 INFO L858 garLoopResultBuilder]: For program point L2643-1(line 2643) no Hoare annotation was computed. [2021-12-06 20:22:36,106 INFO L854 garLoopResultBuilder]: At program point L2643(line 2643) the Hoare annotation is: false [2021-12-06 20:22:36,107 INFO L858 garLoopResultBuilder]: For program point L2610-1(line 2610) no Hoare annotation was computed. [2021-12-06 20:22:36,107 INFO L858 garLoopResultBuilder]: For program point L2445(lines 2445 2448) no Hoare annotation was computed. [2021-12-06 20:22:36,107 INFO L854 garLoopResultBuilder]: At program point L2478-1(lines 2478 2483) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-12-06 20:22:36,107 INFO L858 garLoopResultBuilder]: For program point L2743(line 2743) no Hoare annotation was computed. [2021-12-06 20:22:36,107 INFO L861 garLoopResultBuilder]: At program point L2677(line 2677) the Hoare annotation is: true [2021-12-06 20:22:36,107 INFO L854 garLoopResultBuilder]: At program point L2894(line 2894) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (not (<= (+ ~nwriters_stress~0 1) 0))) [2021-12-06 20:22:36,107 INFO L858 garLoopResultBuilder]: For program point ldv_check_alloc_flagsEXIT(lines 2889 2898) no Hoare annotation was computed. [2021-12-06 20:22:36,107 INFO L858 garLoopResultBuilder]: For program point L2892(lines 2892 2895) no Hoare annotation was computed. [2021-12-06 20:22:36,107 INFO L858 garLoopResultBuilder]: For program point L2894-1(lines 2889 2898) no Hoare annotation was computed. [2021-12-06 20:22:36,107 INFO L861 garLoopResultBuilder]: At program point ldv_check_alloc_flagsENTRY(lines 2889 2898) the Hoare annotation is: true [2021-12-06 20:22:36,110 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:22:36,110 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 20:22:36,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 08:22:36 BoogieIcfgContainer [2021-12-06 20:22:36,131 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 20:22:36,131 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 20:22:36,131 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 20:22:36,132 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 20:22:36,132 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 08:17:44" (3/4) ... [2021-12-06 20:22:36,134 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-06 20:22:36,138 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _torture_stop_kthread [2021-12-06 20:22:36,138 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2021-12-06 20:22:36,138 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_lock_busted_write_delay [2021-12-06 20:22:36,139 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_lock_spin_write_unlock_irq [2021-12-06 20:22:36,139 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __const_udelay [2021-12-06 20:22:36,139 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2021-12-06 20:22:36,139 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_lock_busted_write_lock [2021-12-06 20:22:36,139 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kmalloc [2021-12-06 20:22:36,139 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_random [2021-12-06 20:22:36,139 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2021-12-06 20:22:36,139 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure lock_torture_stats_print [2021-12-06 20:22:36,139 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_lock_busted_write_unlock [2021-12-06 20:22:36,139 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure lock_torture_print_module_parms [2021-12-06 20:22:36,139 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_delay [2021-12-06 20:22:36,139 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure lock_torture_cleanup [2021-12-06 20:22:36,139 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_init_end [2021-12-06 20:22:36,139 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2021-12-06 20:22:36,139 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_spin_unlock [2021-12-06 20:22:36,139 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_spin_lock [2021-12-06 20:22:36,139 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_lock_irq [2021-12-06 20:22:36,139 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2021-12-06 20:22:36,140 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _torture_create_kthread [2021-12-06 20:22:36,140 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_lock [2021-12-06 20:22:36,140 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~~TO~VOID [2021-12-06 20:22:36,140 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2021-12-06 20:22:36,140 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_unlock [2021-12-06 20:22:36,140 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_check_alloc_flags [2021-12-06 20:22:36,155 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 126 nodes and edges [2021-12-06 20:22:36,157 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 39 nodes and edges [2021-12-06 20:22:36,159 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-12-06 20:22:36,160 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-12-06 20:22:36,162 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-12-06 20:22:36,163 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-06 20:22:36,165 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-06 20:22:36,186 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_state_variable_0 == 1 && \result + 16 <= 0) && nwriters_stress + 1 <= 0) || (((ldv_state_variable_0 == 1 && firsterr + 12 <= 0) && \result + 12 <= 0) && nwriters_stress + 1 <= 0) [2021-12-06 20:22:36,186 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(ldv_spin == 0) || !(nwriters_stress + 1 <= 0)) || !(ldv_state_variable_0 == 1)) || (writer_tasks == \old(writer_tasks) && \old(writer_tasks) == writer_tasks)) && ((!(ldv_spin == 0) || !(nwriters_stress + 1 <= 0)) || (\old(unknown-#length-unknown) == unknown-#length-unknown && \old(\valid) == \valid)) [2021-12-06 20:22:36,188 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(ldv_spin == 0) || !(nwriters_stress + 1 <= 0)) || !(ldv_state_variable_0 == 1)) || (writer_tasks == \old(writer_tasks) && \old(writer_tasks) == writer_tasks)) && ((!(ldv_spin == 0) || !(nwriters_stress + 1 <= 0)) || (\old(unknown-#length-unknown) == unknown-#length-unknown && \old(\valid) == \valid)) [2021-12-06 20:22:36,188 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(ldv_spin == 0) || !(nwriters_stress + 1 <= 0)) || !(ldv_state_variable_0 == 1)) || (writer_tasks == \old(writer_tasks) && \old(writer_tasks) == writer_tasks)) && ((!(ldv_spin == 0) || !(nwriters_stress + 1 <= 0)) || (\old(unknown-#length-unknown) == unknown-#length-unknown && \old(\valid) == \valid)) [2021-12-06 20:22:36,251 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5450e765-5baf-4b70-be28-854b31259ace/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-06 20:22:36,251 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 20:22:36,252 INFO L158 Benchmark]: Toolchain (without parser) took 292927.24ms. Allocated memory was 94.4MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 72.0MB in the beginning and 549.9MB in the end (delta: -478.0MB). Peak memory consumption was 589.2MB. Max. memory is 16.1GB. [2021-12-06 20:22:36,252 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 94.4MB. Free memory was 72.4MB in the beginning and 72.3MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 20:22:36,252 INFO L158 Benchmark]: CACSL2BoogieTranslator took 645.84ms. Allocated memory was 94.4MB in the beginning and 117.4MB in the end (delta: 23.1MB). Free memory was 72.0MB in the beginning and 82.6MB in the end (delta: -10.6MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. [2021-12-06 20:22:36,252 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.85ms. Allocated memory is still 117.4MB. Free memory was 82.6MB in the beginning and 76.8MB in the end (delta: 5.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-06 20:22:36,253 INFO L158 Benchmark]: Boogie Preprocessor took 56.40ms. Allocated memory is still 117.4MB. Free memory was 76.8MB in the beginning and 72.1MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-06 20:22:36,253 INFO L158 Benchmark]: RCFGBuilder took 728.97ms. Allocated memory is still 117.4MB. Free memory was 72.1MB in the beginning and 48.1MB in the end (delta: 24.0MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. [2021-12-06 20:22:36,253 INFO L158 Benchmark]: TraceAbstraction took 291300.91ms. Allocated memory was 117.4MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 47.8MB in the beginning and 574.0MB in the end (delta: -526.3MB). Peak memory consumption was 895.6MB. Max. memory is 16.1GB. [2021-12-06 20:22:36,253 INFO L158 Benchmark]: Witness Printer took 119.94ms. Allocated memory is still 1.2GB. Free memory was 574.0MB in the beginning and 549.9MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2021-12-06 20:22:36,255 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 94.4MB. Free memory was 72.4MB in the beginning and 72.3MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 645.84ms. Allocated memory was 94.4MB in the beginning and 117.4MB in the end (delta: 23.1MB). Free memory was 72.0MB in the beginning and 82.6MB in the end (delta: -10.6MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.85ms. Allocated memory is still 117.4MB. Free memory was 82.6MB in the beginning and 76.8MB in the end (delta: 5.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.40ms. Allocated memory is still 117.4MB. Free memory was 76.8MB in the beginning and 72.1MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 728.97ms. Allocated memory is still 117.4MB. Free memory was 72.1MB in the beginning and 48.1MB in the end (delta: 24.0MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. * TraceAbstraction took 291300.91ms. Allocated memory was 117.4MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 47.8MB in the beginning and 574.0MB in the end (delta: -526.3MB). Peak memory consumption was 895.6MB. Max. memory is 16.1GB. * Witness Printer took 119.94ms. Allocated memory is still 1.2GB. Free memory was 574.0MB in the beginning and 549.9MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 2013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 28 procedures, 348 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 291.2s, OverallIterations: 15, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 276.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10984 SdHoareTripleChecker+Valid, 6.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10562 mSDsluCounter, 20020 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12055 mSDsCounter, 4498 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6394 IncrementalHoareTripleChecker+Invalid, 10892 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4498 mSolverCounterUnsat, 7965 mSDtfsCounter, 6394 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 650 GetRequests, 525 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19472occurred in iteration=12, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 7240 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 139 LocationsWithAnnotation, 21749 PreInvPairs, 23013 NumberOfFragments, 1944 HoareAnnotationTreeSize, 21749 FomulaSimplifications, 8815990 FormulaSimplificationTreeSizeReduction, 272.2s HoareSimplificationTime, 139 FomulaSimplificationsInter, 1904441 FormulaSimplificationTreeSizeReductionInter, 3.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1696 NumberOfCodeBlocks, 1696 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1679 ConstructedInterpolants, 0 QuantifiedInterpolants, 3213 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2130 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 17 InterpolantComputations, 15 PerfectInterpolantSequences, 463/489 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 3071]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2862]: Loop Invariant Derived loop invariant: ((((((!(ldv_state_variable_1 == 0) || !(onoff_interval == 0)) || !(0 == lwsa)) || !(nwriters_stress + 1 <= 0)) || ldv_spin == 0) || !(ldv_state_variable_0 == 1)) || !(ldv_state_variable_2 == 0)) || !(lwsa == 0) - InvariantResult [Line: 1917]: Loop Invariant Derived loop invariant: ((((((!(ldv_state_variable_1 == 0) || !(onoff_interval == 0)) || !(0 == lwsa)) || !(nwriters_stress + 1 <= 0)) || ldv_spin == 0) || !(ldv_state_variable_0 == 1)) || !(ldv_state_variable_2 == 0)) || !(lwsa == 0) - InvariantResult [Line: 2956]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1875]: Loop Invariant Derived loop invariant: ((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 3060]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2425]: Loop Invariant Derived loop invariant: ((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 3067]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2959]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2096]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2142]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2965]: Loop Invariant Derived loop invariant: ((((((!(ldv_state_variable_1 == 0) || !(onoff_interval == 0)) || !(0 == lwsa)) || !(nwriters_stress + 1 <= 0)) || ldv_spin == 0) || !(ldv_state_variable_0 == 1)) || !(ldv_state_variable_2 == 0)) || !(lwsa == 0) - InvariantResult [Line: 2425]: Loop Invariant Derived loop invariant: ((ldv_state_variable_0 == 1 && ldv_spin == 0) && firsterr + 12 <= 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 1935]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2383]: Loop Invariant Derived loop invariant: (((!(ldv_spin == 0) || !(nwriters_stress + 1 <= 0)) || !(ldv_state_variable_0 == 1)) || (writer_tasks == \old(writer_tasks) && \old(writer_tasks) == writer_tasks)) && ((!(ldv_spin == 0) || !(nwriters_stress + 1 <= 0)) || (\old(unknown-#length-unknown) == unknown-#length-unknown && \old(\valid) == \valid)) - InvariantResult [Line: 2997]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3005]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) || (((((onoff_interval == 0 && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && nwriters_stress + 1 <= 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 3030]: Loop Invariant Derived loop invariant: (((!(ldv_spin == 0) || !(nwriters_stress + 1 <= 0)) || !(ldv_state_variable_0 == 1)) || (writer_tasks == \old(writer_tasks) && \old(writer_tasks) == writer_tasks)) && ((!(ldv_spin == 0) || !(nwriters_stress + 1 <= 0)) || (\old(unknown-#length-unknown) == unknown-#length-unknown && \old(\valid) == \valid)) - InvariantResult [Line: 2142]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2383]: Loop Invariant Derived loop invariant: (((!(ldv_spin == 0) || !(nwriters_stress + 1 <= 0)) || !(ldv_state_variable_0 == 1)) || (writer_tasks == \old(writer_tasks) && \old(writer_tasks) == writer_tasks)) && ((!(ldv_spin == 0) || !(nwriters_stress + 1 <= 0)) || (\old(unknown-#length-unknown) == unknown-#length-unknown && \old(\valid) == \valid)) - InvariantResult [Line: 1893]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2096]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2985]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2414]: Loop Invariant Derived loop invariant: ((ldv_state_variable_0 == 1 && \result + 16 <= 0) && nwriters_stress + 1 <= 0) || (((ldv_state_variable_0 == 1 && firsterr + 12 <= 0) && \result + 12 <= 0) && nwriters_stress + 1 <= 0) - InvariantResult [Line: 2425]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1909]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2425]: Loop Invariant Derived loop invariant: ((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 3034]: Loop Invariant Derived loop invariant: ((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 2854]: Loop Invariant Derived loop invariant: ((((((!(ldv_state_variable_1 == 0) || !(onoff_interval == 0)) || !(0 == lwsa)) || !(nwriters_stress + 1 <= 0)) || ldv_spin == 0) || !(ldv_state_variable_0 == 1)) || !(ldv_state_variable_2 == 0)) || !(lwsa == 0) - InvariantResult [Line: 2981]: Loop Invariant Derived loop invariant: ((((((onoff_interval == 0 && ldv_state_variable_2 == 0) && ldv_spin == 0) && 0 <= ref_cnt) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 2846]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2609]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) || (((((onoff_interval == 0 && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && nwriters_stress + 1 <= 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 2596]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2425]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2425]: Loop Invariant Derived loop invariant: ((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 3001]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2609]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2950]: Loop Invariant Derived loop invariant: ((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 2016]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2425]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1885]: Loop Invariant Derived loop invariant: ((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 2993]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) || (((((onoff_interval == 0 && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && nwriters_stress + 1 <= 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 2962]: Loop Invariant Derived loop invariant: ((((((!(ldv_state_variable_1 == 0) || !(onoff_interval == 0)) || !(0 == lwsa)) || !(nwriters_stress + 1 <= 0)) || ldv_spin == 0) || !(ldv_state_variable_0 == 1)) || !(ldv_state_variable_2 == 0)) || !(lwsa == 0) - InvariantResult [Line: 2456]: Loop Invariant Derived loop invariant: ldv_state_variable_0 == 1 && nwriters_stress + 1 <= 0 - InvariantResult [Line: 2265]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2880]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2978]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2989]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2274]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1940]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3052]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3048]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2456]: Loop Invariant Derived loop invariant: ldv_state_variable_0 == 1 && nwriters_stress + 1 <= 0 - InvariantResult [Line: 2274]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2425]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1899]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1925]: Loop Invariant Derived loop invariant: ((((((!(ldv_state_variable_1 == 0) || !(onoff_interval == 0)) || !(0 == lwsa)) || !(nwriters_stress + 1 <= 0)) || ldv_spin == 0) || !(ldv_state_variable_0 == 1)) || !(ldv_state_variable_2 == 0)) || !(lwsa == 0) RESULT: Ultimate proved your program to be correct! [2021-12-06 20:22:36,308 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5450e765-5baf-4b70-be28-854b31259ace/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE