./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 b5237d83 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094c5e8a-dcc6-4cae-863b-93e697bee2df/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094c5e8a-dcc6-4cae-863b-93e697bee2df/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094c5e8a-dcc6-4cae-863b-93e697bee2df/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094c5e8a-dcc6-4cae-863b-93e697bee2df/bin/uautomizer-vX5HgA9Q3a/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_094c5e8a-dcc6-4cae-863b-93e697bee2df/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094c5e8a-dcc6-4cae-863b-93e697bee2df/bin/uautomizer-vX5HgA9Q3a --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 16:47:26,837 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:47:26,839 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:47:26,895 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:47:26,895 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:47:26,896 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:47:26,897 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:47:26,899 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:47:26,901 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:47:26,901 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:47:26,902 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:47:26,904 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:47:26,904 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:47:26,905 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:47:26,906 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:47:26,907 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:47:26,908 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:47:26,919 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:47:26,921 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:47:26,922 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:47:26,924 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:47:26,925 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:47:26,926 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:47:26,927 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:47:26,931 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:47:26,931 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:47:26,931 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:47:26,932 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:47:26,933 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:47:26,934 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:47:26,934 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:47:26,935 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:47:26,936 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:47:26,937 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:47:26,938 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:47:26,938 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:47:26,939 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:47:26,939 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:47:26,939 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:47:26,941 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:47:26,941 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:47:26,942 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094c5e8a-dcc6-4cae-863b-93e697bee2df/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-21 16:47:26,962 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:47:26,962 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:47:26,963 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:47:26,963 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:47:26,963 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:47:26,964 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:47:26,964 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:47:26,965 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:47:26,965 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:47:26,965 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:47:26,965 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:47:26,965 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:47:26,966 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 16:47:26,966 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:47:26,966 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 16:47:26,966 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 16:47:26,967 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:47:26,967 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 16:47:26,967 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:47:26,967 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:47:26,967 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:47:26,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:47:26,968 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:47:26,968 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:47:26,968 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 16:47:26,969 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:47:26,969 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:47:26,969 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 16:47:26,969 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 16:47:26,969 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 16:47:26,970 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_094c5e8a-dcc6-4cae-863b-93e697bee2df/bin/uautomizer-vX5HgA9Q3a/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_094c5e8a-dcc6-4cae-863b-93e697bee2df/bin/uautomizer-vX5HgA9Q3a 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 [2022-11-21 16:47:27,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:47:27,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:47:27,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:47:27,329 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:47:27,330 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:47:27,331 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094c5e8a-dcc6-4cae-863b-93e697bee2df/bin/uautomizer-vX5HgA9Q3a/../../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 [2022-11-21 16:47:30,329 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:47:30,720 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:47:30,721 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094c5e8a-dcc6-4cae-863b-93e697bee2df/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 [2022-11-21 16:47:30,745 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094c5e8a-dcc6-4cae-863b-93e697bee2df/bin/uautomizer-vX5HgA9Q3a/data/c4e97f018/e7fb69005cd1484da4f86337a2eae53b/FLAG52d2633ac [2022-11-21 16:47:30,760 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094c5e8a-dcc6-4cae-863b-93e697bee2df/bin/uautomizer-vX5HgA9Q3a/data/c4e97f018/e7fb69005cd1484da4f86337a2eae53b [2022-11-21 16:47:30,763 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:47:30,764 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:47:30,766 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:47:30,766 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:47:30,770 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:47:30,771 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:47:30" (1/1) ... [2022-11-21 16:47:30,772 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67e0fd56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:47:30, skipping insertion in model container [2022-11-21 16:47:30,772 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:47:30" (1/1) ... [2022-11-21 16:47:30,780 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:47:30,837 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:47:31,261 WARN L1259 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1764] [2022-11-21 16:47:31,261 WARN L1259 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1765-1766] [2022-11-21 16:47:31,399 WARN L237 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_094c5e8a-dcc6-4cae-863b-93e697bee2df/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] [2022-11-21 16:47:31,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:47:31,612 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:47:31,668 WARN L1259 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1764] [2022-11-21 16:47:31,668 WARN L1259 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1765-1766] [2022-11-21 16:47:31,679 WARN L237 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_094c5e8a-dcc6-4cae-863b-93e697bee2df/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] [2022-11-21 16:47:31,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:47:31,765 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:47:31,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:47:31 WrapperNode [2022-11-21 16:47:31,766 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:47:31,767 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:47:31,767 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:47:31,767 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:47:31,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:47:31" (1/1) ... [2022-11-21 16:47:31,816 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:47:31" (1/1) ... [2022-11-21 16:47:31,884 INFO L138 Inliner]: procedures = 114, calls = 288, calls flagged for inlining = 49, calls inlined = 38, statements flattened = 870 [2022-11-21 16:47:31,893 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:47:31,894 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:47:31,894 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:47:31,894 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:47:31,904 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:47:31" (1/1) ... [2022-11-21 16:47:31,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:47:31" (1/1) ... [2022-11-21 16:47:31,918 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:47:31" (1/1) ... [2022-11-21 16:47:31,924 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:47:31" (1/1) ... [2022-11-21 16:47:31,956 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:47:31" (1/1) ... [2022-11-21 16:47:31,975 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:47:31" (1/1) ... [2022-11-21 16:47:31,979 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:47:31" (1/1) ... [2022-11-21 16:47:31,983 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:47:31" (1/1) ... [2022-11-21 16:47:32,005 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:47:32,006 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:47:32,006 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:47:32,006 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:47:32,007 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:47:31" (1/1) ... [2022-11-21 16:47:32,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:47:32,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094c5e8a-dcc6-4cae-863b-93e697bee2df/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:47:32,053 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094c5e8a-dcc6-4cae-863b-93e697bee2df/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:47:32,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094c5e8a-dcc6-4cae-863b-93e697bee2df/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:47:32,101 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_stop_kthread [2022-11-21 16:47:32,101 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_stop_kthread [2022-11-21 16:47:32,102 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_lock [2022-11-21 16:47:32,102 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_lock [2022-11-21 16:47:32,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-21 16:47:32,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-21 16:47:32,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 16:47:32,105 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_delay [2022-11-21 16:47:32,105 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_delay [2022-11-21 16:47:32,106 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock [2022-11-21 16:47:32,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock [2022-11-21 16:47:32,106 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-21 16:47:32,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-21 16:47:32,106 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_create_kthread [2022-11-21 16:47:32,106 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_create_kthread [2022-11-21 16:47:32,107 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock [2022-11-21 16:47:32,107 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock [2022-11-21 16:47:32,107 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-11-21 16:47:32,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-11-21 16:47:32,107 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-21 16:47:32,107 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-21 16:47:32,108 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_spin_write_unlock_irq [2022-11-21 16:47:32,108 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_spin_write_unlock_irq [2022-11-21 16:47:32,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 16:47:32,108 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-21 16:47:32,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-21 16:47:32,108 INFO L130 BoogieDeclarations]: Found specification of procedure torture_random [2022-11-21 16:47:32,109 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_random [2022-11-21 16:47:32,109 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_cleanup [2022-11-21 16:47:32,110 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_cleanup [2022-11-21 16:47:32,110 INFO L130 BoogieDeclarations]: Found specification of procedure torture_init_end [2022-11-21 16:47:32,110 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_init_end [2022-11-21 16:47:32,110 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-21 16:47:32,111 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-21 16:47:32,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 16:47:32,112 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2022-11-21 16:47:32,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2022-11-21 16:47:32,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:47:32,112 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-11-21 16:47:32,112 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-11-21 16:47:32,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-21 16:47:32,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 16:47:32,113 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_stats_print [2022-11-21 16:47:32,113 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_stats_print [2022-11-21 16:47:32,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-21 16:47:32,114 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock [2022-11-21 16:47:32,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock [2022-11-21 16:47:32,114 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock_irq [2022-11-21 16:47:32,114 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock_irq [2022-11-21 16:47:32,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:47:32,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-21 16:47:32,115 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_delay [2022-11-21 16:47:32,115 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_delay [2022-11-21 16:47:32,115 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-11-21 16:47:32,116 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-11-21 16:47:32,116 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_unlock [2022-11-21 16:47:32,117 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_unlock [2022-11-21 16:47:32,117 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_print_module_parms [2022-11-21 16:47:32,117 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_print_module_parms [2022-11-21 16:47:32,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:47:32,118 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-11-21 16:47:32,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-11-21 16:47:32,118 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_unlock [2022-11-21 16:47:32,118 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_unlock [2022-11-21 16:47:32,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:47:32,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:47:32,391 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:47:32,394 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:47:32,523 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-21 16:47:33,363 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:47:33,374 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:47:33,374 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-21 16:47:33,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:47:33 BoogieIcfgContainer [2022-11-21 16:47:33,377 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:47:33,380 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:47:33,380 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:47:33,383 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:47:33,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:47:30" (1/3) ... [2022-11-21 16:47:33,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5928f753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:47:33, skipping insertion in model container [2022-11-21 16:47:33,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:47:31" (2/3) ... [2022-11-21 16:47:33,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5928f753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:47:33, skipping insertion in model container [2022-11-21 16:47:33,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:47:33" (3/3) ... [2022-11-21 16:47:33,387 INFO L112 eAbstractionObserver]: Analyzing ICFG 43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2022-11-21 16:47:33,407 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:47:33,407 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-21 16:47:33,488 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:47:33,497 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@57f833c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:47:33,497 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-21 16:47:33,505 INFO L276 IsEmpty]: Start isEmpty. Operand has 344 states, 255 states have (on average 1.407843137254902) internal successors, (359), 271 states have internal predecessors, (359), 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) [2022-11-21 16:47:33,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-21 16:47:33,534 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:47:33,535 INFO L195 NwaCegarLoop]: 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] [2022-11-21 16:47:33,536 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:47:33,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:47:33,541 INFO L85 PathProgramCache]: Analyzing trace with hash -623334791, now seen corresponding path program 1 times [2022-11-21 16:47:33,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:47:33,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337793698] [2022-11-21 16:47:33,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:47:33,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:47:33,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:34,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:47:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:34,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-21 16:47:34,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:34,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-21 16:47:34,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:34,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 16:47:34,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:34,107 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-21 16:47:34,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:47:34,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337793698] [2022-11-21 16:47:34,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337793698] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:47:34,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:47:34,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:47:34,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197835834] [2022-11-21 16:47:34,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:47:34,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:47:34,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:47:34,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:47:34,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:47:34,160 INFO L87 Difference]: Start difference. First operand has 344 states, 255 states have (on average 1.407843137254902) internal successors, (359), 271 states have internal predecessors, (359), 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) [2022-11-21 16:47:35,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:47:35,480 INFO L93 Difference]: Finished difference Result 1001 states and 1410 transitions. [2022-11-21 16:47:35,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:47:35,487 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 [2022-11-21 16:47:35,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:47:35,515 INFO L225 Difference]: With dead ends: 1001 [2022-11-21 16:47:35,515 INFO L226 Difference]: Without dead ends: 565 [2022-11-21 16:47:35,525 INFO L412 NwaCegarLoop]: 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 [2022-11-21 16:47:35,535 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 624 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:47:35,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 727 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-21 16:47:35,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2022-11-21 16:47:35,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 521. [2022-11-21 16:47:35,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 394 states have (on average 1.3756345177664975) internal successors, (542), 405 states have internal predecessors, (542), 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) [2022-11-21 16:47:35,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 709 transitions. [2022-11-21 16:47:35,688 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 709 transitions. Word has length 45 [2022-11-21 16:47:35,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:47:35,689 INFO L495 AbstractCegarLoop]: Abstraction has 521 states and 709 transitions. [2022-11-21 16:47:35,691 INFO L496 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) [2022-11-21 16:47:35,692 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 709 transitions. [2022-11-21 16:47:35,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-21 16:47:35,700 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:47:35,700 INFO L195 NwaCegarLoop]: 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] [2022-11-21 16:47:35,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 16:47:35,700 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:47:35,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:47:35,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1815099580, now seen corresponding path program 1 times [2022-11-21 16:47:35,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:47:35,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132033343] [2022-11-21 16:47:35,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:47:35,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:47:35,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:35,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:47:35,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:35,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-21 16:47:35,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:35,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-21 16:47:35,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:35,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-21 16:47:35,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:35,941 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-21 16:47:35,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:47:35,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132033343] [2022-11-21 16:47:35,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132033343] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:47:35,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:47:35,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:47:35,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669842069] [2022-11-21 16:47:35,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:47:35,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:47:35,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:47:35,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:47:35,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:47:35,945 INFO L87 Difference]: Start difference. First operand 521 states and 709 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) [2022-11-21 16:47:36,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:47:36,545 INFO L93 Difference]: Finished difference Result 1063 states and 1456 transitions. [2022-11-21 16:47:36,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:47:36,545 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 [2022-11-21 16:47:36,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:47:36,554 INFO L225 Difference]: With dead ends: 1063 [2022-11-21 16:47:36,554 INFO L226 Difference]: Without dead ends: 562 [2022-11-21 16:47:36,556 INFO L412 NwaCegarLoop]: 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 [2022-11-21 16:47:36,557 INFO L413 NwaCegarLoop]: 286 mSDtfsCounter, 530 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 16:47:36,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 493 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 16:47:36,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2022-11-21 16:47:36,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 521. [2022-11-21 16:47:36,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 394 states have (on average 1.3730964467005076) internal successors, (541), 405 states have internal predecessors, (541), 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) [2022-11-21 16:47:36,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 708 transitions. [2022-11-21 16:47:36,606 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 708 transitions. Word has length 47 [2022-11-21 16:47:36,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:47:36,607 INFO L495 AbstractCegarLoop]: Abstraction has 521 states and 708 transitions. [2022-11-21 16:47:36,607 INFO L496 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) [2022-11-21 16:47:36,608 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 708 transitions. [2022-11-21 16:47:36,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-21 16:47:36,610 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:47:36,610 INFO L195 NwaCegarLoop]: 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] [2022-11-21 16:47:36,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 16:47:36,611 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:47:36,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:47:36,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1714265753, now seen corresponding path program 1 times [2022-11-21 16:47:36,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:47:36,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265191418] [2022-11-21 16:47:36,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:47:36,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:47:36,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:36,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:47:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:36,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-21 16:47:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:36,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-21 16:47:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:36,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-21 16:47:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:36,752 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-21 16:47:36,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:47:36,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265191418] [2022-11-21 16:47:36,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265191418] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:47:36,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:47:36,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:47:36,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999363991] [2022-11-21 16:47:36,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:47:36,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:47:36,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:47:36,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:47:36,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:47:36,755 INFO L87 Difference]: Start difference. First operand 521 states and 708 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) [2022-11-21 16:47:37,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:47:37,807 INFO L93 Difference]: Finished difference Result 1040 states and 1462 transitions. [2022-11-21 16:47:37,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:47:37,808 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 [2022-11-21 16:47:37,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:47:37,813 INFO L225 Difference]: With dead ends: 1040 [2022-11-21 16:47:37,813 INFO L226 Difference]: Without dead ends: 1011 [2022-11-21 16:47:37,814 INFO L412 NwaCegarLoop]: 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 [2022-11-21 16:47:37,815 INFO L413 NwaCegarLoop]: 354 mSDtfsCounter, 589 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-21 16:47:37,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 798 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-21 16:47:37,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2022-11-21 16:47:37,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 924. [2022-11-21 16:47:37,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 711 states have (on average 1.410689170182841) internal successors, (1003), 735 states have internal predecessors, (1003), 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) [2022-11-21 16:47:37,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1293 transitions. [2022-11-21 16:47:37,971 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1293 transitions. Word has length 50 [2022-11-21 16:47:37,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:47:37,971 INFO L495 AbstractCegarLoop]: Abstraction has 924 states and 1293 transitions. [2022-11-21 16:47:37,972 INFO L496 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) [2022-11-21 16:47:37,972 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1293 transitions. [2022-11-21 16:47:37,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-21 16:47:37,975 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:47:37,975 INFO L195 NwaCegarLoop]: 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] [2022-11-21 16:47:37,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 16:47:37,976 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:47:37,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:47:37,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1240627471, now seen corresponding path program 1 times [2022-11-21 16:47:37,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:47:37,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004962386] [2022-11-21 16:47:37,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:47:37,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:47:38,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:38,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:47:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:38,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-21 16:47:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:38,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-21 16:47:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:38,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-21 16:47:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:38,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:47:38,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:38,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-21 16:47:38,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:38,155 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-21 16:47:38,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:47:38,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004962386] [2022-11-21 16:47:38,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004962386] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:47:38,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:47:38,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:47:38,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516568172] [2022-11-21 16:47:38,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:47:38,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:47:38,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:47:38,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:47:38,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:47:38,159 INFO L87 Difference]: Start difference. First operand 924 states and 1293 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) [2022-11-21 16:47:39,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:47:39,613 INFO L93 Difference]: Finished difference Result 2728 states and 3817 transitions. [2022-11-21 16:47:39,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:47:39,614 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 [2022-11-21 16:47:39,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:47:39,627 INFO L225 Difference]: With dead ends: 2728 [2022-11-21 16:47:39,627 INFO L226 Difference]: Without dead ends: 1824 [2022-11-21 16:47:39,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-21 16:47:39,631 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 1054 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 523 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1092 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 523 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:47:39,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1092 Valid, 931 Invalid, 1245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [523 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-21 16:47:39,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states. [2022-11-21 16:47:39,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 1643. [2022-11-21 16:47:39,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1643 states, 1272 states have (on average 1.4111635220125787) internal successors, (1795), 1312 states have internal predecessors, (1795), 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) [2022-11-21 16:47:39,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1643 states to 1643 states and 2288 transitions. [2022-11-21 16:47:39,783 INFO L78 Accepts]: Start accepts. Automaton has 1643 states and 2288 transitions. Word has length 65 [2022-11-21 16:47:39,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:47:39,784 INFO L495 AbstractCegarLoop]: Abstraction has 1643 states and 2288 transitions. [2022-11-21 16:47:39,784 INFO L496 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) [2022-11-21 16:47:39,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1643 states and 2288 transitions. [2022-11-21 16:47:39,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-21 16:47:39,789 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:47:39,789 INFO L195 NwaCegarLoop]: 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] [2022-11-21 16:47:39,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 16:47:39,790 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:47:39,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:47:39,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1517613762, now seen corresponding path program 1 times [2022-11-21 16:47:39,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:47:39,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69238153] [2022-11-21 16:47:39,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:47:39,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:47:39,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:39,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:47:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:39,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-21 16:47:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:39,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-21 16:47:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:39,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-21 16:47:39,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:39,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:47:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:39,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-21 16:47:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:39,936 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-21 16:47:39,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:47:39,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69238153] [2022-11-21 16:47:39,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69238153] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:47:39,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:47:39,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:47:39,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693242281] [2022-11-21 16:47:39,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:47:39,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:47:39,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:47:39,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:47:39,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:47:39,939 INFO L87 Difference]: Start difference. First operand 1643 states and 2288 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 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) [2022-11-21 16:47:40,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:47:40,992 INFO L93 Difference]: Finished difference Result 4057 states and 5823 transitions. [2022-11-21 16:47:40,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:47:40,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 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 [2022-11-21 16:47:40,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:47:41,004 INFO L225 Difference]: With dead ends: 4057 [2022-11-21 16:47:41,005 INFO L226 Difference]: Without dead ends: 2434 [2022-11-21 16:47:41,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:47:41,010 INFO L413 NwaCegarLoop]: 430 mSDtfsCounter, 565 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-21 16:47:41,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 1293 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-21 16:47:41,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states. [2022-11-21 16:47:41,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 1647. [2022-11-21 16:47:41,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1647 states, 1276 states have (on average 1.4098746081504703) internal successors, (1799), 1316 states have internal predecessors, (1799), 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) [2022-11-21 16:47:41,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 2292 transitions. [2022-11-21 16:47:41,181 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 2292 transitions. Word has length 73 [2022-11-21 16:47:41,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:47:41,182 INFO L495 AbstractCegarLoop]: Abstraction has 1647 states and 2292 transitions. [2022-11-21 16:47:41,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 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) [2022-11-21 16:47:41,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2292 transitions. [2022-11-21 16:47:41,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-21 16:47:41,187 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:47:41,187 INFO L195 NwaCegarLoop]: 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] [2022-11-21 16:47:41,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 16:47:41,188 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:47:41,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:47:41,188 INFO L85 PathProgramCache]: Analyzing trace with hash -531774080, now seen corresponding path program 1 times [2022-11-21 16:47:41,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:47:41,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831974078] [2022-11-21 16:47:41,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:47:41,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:47:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:41,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:47:41,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:41,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-21 16:47:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:41,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-21 16:47:41,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:41,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-21 16:47:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:41,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:47:41,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:41,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-21 16:47:41,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:41,422 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-21 16:47:41,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:47:41,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831974078] [2022-11-21 16:47:41,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831974078] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:47:41,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:47:41,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:47:41,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581119922] [2022-11-21 16:47:41,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:47:41,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:47:41,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:47:41,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:47:41,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:47:41,425 INFO L87 Difference]: Start difference. First operand 1647 states and 2292 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) [2022-11-21 16:47:42,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:47:42,538 INFO L93 Difference]: Finished difference Result 3438 states and 4800 transitions. [2022-11-21 16:47:42,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 16:47:42,539 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 [2022-11-21 16:47:42,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:47:42,548 INFO L225 Difference]: With dead ends: 3438 [2022-11-21 16:47:42,548 INFO L226 Difference]: Without dead ends: 1783 [2022-11-21 16:47:42,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:47:42,554 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 368 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-21 16:47:42,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 1153 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-21 16:47:42,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2022-11-21 16:47:42,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1627. [2022-11-21 16:47:42,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1627 states, 1260 states have (on average 1.4055555555555554) internal successors, (1771), 1300 states have internal predecessors, (1771), 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) [2022-11-21 16:47:42,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1627 states and 2256 transitions. [2022-11-21 16:47:42,690 INFO L78 Accepts]: Start accepts. Automaton has 1627 states and 2256 transitions. Word has length 73 [2022-11-21 16:47:42,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:47:42,690 INFO L495 AbstractCegarLoop]: Abstraction has 1627 states and 2256 transitions. [2022-11-21 16:47:42,690 INFO L496 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) [2022-11-21 16:47:42,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 2256 transitions. [2022-11-21 16:47:42,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-21 16:47:42,693 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:47:42,693 INFO L195 NwaCegarLoop]: 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] [2022-11-21 16:47:42,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 16:47:42,693 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:47:42,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:47:42,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1778660840, now seen corresponding path program 1 times [2022-11-21 16:47:42,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:47:42,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379302474] [2022-11-21 16:47:42,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:47:42,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:47:42,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:42,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:47:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:42,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-21 16:47:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:42,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-21 16:47:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:42,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-21 16:47:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:42,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:47:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:42,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-21 16:47:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:42,841 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-21 16:47:42,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:47:42,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379302474] [2022-11-21 16:47:42,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379302474] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:47:42,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:47:42,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:47:42,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190100681] [2022-11-21 16:47:42,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:47:42,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:47:42,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:47:42,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:47:42,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:47:42,844 INFO L87 Difference]: Start difference. First operand 1627 states and 2256 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) [2022-11-21 16:47:44,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:47:44,172 INFO L93 Difference]: Finished difference Result 4848 states and 6728 transitions. [2022-11-21 16:47:44,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:47:44,172 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 [2022-11-21 16:47:44,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:47:44,188 INFO L225 Difference]: With dead ends: 4848 [2022-11-21 16:47:44,188 INFO L226 Difference]: Without dead ends: 3241 [2022-11-21 16:47:44,193 INFO L412 NwaCegarLoop]: 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 [2022-11-21 16:47:44,194 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 764 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:47:44,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 1010 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-21 16:47:44,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3241 states. [2022-11-21 16:47:44,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3241 to 2912. [2022-11-21 16:47:44,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2912 states, 2254 states have (on average 1.4006211180124224) internal successors, (3157), 2330 states have internal predecessors, (3157), 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) [2022-11-21 16:47:44,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2912 states to 2912 states and 4016 transitions. [2022-11-21 16:47:44,443 INFO L78 Accepts]: Start accepts. Automaton has 2912 states and 4016 transitions. Word has length 71 [2022-11-21 16:47:44,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:47:44,444 INFO L495 AbstractCegarLoop]: Abstraction has 2912 states and 4016 transitions. [2022-11-21 16:47:44,444 INFO L496 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) [2022-11-21 16:47:44,444 INFO L276 IsEmpty]: Start isEmpty. Operand 2912 states and 4016 transitions. [2022-11-21 16:47:44,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-21 16:47:44,449 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:47:44,449 INFO L195 NwaCegarLoop]: 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] [2022-11-21 16:47:44,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 16:47:44,450 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:47:44,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:47:44,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1495438409, now seen corresponding path program 1 times [2022-11-21 16:47:44,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:47:44,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369858328] [2022-11-21 16:47:44,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:47:44,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:47:44,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:44,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:47:44,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:44,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-21 16:47:44,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:44,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-21 16:47:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:44,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-21 16:47:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:44,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 16:47:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:44,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:47:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:44,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 16:47:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:44,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-21 16:47:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:44,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-21 16:47:44,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:44,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-21 16:47:44,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:44,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:47:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:44,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-21 16:47:44,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:44,743 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-21 16:47:44,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:47:44,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369858328] [2022-11-21 16:47:44,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369858328] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:47:44,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:47:44,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 16:47:44,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732076569] [2022-11-21 16:47:44,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:47:44,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:47:44,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:47:44,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:47:44,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:47:44,746 INFO L87 Difference]: Start difference. First operand 2912 states and 4016 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) [2022-11-21 16:47:46,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:47:46,964 INFO L93 Difference]: Finished difference Result 7751 states and 10760 transitions. [2022-11-21 16:47:46,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 16:47:46,965 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 [2022-11-21 16:47:46,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:47:46,987 INFO L225 Difference]: With dead ends: 7751 [2022-11-21 16:47:46,987 INFO L226 Difference]: Without dead ends: 4859 [2022-11-21 16:47:46,994 INFO L412 NwaCegarLoop]: 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 [2022-11-21 16:47:46,995 INFO L413 NwaCegarLoop]: 416 mSDtfsCounter, 791 mSDsluCounter, 1804 mSDsCounter, 0 mSdLazyCounter, 1359 mSolverCounterSat, 412 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 2220 SdHoareTripleChecker+Invalid, 1771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 412 IncrementalHoareTripleChecker+Valid, 1359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-21 16:47:46,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 2220 Invalid, 1771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [412 Valid, 1359 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-21 16:47:47,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4859 states. [2022-11-21 16:47:47,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4859 to 4378. [2022-11-21 16:47:47,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4378 states, 3408 states have (on average 1.3952464788732395) internal successors, (4755), 3524 states have internal predecessors, (4755), 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) [2022-11-21 16:47:47,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4378 states to 4378 states and 6016 transitions. [2022-11-21 16:47:47,411 INFO L78 Accepts]: Start accepts. Automaton has 4378 states and 6016 transitions. Word has length 117 [2022-11-21 16:47:47,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:47:47,412 INFO L495 AbstractCegarLoop]: Abstraction has 4378 states and 6016 transitions. [2022-11-21 16:47:47,412 INFO L496 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) [2022-11-21 16:47:47,412 INFO L276 IsEmpty]: Start isEmpty. Operand 4378 states and 6016 transitions. [2022-11-21 16:47:47,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-11-21 16:47:47,419 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:47:47,419 INFO L195 NwaCegarLoop]: 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] [2022-11-21 16:47:47,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 16:47:47,420 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:47:47,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:47:47,420 INFO L85 PathProgramCache]: Analyzing trace with hash 377644094, now seen corresponding path program 1 times [2022-11-21 16:47:47,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:47:47,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541996553] [2022-11-21 16:47:47,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:47:47,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:47:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:47,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:47:47,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:47,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-21 16:47:47,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:47,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-21 16:47:47,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:47,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-21 16:47:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:47,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 16:47:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:47,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:47:47,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:47,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 16:47:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:47,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-21 16:47:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:47,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-21 16:47:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:47,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-21 16:47:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:47,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:47:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:47,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-21 16:47:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:47,623 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-21 16:47:47,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:47:47,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541996553] [2022-11-21 16:47:47,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541996553] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:47:47,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:47:47,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:47:47,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317513023] [2022-11-21 16:47:47,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:47:47,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:47:47,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:47:47,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:47:47,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:47:47,626 INFO L87 Difference]: Start difference. First operand 4378 states and 6016 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) [2022-11-21 16:47:49,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:47:49,595 INFO L93 Difference]: Finished difference Result 11633 states and 16097 transitions. [2022-11-21 16:47:49,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 16:47:49,595 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 [2022-11-21 16:47:49,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:47:49,631 INFO L225 Difference]: With dead ends: 11633 [2022-11-21 16:47:49,631 INFO L226 Difference]: Without dead ends: 7275 [2022-11-21 16:47:49,641 INFO L412 NwaCegarLoop]: 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 [2022-11-21 16:47:49,644 INFO L413 NwaCegarLoop]: 413 mSDtfsCounter, 922 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 515 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 955 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 1440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 515 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:47:49,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [955 Valid, 1262 Invalid, 1440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [515 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-21 16:47:49,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7275 states. [2022-11-21 16:47:50,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7275 to 6570. [2022-11-21 16:47:50,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6570 states, 5141 states have (on average 1.390390974518576) internal successors, (7148), 5317 states have internal predecessors, (7148), 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) [2022-11-21 16:47:50,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6570 states to 6570 states and 8997 transitions. [2022-11-21 16:47:50,316 INFO L78 Accepts]: Start accepts. Automaton has 6570 states and 8997 transitions. Word has length 123 [2022-11-21 16:47:50,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:47:50,318 INFO L495 AbstractCegarLoop]: Abstraction has 6570 states and 8997 transitions. [2022-11-21 16:47:50,319 INFO L496 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) [2022-11-21 16:47:50,319 INFO L276 IsEmpty]: Start isEmpty. Operand 6570 states and 8997 transitions. [2022-11-21 16:47:50,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-11-21 16:47:50,331 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:47:50,331 INFO L195 NwaCegarLoop]: 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] [2022-11-21 16:47:50,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 16:47:50,332 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:47:50,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:47:50,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1804436563, now seen corresponding path program 1 times [2022-11-21 16:47:50,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:47:50,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177465700] [2022-11-21 16:47:50,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:47:50,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:47:50,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:50,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:47:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:50,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-21 16:47:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:50,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-21 16:47:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:50,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-21 16:47:50,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:50,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 16:47:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:50,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:47:50,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:50,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 16:47:50,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:50,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-21 16:47:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:50,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-21 16:47:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:50,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-21 16:47:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:50,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:47:50,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:50,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-21 16:47:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:50,694 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-21 16:47:50,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:47:50,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177465700] [2022-11-21 16:47:50,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177465700] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:47:50,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007304002] [2022-11-21 16:47:50,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:47:50,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:47:50,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094c5e8a-dcc6-4cae-863b-93e697bee2df/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:47:50,702 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094c5e8a-dcc6-4cae-863b-93e697bee2df/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:47:50,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094c5e8a-dcc6-4cae-863b-93e697bee2df/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 16:47:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:51,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 1059 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-21 16:47:51,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:47:51,151 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-21 16:47:51,151 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:47:51,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007304002] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:47:51,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:47:51,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2022-11-21 16:47:51,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484892133] [2022-11-21 16:47:51,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:47:51,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:47:51,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:47:51,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:47:51,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-21 16:47:51,154 INFO L87 Difference]: Start difference. First operand 6570 states and 8997 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) [2022-11-21 16:47:51,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:47:51,722 INFO L93 Difference]: Finished difference Result 13228 states and 18133 transitions. [2022-11-21 16:47:51,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:47:51,723 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 [2022-11-21 16:47:51,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:47:51,753 INFO L225 Difference]: With dead ends: 13228 [2022-11-21 16:47:51,753 INFO L226 Difference]: Without dead ends: 6552 [2022-11-21 16:47:51,767 INFO L412 NwaCegarLoop]: 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 [2022-11-21 16:47:51,768 INFO L413 NwaCegarLoop]: 444 mSDtfsCounter, 6 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1751 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 [2022-11-21 16:47:51,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1751 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:47:51,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6552 states. [2022-11-21 16:47:52,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6552 to 6552. [2022-11-21 16:47:52,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6552 states, 5105 states have (on average 1.3860920666013712) internal successors, (7076), 5290 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) [2022-11-21 16:47:52,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6552 states to 6552 states and 8952 transitions. [2022-11-21 16:47:52,364 INFO L78 Accepts]: Start accepts. Automaton has 6552 states and 8952 transitions. Word has length 127 [2022-11-21 16:47:52,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:47:52,365 INFO L495 AbstractCegarLoop]: Abstraction has 6552 states and 8952 transitions. [2022-11-21 16:47:52,365 INFO L496 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) [2022-11-21 16:47:52,365 INFO L276 IsEmpty]: Start isEmpty. Operand 6552 states and 8952 transitions. [2022-11-21 16:47:52,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-11-21 16:47:52,372 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:47:52,372 INFO L195 NwaCegarLoop]: 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] [2022-11-21 16:47:52,395 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094c5e8a-dcc6-4cae-863b-93e697bee2df/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 16:47:52,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094c5e8a-dcc6-4cae-863b-93e697bee2df/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-21 16:47:52,589 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:47:52,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:47:52,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1348555176, now seen corresponding path program 1 times [2022-11-21 16:47:52,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:47:52,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18433666] [2022-11-21 16:47:52,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:47:52,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:47:52,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:52,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:47:52,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:52,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-21 16:47:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:52,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-21 16:47:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:52,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-21 16:47:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:52,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 16:47:52,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:52,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:47:52,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:52,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 16:47:52,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:52,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-21 16:47:52,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:52,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-21 16:47:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:52,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-21 16:47:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:52,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:47:52,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:52,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-21 16:47:52,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:52,857 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-21 16:47:52,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:47:52,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18433666] [2022-11-21 16:47:52,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18433666] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:47:52,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:47:52,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 16:47:52,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681539517] [2022-11-21 16:47:52,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:47:52,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:47:52,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:47:52,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:47:52,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:47:52,860 INFO L87 Difference]: Start difference. First operand 6552 states and 8952 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) [2022-11-21 16:47:54,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:47:54,567 INFO L93 Difference]: Finished difference Result 13718 states and 18806 transitions. [2022-11-21 16:47:54,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 16:47:54,568 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 [2022-11-21 16:47:54,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:47:54,602 INFO L225 Difference]: With dead ends: 13718 [2022-11-21 16:47:54,603 INFO L226 Difference]: Without dead ends: 7186 [2022-11-21 16:47:54,618 INFO L412 NwaCegarLoop]: 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 [2022-11-21 16:47:54,619 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 887 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 403 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 403 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-21 16:47:54,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 845 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [403 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-21 16:47:54,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7186 states. [2022-11-21 16:47:55,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7186 to 6516. [2022-11-21 16:47:55,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6516 states, 5069 states have (on average 1.3817320970605642) internal successors, (7004), 5254 states have internal predecessors, (7004), 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) [2022-11-21 16:47:55,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6516 states to 6516 states and 8880 transitions. [2022-11-21 16:47:55,384 INFO L78 Accepts]: Start accepts. Automaton has 6516 states and 8880 transitions. Word has length 129 [2022-11-21 16:47:55,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:47:55,385 INFO L495 AbstractCegarLoop]: Abstraction has 6516 states and 8880 transitions. [2022-11-21 16:47:55,385 INFO L496 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) [2022-11-21 16:47:55,386 INFO L276 IsEmpty]: Start isEmpty. Operand 6516 states and 8880 transitions. [2022-11-21 16:47:55,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-11-21 16:47:55,393 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:47:55,393 INFO L195 NwaCegarLoop]: 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] [2022-11-21 16:47:55,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 16:47:55,393 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:47:55,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:47:55,394 INFO L85 PathProgramCache]: Analyzing trace with hash 950003805, now seen corresponding path program 1 times [2022-11-21 16:47:55,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:47:55,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525666568] [2022-11-21 16:47:55,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:47:55,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:47:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:55,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:47:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:55,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-21 16:47:55,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:55,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-21 16:47:55,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:55,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-21 16:47:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:55,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 16:47:55,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:55,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:47:55,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:55,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 16:47:55,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:55,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-21 16:47:55,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:55,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-21 16:47:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:55,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-21 16:47:55,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:55,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:47:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:55,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-21 16:47:55,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:55,682 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-21 16:47:55,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:47:55,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525666568] [2022-11-21 16:47:55,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525666568] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:47:55,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161590081] [2022-11-21 16:47:55,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:47:55,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:47:55,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094c5e8a-dcc6-4cae-863b-93e697bee2df/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:47:55,687 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094c5e8a-dcc6-4cae-863b-93e697bee2df/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:47:55,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094c5e8a-dcc6-4cae-863b-93e697bee2df/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 16:47:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:56,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 1071 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 16:47:56,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:47:56,226 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-21 16:47:56,226 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:47:56,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161590081] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:47:56,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:47:56,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 10 [2022-11-21 16:47:56,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765170673] [2022-11-21 16:47:56,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:47:56,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:47:56,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:47:56,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:47:56,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:47:56,228 INFO L87 Difference]: Start difference. First operand 6516 states and 8880 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) [2022-11-21 16:47:57,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:47:57,705 INFO L93 Difference]: Finished difference Result 19487 states and 26569 transitions. [2022-11-21 16:47:57,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:47:57,705 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 [2022-11-21 16:47:57,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:47:57,776 INFO L225 Difference]: With dead ends: 19487 [2022-11-21 16:47:57,777 INFO L226 Difference]: Without dead ends: 19460 [2022-11-21 16:47:57,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:47:57,785 INFO L413 NwaCegarLoop]: 838 mSDtfsCounter, 766 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 1642 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:47:57,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 1642 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:47:57,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19460 states. [2022-11-21 16:47:59,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19460 to 19310. [2022-11-21 16:47:59,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19310 states, 15003 states have (on average 1.3859228154369125) internal successors, (20793), 15558 states have internal predecessors, (20793), 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) [2022-11-21 16:47:59,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19310 states to 19310 states and 26383 transitions. [2022-11-21 16:47:59,607 INFO L78 Accepts]: Start accepts. Automaton has 19310 states and 26383 transitions. Word has length 130 [2022-11-21 16:47:59,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:47:59,609 INFO L495 AbstractCegarLoop]: Abstraction has 19310 states and 26383 transitions. [2022-11-21 16:47:59,610 INFO L496 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) [2022-11-21 16:47:59,610 INFO L276 IsEmpty]: Start isEmpty. Operand 19310 states and 26383 transitions. [2022-11-21 16:47:59,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-21 16:47:59,635 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:47:59,635 INFO L195 NwaCegarLoop]: 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] [2022-11-21 16:47:59,651 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094c5e8a-dcc6-4cae-863b-93e697bee2df/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 16:47:59,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094c5e8a-dcc6-4cae-863b-93e697bee2df/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:47:59,843 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:47:59,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:47:59,844 INFO L85 PathProgramCache]: Analyzing trace with hash 695562037, now seen corresponding path program 1 times [2022-11-21 16:47:59,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:47:59,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673657428] [2022-11-21 16:47:59,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:47:59,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:47:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:00,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:48:00,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:00,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-21 16:48:00,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:00,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-21 16:48:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:00,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-21 16:48:00,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:00,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 16:48:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:00,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:00,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 16:48:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:00,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-21 16:48:00,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:00,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-21 16:48:00,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:00,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-21 16:48:00,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:00,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:00,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:00,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-21 16:48:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:00,151 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-21 16:48:00,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:48:00,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673657428] [2022-11-21 16:48:00,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673657428] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:48:00,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:48:00,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 16:48:00,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999873355] [2022-11-21 16:48:00,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:48:00,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:48:00,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:48:00,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:48:00,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:48:00,155 INFO L87 Difference]: Start difference. First operand 19310 states and 26383 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) [2022-11-21 16:48:01,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:48:01,996 INFO L93 Difference]: Finished difference Result 25888 states and 35558 transitions. [2022-11-21 16:48:01,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 16:48:01,996 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 [2022-11-21 16:48:01,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:48:02,016 INFO L225 Difference]: With dead ends: 25888 [2022-11-21 16:48:02,017 INFO L226 Difference]: Without dead ends: 6411 [2022-11-21 16:48:02,051 INFO L412 NwaCegarLoop]: 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 [2022-11-21 16:48:02,052 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 720 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 375 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 375 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:48:02,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 1163 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [375 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-21 16:48:02,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6411 states. [2022-11-21 16:48:02,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6411 to 6290. [2022-11-21 16:48:02,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6290 states, 5034 states have (on average 1.4040524433849821) internal successors, (7068), 5157 states have internal predecessors, (7068), 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) [2022-11-21 16:48:02,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6290 states to 6290 states and 8653 transitions. [2022-11-21 16:48:02,416 INFO L78 Accepts]: Start accepts. Automaton has 6290 states and 8653 transitions. Word has length 135 [2022-11-21 16:48:02,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:48:02,417 INFO L495 AbstractCegarLoop]: Abstraction has 6290 states and 8653 transitions. [2022-11-21 16:48:02,417 INFO L496 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) [2022-11-21 16:48:02,417 INFO L276 IsEmpty]: Start isEmpty. Operand 6290 states and 8653 transitions. [2022-11-21 16:48:02,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-11-21 16:48:02,432 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:48:02,432 INFO L195 NwaCegarLoop]: 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] [2022-11-21 16:48:02,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-21 16:48:02,433 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:48:02,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:48:02,433 INFO L85 PathProgramCache]: Analyzing trace with hash 151035555, now seen corresponding path program 1 times [2022-11-21 16:48:02,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:48:02,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002114504] [2022-11-21 16:48:02,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:48:02,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:48:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:02,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:48:02,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:02,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-21 16:48:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:02,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-21 16:48:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:02,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-21 16:48:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:02,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 16:48:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:02,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:02,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 16:48:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:02,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-21 16:48:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:02,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-21 16:48:02,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:02,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-21 16:48:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:02,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:02,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:02,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-21 16:48:02,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:02,712 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-21 16:48:02,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:48:02,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002114504] [2022-11-21 16:48:02,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002114504] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:48:02,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:48:02,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 16:48:02,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471505226] [2022-11-21 16:48:02,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:48:02,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:48:02,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:48:02,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:48:02,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:48:02,714 INFO L87 Difference]: Start difference. First operand 6290 states and 8653 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) [2022-11-21 16:48:04,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:48:04,274 INFO L93 Difference]: Finished difference Result 16378 states and 23321 transitions. [2022-11-21 16:48:04,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 16:48:04,274 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 [2022-11-21 16:48:04,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:48:04,305 INFO L225 Difference]: With dead ends: 16378 [2022-11-21 16:48:04,305 INFO L226 Difference]: Without dead ends: 10108 [2022-11-21 16:48:04,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:48:04,314 INFO L413 NwaCegarLoop]: 330 mSDtfsCounter, 844 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 513 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 513 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-21 16:48:04,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 1024 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [513 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-21 16:48:04,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10108 states. [2022-11-21 16:48:04,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10108 to 6293. [2022-11-21 16:48:04,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6293 states, 5037 states have (on average 1.40381179273377) internal successors, (7071), 5160 states have internal predecessors, (7071), 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) [2022-11-21 16:48:04,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6293 states to 6293 states and 8656 transitions. [2022-11-21 16:48:04,815 INFO L78 Accepts]: Start accepts. Automaton has 6293 states and 8656 transitions. Word has length 139 [2022-11-21 16:48:04,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:48:04,816 INFO L495 AbstractCegarLoop]: Abstraction has 6293 states and 8656 transitions. [2022-11-21 16:48:04,816 INFO L496 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) [2022-11-21 16:48:04,816 INFO L276 IsEmpty]: Start isEmpty. Operand 6293 states and 8656 transitions. [2022-11-21 16:48:04,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-11-21 16:48:04,831 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:48:04,831 INFO L195 NwaCegarLoop]: 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] [2022-11-21 16:48:04,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-21 16:48:04,832 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:48:04,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:48:04,832 INFO L85 PathProgramCache]: Analyzing trace with hash -679502686, now seen corresponding path program 1 times [2022-11-21 16:48:04,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:48:04,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180260784] [2022-11-21 16:48:04,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:48:04,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:48:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:05,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:48:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:05,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-21 16:48:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:05,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-21 16:48:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:05,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-21 16:48:05,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:05,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-21 16:48:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:05,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:05,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 16:48:05,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:05,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-21 16:48:05,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:05,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 16:48:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:05,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-21 16:48:05,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:05,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:05,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-21 16:48:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:05,355 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-21 16:48:05,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:48:05,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180260784] [2022-11-21 16:48:05,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180260784] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:48:05,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:48:05,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 16:48:05,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768293807] [2022-11-21 16:48:05,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:48:05,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 16:48:05,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:48:05,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 16:48:05,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:48:05,358 INFO L87 Difference]: Start difference. First operand 6293 states and 8656 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) [2022-11-21 16:48:06,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:48:06,396 INFO L93 Difference]: Finished difference Result 6956 states and 9519 transitions. [2022-11-21 16:48:06,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:48:06,397 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 [2022-11-21 16:48:06,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:48:06,398 INFO L225 Difference]: With dead ends: 6956 [2022-11-21 16:48:06,398 INFO L226 Difference]: Without dead ends: 0 [2022-11-21 16:48:06,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-11-21 16:48:06,408 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 594 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-21 16:48:06,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 524 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-21 16:48:06,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-21 16:48:06,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-21 16:48:06,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:48:06,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-21 16:48:06,410 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 141 [2022-11-21 16:48:06,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:48:06,410 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-21 16:48:06,411 INFO L496 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) [2022-11-21 16:48:06,411 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-21 16:48:06,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-21 16:48:06,414 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-21 16:48:06,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-21 16:48:06,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-21 16:49:24,845 WARN L233 SmtUtils]: Spent 7.07s on a formula simplification. DAG size of input: 80 DAG size of output: 78 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-21 16:49:31,712 WARN L233 SmtUtils]: Spent 6.86s on a formula simplification. DAG size of input: 80 DAG size of output: 78 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-21 16:49:38,332 WARN L233 SmtUtils]: Spent 6.62s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-21 16:49:44,791 WARN L233 SmtUtils]: Spent 6.46s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-21 16:49:52,265 WARN L233 SmtUtils]: Spent 7.46s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-21 16:49:58,766 WARN L233 SmtUtils]: Spent 6.50s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-21 16:51:57,987 WARN L233 SmtUtils]: Spent 6.59s on a formula simplification. DAG size of input: 80 DAG size of output: 78 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-21 16:52:04,545 WARN L233 SmtUtils]: Spent 6.55s on a formula simplification. DAG size of input: 80 DAG size of output: 78 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-21 16:52:11,005 WARN L233 SmtUtils]: Spent 6.46s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-21 16:52:17,531 WARN L233 SmtUtils]: Spent 6.52s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-21 16:52:23,999 WARN L233 SmtUtils]: Spent 6.46s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-21 16:52:30,508 WARN L233 SmtUtils]: Spent 6.50s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-21 16:54:10,192 WARN L233 SmtUtils]: Spent 6.57s on a formula simplification. DAG size of input: 80 DAG size of output: 78 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-21 16:54:16,879 WARN L233 SmtUtils]: Spent 6.68s on a formula simplification. DAG size of input: 80 DAG size of output: 78 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-21 16:54:23,398 WARN L233 SmtUtils]: Spent 6.52s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-21 16:54:29,879 WARN L233 SmtUtils]: Spent 6.48s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-21 16:54:36,437 WARN L233 SmtUtils]: Spent 6.55s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-21 16:54:42,869 WARN L233 SmtUtils]: Spent 6.43s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-21 16:55:35,601 WARN L233 SmtUtils]: Spent 6.57s on a formula simplification. DAG size of input: 80 DAG size of output: 78 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-21 16:55:42,136 WARN L233 SmtUtils]: Spent 6.53s on a formula simplification. DAG size of input: 80 DAG size of output: 78 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-21 16:55:48,743 WARN L233 SmtUtils]: Spent 6.60s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-21 16:55:55,275 WARN L233 SmtUtils]: Spent 6.53s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-21 16:56:01,826 WARN L233 SmtUtils]: Spent 6.54s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-21 16:56:08,387 WARN L233 SmtUtils]: Spent 6.56s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-21 16:56:14,929 WARN L233 SmtUtils]: Spent 6.52s on a formula simplification. DAG size of input: 80 DAG size of output: 78 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-21 16:56:21,495 WARN L233 SmtUtils]: Spent 6.56s on a formula simplification. DAG size of input: 80 DAG size of output: 78 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-21 16:56:27,999 WARN L233 SmtUtils]: Spent 6.50s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-21 16:56:34,530 WARN L233 SmtUtils]: Spent 6.53s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-21 16:56:41,018 WARN L233 SmtUtils]: Spent 6.48s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-21 16:56:47,525 WARN L233 SmtUtils]: Spent 6.50s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-21 16:56:55,628 INFO L899 garLoopResultBuilder]: For program point _torture_stop_kthreadEXIT(lines 2972 2974) no Hoare annotation was computed. [2022-11-21 16:56:55,629 INFO L899 garLoopResultBuilder]: For program point _torture_stop_kthreadFINAL(lines 2972 2974) no Hoare annotation was computed. [2022-11-21 16:56:55,629 INFO L902 garLoopResultBuilder]: At program point _torture_stop_kthreadENTRY(lines 2972 2974) the Hoare annotation is: true [2022-11-21 16:56:55,629 INFO L899 garLoopResultBuilder]: For program point kfreeEXIT(lines 3078 3080) no Hoare annotation was computed. [2022-11-21 16:56:55,630 INFO L895 garLoopResultBuilder]: At program point kfreeENTRY(lines 3078 3080) the Hoare annotation is: (= |old(#valid)| |#valid|) [2022-11-21 16:56:55,630 INFO L899 garLoopResultBuilder]: For program point kfreeFINAL(lines 3078 3080) no Hoare annotation was computed. [2022-11-21 16:56:55,630 INFO L899 garLoopResultBuilder]: For program point torture_lock_busted_write_delayEXIT(lines 2087 2112) no Hoare annotation was computed. [2022-11-21 16:56:55,630 INFO L902 garLoopResultBuilder]: At program point torture_lock_busted_write_delayENTRY(lines 2087 2112) the Hoare annotation is: true [2022-11-21 16:56:55,630 INFO L899 garLoopResultBuilder]: For program point L2104(lines 2104 2107) no Hoare annotation was computed. [2022-11-21 16:56:55,630 INFO L902 garLoopResultBuilder]: At program point L2105(lines 2096 2108) the Hoare annotation is: true [2022-11-21 16:56:55,631 INFO L902 garLoopResultBuilder]: At program point L2100(lines 2096 2108) the Hoare annotation is: true [2022-11-21 16:56:55,631 INFO L899 garLoopResultBuilder]: For program point L2096(lines 2096 2109) no Hoare annotation was computed. [2022-11-21 16:56:55,631 INFO L899 garLoopResultBuilder]: For program point L2095-1(line 2095) no Hoare annotation was computed. [2022-11-21 16:56:55,631 INFO L899 garLoopResultBuilder]: For program point L2096-2(lines 2087 2112) no Hoare annotation was computed. [2022-11-21 16:56:55,631 INFO L902 garLoopResultBuilder]: At program point L2095(line 2095) the Hoare annotation is: true [2022-11-21 16:56:55,632 INFO L899 garLoopResultBuilder]: For program point L2865-1(line 2865) no Hoare annotation was computed. [2022-11-21 16:56:55,632 INFO L899 garLoopResultBuilder]: For program point torture_lock_spin_write_unlock_irqEXIT(lines 2182 2188) no Hoare annotation was computed. [2022-11-21 16:56:55,632 INFO L895 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))) [2022-11-21 16:56:55,632 INFO L895 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))) [2022-11-21 16:56:55,633 INFO L895 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))) [2022-11-21 16:56:55,633 INFO L899 garLoopResultBuilder]: For program point torture_lock_spin_write_unlock_irqFINAL(lines 2182 2188) no Hoare annotation was computed. [2022-11-21 16:56:55,633 INFO L895 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))) [2022-11-21 16:56:55,633 INFO L895 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))) [2022-11-21 16:56:55,634 INFO L899 garLoopResultBuilder]: For program point __const_udelayFINAL(lines 2953 2955) no Hoare annotation was computed. [2022-11-21 16:56:55,634 INFO L899 garLoopResultBuilder]: For program point __const_udelayEXIT(lines 2953 2955) no Hoare annotation was computed. [2022-11-21 16:56:55,634 INFO L902 garLoopResultBuilder]: At program point __const_udelayENTRY(lines 2953 2955) the Hoare annotation is: true [2022-11-21 16:56:55,634 INFO L899 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 2009 2015) no Hoare annotation was computed. [2022-11-21 16:56:55,634 INFO L902 garLoopResultBuilder]: At program point ldv_errorENTRY(lines 2009 2015) the Hoare annotation is: true [2022-11-21 16:56:55,635 INFO L899 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2013) no Hoare annotation was computed. [2022-11-21 16:56:55,635 INFO L899 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 2009 2015) no Hoare annotation was computed. [2022-11-21 16:56:55,635 INFO L899 garLoopResultBuilder]: For program point torture_lock_busted_write_lockFINAL(lines 2081 2086) no Hoare annotation was computed. [2022-11-21 16:56:55,635 INFO L902 garLoopResultBuilder]: At program point torture_lock_busted_write_lockENTRY(lines 2081 2086) the Hoare annotation is: true [2022-11-21 16:56:55,635 INFO L899 garLoopResultBuilder]: For program point torture_lock_busted_write_lockEXIT(lines 2081 2086) no Hoare annotation was computed. [2022-11-21 16:56:55,636 INFO L895 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|))) [2022-11-21 16:56:55,636 INFO L895 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|))) [2022-11-21 16:56:55,636 INFO L899 garLoopResultBuilder]: For program point L1937-1(line 1937) no Hoare annotation was computed. [2022-11-21 16:56:55,636 INFO L902 garLoopResultBuilder]: At program point L1937-2(lines 1935 1938) the Hoare annotation is: true [2022-11-21 16:56:55,636 INFO L895 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|))) [2022-11-21 16:56:55,637 INFO L902 garLoopResultBuilder]: At program point L1945(lines 1940 1947) the Hoare annotation is: true [2022-11-21 16:56:55,637 INFO L899 garLoopResultBuilder]: For program point kmallocFINAL(lines 2871 2878) no Hoare annotation was computed. [2022-11-21 16:56:55,637 INFO L899 garLoopResultBuilder]: For program point L2874-1(line 2874) no Hoare annotation was computed. [2022-11-21 16:56:55,637 INFO L899 garLoopResultBuilder]: For program point kmallocEXIT(lines 2871 2878) no Hoare annotation was computed. [2022-11-21 16:56:55,637 INFO L899 garLoopResultBuilder]: For program point torture_randomEXIT(lines 3056 3058) no Hoare annotation was computed. [2022-11-21 16:56:55,637 INFO L902 garLoopResultBuilder]: At program point torture_randomENTRY(lines 3056 3058) the Hoare annotation is: true [2022-11-21 16:56:55,638 INFO L899 garLoopResultBuilder]: For program point torture_randomFINAL(lines 3056 3058) no Hoare annotation was computed. [2022-11-21 16:56:55,638 INFO L899 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 2016 2022) no Hoare annotation was computed. [2022-11-21 16:56:55,638 INFO L902 garLoopResultBuilder]: At program point ldv_stopENTRY(lines 2016 2022) the Hoare annotation is: true [2022-11-21 16:56:55,638 INFO L895 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|))) [2022-11-21 16:56:55,638 INFO L899 garLoopResultBuilder]: For program point lock_torture_stats_printFINAL(lines 2314 2333) no Hoare annotation was computed. [2022-11-21 16:56:55,639 INFO L902 garLoopResultBuilder]: At program point L2298(lines 2274 2312) the Hoare annotation is: true [2022-11-21 16:56:55,639 INFO L902 garLoopResultBuilder]: At program point L2296(lines 2274 2312) the Hoare annotation is: true [2022-11-21 16:56:55,639 INFO L899 garLoopResultBuilder]: For program point L2323(lines 2323 2327) no Hoare annotation was computed. [2022-11-21 16:56:55,639 INFO L899 garLoopResultBuilder]: For program point L2321-1(line 2321) no Hoare annotation was computed. [2022-11-21 16:56:55,639 INFO L895 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|))) [2022-11-21 16:56:55,639 INFO L899 garLoopResultBuilder]: For program point L2282(lines 2282 2285) no Hoare annotation was computed. [2022-11-21 16:56:55,640 INFO L899 garLoopResultBuilder]: For program point L2282-2(lines 2282 2285) no Hoare annotation was computed. [2022-11-21 16:56:55,640 INFO L899 garLoopResultBuilder]: For program point L2307(lines 2307 2310) no Hoare annotation was computed. [2022-11-21 16:56:55,640 INFO L902 garLoopResultBuilder]: At program point L2307-2(lines 2265 2313) the Hoare annotation is: true [2022-11-21 16:56:55,640 INFO L899 garLoopResultBuilder]: For program point lock_torture_stats_printEXIT(lines 2314 2333) no Hoare annotation was computed. [2022-11-21 16:56:55,640 INFO L902 garLoopResultBuilder]: At program point L2330(line 2330) the Hoare annotation is: true [2022-11-21 16:56:55,641 INFO L899 garLoopResultBuilder]: For program point L2291(lines 2291 2294) no Hoare annotation was computed. [2022-11-21 16:56:55,641 INFO L899 garLoopResultBuilder]: For program point L2291-2(lines 2291 2294) no Hoare annotation was computed. [2022-11-21 16:56:55,641 INFO L902 garLoopResultBuilder]: At program point L1903(lines 1899 1905) the Hoare annotation is: true [2022-11-21 16:56:55,641 INFO L899 garLoopResultBuilder]: For program point L2287(lines 2287 2290) no Hoare annotation was computed. [2022-11-21 16:56:55,641 INFO L899 garLoopResultBuilder]: For program point L2287-2(lines 2287 2290) no Hoare annotation was computed. [2022-11-21 16:56:55,641 INFO L902 garLoopResultBuilder]: At program point torture_lock_busted_write_unlockFINAL(lines 2113 2118) the Hoare annotation is: true [2022-11-21 16:56:55,642 INFO L899 garLoopResultBuilder]: For program point torture_lock_busted_write_unlockEXIT(lines 2113 2118) no Hoare annotation was computed. [2022-11-21 16:56:55,642 INFO L899 garLoopResultBuilder]: For program point lock_torture_print_module_parmsEXIT(lines 2361 2370) no Hoare annotation was computed. [2022-11-21 16:56:55,642 INFO L902 garLoopResultBuilder]: At program point lock_torture_print_module_parmsENTRY(lines 2361 2370) the Hoare annotation is: true [2022-11-21 16:56:55,642 INFO L899 garLoopResultBuilder]: For program point lock_torture_print_module_parmsFINAL(lines 2361 2370) no Hoare annotation was computed. [2022-11-21 16:56:55,642 INFO L899 garLoopResultBuilder]: For program point L2141-1(line 2141) no Hoare annotation was computed. [2022-11-21 16:56:55,642 INFO L902 garLoopResultBuilder]: At program point L2141(line 2141) the Hoare annotation is: true [2022-11-21 16:56:55,642 INFO L899 garLoopResultBuilder]: For program point torture_spin_lock_write_delayEXIT(lines 2130 2163) no Hoare annotation was computed. [2022-11-21 16:56:55,643 INFO L899 garLoopResultBuilder]: For program point L2156(line 2156) no Hoare annotation was computed. [2022-11-21 16:56:55,643 INFO L902 garLoopResultBuilder]: At program point L2957(lines 2956 2958) the Hoare annotation is: true [2022-11-21 16:56:55,643 INFO L899 garLoopResultBuilder]: For program point L2150(lines 2150 2153) no Hoare annotation was computed. [2022-11-21 16:56:55,643 INFO L902 garLoopResultBuilder]: At program point torture_spin_lock_write_delayENTRY(lines 2130 2163) the Hoare annotation is: true [2022-11-21 16:56:55,643 INFO L902 garLoopResultBuilder]: At program point L2146(lines 2142 2154) the Hoare annotation is: true [2022-11-21 16:56:55,643 INFO L899 garLoopResultBuilder]: For program point L2142(lines 2142 2155) no Hoare annotation was computed. [2022-11-21 16:56:55,644 INFO L902 garLoopResultBuilder]: At program point L2142-2(lines 2142 2155) the Hoare annotation is: true [2022-11-21 16:56:55,644 INFO L899 garLoopResultBuilder]: For program point L2157(lines 2157 2160) no Hoare annotation was computed. [2022-11-21 16:56:55,644 INFO L899 garLoopResultBuilder]: For program point L2157-2(lines 2130 2163) no Hoare annotation was computed. [2022-11-21 16:56:55,644 INFO L902 garLoopResultBuilder]: At program point L2151(lines 2142 2154) the Hoare annotation is: true [2022-11-21 16:56:55,644 INFO L899 garLoopResultBuilder]: For program point L2401(lines 2401 2410) no Hoare annotation was computed. [2022-11-21 16:56:55,644 INFO L899 garLoopResultBuilder]: For program point L2399(line 2399) no Hoare annotation was computed. [2022-11-21 16:56:55,645 INFO L895 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|))))) [2022-11-21 16:56:55,645 INFO L895 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|))))) [2022-11-21 16:56:55,645 INFO L895 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|))))) [2022-11-21 16:56:55,645 INFO L899 garLoopResultBuilder]: For program point L2387(line 2387) no Hoare annotation was computed. [2022-11-21 16:56:55,646 INFO L899 garLoopResultBuilder]: For program point L2383(lines 2383 2397) no Hoare annotation was computed. [2022-11-21 16:56:55,646 INFO L902 garLoopResultBuilder]: At program point L2383-2(lines 2383 2397) the Hoare annotation is: true [2022-11-21 16:56:55,646 INFO L899 garLoopResultBuilder]: For program point L2379(lines 2379 2382) no Hoare annotation was computed. [2022-11-21 16:56:55,646 INFO L902 garLoopResultBuilder]: At program point L2408(line 2408) the Hoare annotation is: true [2022-11-21 16:56:55,646 INFO L902 garLoopResultBuilder]: At program point L1896(lines 1893 1898) the Hoare annotation is: true [2022-11-21 16:56:55,646 INFO L902 garLoopResultBuilder]: At program point L2406(line 2406) the Hoare annotation is: true [2022-11-21 16:56:55,647 INFO L899 garLoopResultBuilder]: For program point lock_torture_cleanupEXIT(lines 2371 2413) no Hoare annotation was computed. [2022-11-21 16:56:55,647 INFO L899 garLoopResultBuilder]: For program point L2408-1(lines 2371 2413) no Hoare annotation was computed. [2022-11-21 16:56:55,647 INFO L895 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|))))) [2022-11-21 16:56:55,647 INFO L902 garLoopResultBuilder]: At program point L2402(line 2402) the Hoare annotation is: true [2022-11-21 16:56:55,647 INFO L902 garLoopResultBuilder]: At program point L2398(line 2398) the Hoare annotation is: true [2022-11-21 16:56:55,648 INFO L895 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|))))) [2022-11-21 16:56:55,648 INFO L899 garLoopResultBuilder]: For program point L2394-1(line 2394) no Hoare annotation was computed. [2022-11-21 16:56:55,648 INFO L902 garLoopResultBuilder]: At program point L3049(lines 3048 3050) the Hoare annotation is: true [2022-11-21 16:56:55,648 INFO L899 garLoopResultBuilder]: For program point L2405(lines 2405 2409) no Hoare annotation was computed. [2022-11-21 16:56:55,648 INFO L902 garLoopResultBuilder]: At program point torture_init_endFINAL(lines 3037 3039) the Hoare annotation is: true [2022-11-21 16:56:55,648 INFO L899 garLoopResultBuilder]: For program point torture_init_endEXIT(lines 3037 3039) no Hoare annotation was computed. [2022-11-21 16:56:55,649 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 1956 1958) the Hoare annotation is: true [2022-11-21 16:56:55,649 INFO L899 garLoopResultBuilder]: For program point L1957(line 1957) no Hoare annotation was computed. [2022-11-21 16:56:55,649 INFO L899 garLoopResultBuilder]: For program point L1957-2(lines 1956 1958) no Hoare annotation was computed. [2022-11-21 16:56:55,649 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 1956 1958) no Hoare annotation was computed. [2022-11-21 16:56:55,649 INFO L895 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))) [2022-11-21 16:56:55,649 INFO L899 garLoopResultBuilder]: For program point ldv_spin_unlockFINAL(lines 2929 2935) no Hoare annotation was computed. [2022-11-21 16:56:55,650 INFO L899 garLoopResultBuilder]: For program point ldv_spin_unlockEXIT(lines 2929 2935) no Hoare annotation was computed. [2022-11-21 16:56:55,650 INFO L899 garLoopResultBuilder]: For program point ldv_spin_lockEXIT(lines 2922 2928) no Hoare annotation was computed. [2022-11-21 16:56:55,650 INFO L902 garLoopResultBuilder]: At program point ldv_spin_lockENTRY(lines 2922 2928) the Hoare annotation is: true [2022-11-21 16:56:55,650 INFO L899 garLoopResultBuilder]: For program point ldv_spin_lockFINAL(lines 2922 2928) no Hoare annotation was computed. [2022-11-21 16:56:55,650 INFO L899 garLoopResultBuilder]: For program point L2177-1(line 2177) no Hoare annotation was computed. [2022-11-21 16:56:55,650 INFO L902 garLoopResultBuilder]: At program point L2177(line 2177) the Hoare annotation is: true [2022-11-21 16:56:55,651 INFO L899 garLoopResultBuilder]: For program point torture_spin_lock_write_lock_irqEXIT(lines 2173 2181) no Hoare annotation was computed. [2022-11-21 16:56:55,651 INFO L902 garLoopResultBuilder]: At program point torture_spin_lock_write_lock_irqENTRY(lines 2173 2181) the Hoare annotation is: true [2022-11-21 16:56:55,651 INFO L899 garLoopResultBuilder]: For program point torture_spin_lock_write_lock_irqFINAL(lines 2173 2181) no Hoare annotation was computed. [2022-11-21 16:56:55,651 INFO L895 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 1959 1975) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-11-21 16:56:55,651 INFO L899 garLoopResultBuilder]: For program point L1966(lines 1966 1973) no Hoare annotation was computed. [2022-11-21 16:56:55,651 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 1959 1975) no Hoare annotation was computed. [2022-11-21 16:56:55,652 INFO L902 garLoopResultBuilder]: At program point L1971(line 1971) the Hoare annotation is: true [2022-11-21 16:56:55,652 INFO L899 garLoopResultBuilder]: For program point L1971-1(line 1971) no Hoare annotation was computed. [2022-11-21 16:56:55,652 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 1959 1975) no Hoare annotation was computed. [2022-11-21 16:56:55,652 INFO L899 garLoopResultBuilder]: For program point _torture_create_kthreadFINAL(lines 2969 2971) no Hoare annotation was computed. [2022-11-21 16:56:55,652 INFO L902 garLoopResultBuilder]: At program point _torture_create_kthreadENTRY(lines 2969 2971) the Hoare annotation is: true [2022-11-21 16:56:55,652 INFO L899 garLoopResultBuilder]: For program point _torture_create_kthreadEXIT(lines 2969 2971) no Hoare annotation was computed. [2022-11-21 16:56:55,652 INFO L899 garLoopResultBuilder]: For program point L2849-1(line 2849) no Hoare annotation was computed. [2022-11-21 16:56:55,653 INFO L902 garLoopResultBuilder]: At program point L2960(lines 2959 2961) the Hoare annotation is: true [2022-11-21 16:56:55,653 INFO L899 garLoopResultBuilder]: For program point torture_spin_lock_write_lockFINAL(lines 2123 2129) no Hoare annotation was computed. [2022-11-21 16:56:55,653 INFO L902 garLoopResultBuilder]: At program point L2849(line 2849) the Hoare annotation is: true [2022-11-21 16:56:55,653 INFO L902 garLoopResultBuilder]: At program point torture_spin_lock_write_lockENTRY(lines 2123 2129) the Hoare annotation is: true [2022-11-21 16:56:55,653 INFO L902 garLoopResultBuilder]: At program point L1913(lines 1909 1915) the Hoare annotation is: true [2022-11-21 16:56:55,653 INFO L899 garLoopResultBuilder]: For program point torture_spin_lock_write_lockEXIT(lines 2123 2129) no Hoare annotation was computed. [2022-11-21 16:56:55,654 INFO L902 garLoopResultBuilder]: At program point L2851(lines 2846 2853) the Hoare annotation is: true [2022-11-21 16:56:55,654 INFO L895 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))) [2022-11-21 16:56:55,654 INFO L899 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2022-11-21 16:56:55,654 INFO L899 garLoopResultBuilder]: For program point ##fun~~TO~VOIDEXIT(line -1) no Hoare annotation was computed. [2022-11-21 16:56:55,654 INFO L895 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))) [2022-11-21 16:56:55,655 INFO L899 garLoopResultBuilder]: For program point L-1-5(line -1) no Hoare annotation was computed. [2022-11-21 16:56:55,655 INFO L895 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))) [2022-11-21 16:56:55,655 INFO L895 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))) [2022-11-21 16:56:55,656 INFO L895 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))) [2022-11-21 16:56:55,656 INFO L899 garLoopResultBuilder]: For program point L-1-9(line -1) no Hoare annotation was computed. [2022-11-21 16:56:55,656 INFO L899 garLoopResultBuilder]: For program point L1983(lines 1983 1990) no Hoare annotation was computed. [2022-11-21 16:56:55,656 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-21 16:56:55,656 INFO L899 garLoopResultBuilder]: For program point ldv_zallocEXIT(lines 1976 1992) no Hoare annotation was computed. [2022-11-21 16:56:55,656 INFO L895 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))) [2022-11-21 16:56:55,657 INFO L902 garLoopResultBuilder]: At program point L1988(line 1988) the Hoare annotation is: true [2022-11-21 16:56:55,657 INFO L899 garLoopResultBuilder]: For program point ldv_zallocFINAL(lines 1976 1992) no Hoare annotation was computed. [2022-11-21 16:56:55,657 INFO L899 garLoopResultBuilder]: For program point L1988-1(line 1988) no Hoare annotation was computed. [2022-11-21 16:56:55,657 INFO L895 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))) [2022-11-21 16:56:55,657 INFO L899 garLoopResultBuilder]: For program point torture_spin_lock_write_unlockEXIT(lines 2164 2170) no Hoare annotation was computed. [2022-11-21 16:56:55,657 INFO L895 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))) [2022-11-21 16:56:55,658 INFO L899 garLoopResultBuilder]: For program point torture_spin_lock_write_unlockFINAL(lines 2164 2170) no Hoare annotation was computed. [2022-11-21 16:56:55,658 INFO L895 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))) [2022-11-21 16:56:55,658 INFO L899 garLoopResultBuilder]: For program point L2857-1(line 2857) no Hoare annotation was computed. [2022-11-21 16:56:55,658 INFO L895 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))) [2022-11-21 16:56:55,658 INFO L895 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))) [2022-11-21 16:56:55,659 INFO L902 garLoopResultBuilder]: At program point L2843(lines 2596 2845) the Hoare annotation is: true [2022-11-21 16:56:55,659 INFO L899 garLoopResultBuilder]: For program point L2744(lines 2744 2748) no Hoare annotation was computed. [2022-11-21 16:56:55,659 INFO L899 garLoopResultBuilder]: For program point L2744-2(lines 2723 2773) no Hoare annotation was computed. [2022-11-21 16:56:55,659 INFO L895 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)) [2022-11-21 16:56:55,659 INFO L899 garLoopResultBuilder]: For program point L2612-1(line 2612) no Hoare annotation was computed. [2022-11-21 16:56:55,659 INFO L899 garLoopResultBuilder]: For program point L2579(line 2579) no Hoare annotation was computed. [2022-11-21 16:56:55,660 INFO L899 garLoopResultBuilder]: For program point L2778(line 2778) no Hoare annotation was computed. [2022-11-21 16:56:55,660 INFO L899 garLoopResultBuilder]: For program point L2745-1(line 2745) no Hoare annotation was computed. [2022-11-21 16:56:55,660 INFO L895 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)))) [2022-11-21 16:56:55,660 INFO L899 garLoopResultBuilder]: For program point L2779(lines 2779 2834) no Hoare annotation was computed. [2022-11-21 16:56:55,660 INFO L899 garLoopResultBuilder]: For program point L2713(line 2713) no Hoare annotation was computed. [2022-11-21 16:56:55,660 INFO L895 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)) [2022-11-21 16:56:55,661 INFO L899 garLoopResultBuilder]: For program point L2614-1(line 2614) no Hoare annotation was computed. [2022-11-21 16:56:55,661 INFO L899 garLoopResultBuilder]: For program point L2813(line 2813) no Hoare annotation was computed. [2022-11-21 16:56:55,661 INFO L902 garLoopResultBuilder]: At program point L2714(line 2714) the Hoare annotation is: true [2022-11-21 16:56:55,661 INFO L899 garLoopResultBuilder]: For program point L2648(line 2648) no Hoare annotation was computed. [2022-11-21 16:56:55,661 INFO L895 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_~tmp___0~9#1| 0) (<= (+ |ULTIMATE.start_lock_torture_init_~firsterr~0#1| 12) 0) (<= (+ ~nwriters_stress~0 1) 0)) [2022-11-21 16:56:55,662 INFO L895 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) (= |ULTIMATE.start_lock_torture_init_~tmp___0~9#1| 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-11-21 16:56:55,662 INFO L899 garLoopResultBuilder]: For program point L2516-1(lines 2425 2585) no Hoare annotation was computed. [2022-11-21 16:56:55,662 INFO L902 garLoopResultBuilder]: At program point L2979(lines 2978 2980) the Hoare annotation is: true [2022-11-21 16:56:55,662 INFO L899 garLoopResultBuilder]: For program point L2814(lines 2814 2819) no Hoare annotation was computed. [2022-11-21 16:56:55,662 INFO L899 garLoopResultBuilder]: For program point L2781(lines 2781 2831) no Hoare annotation was computed. [2022-11-21 16:56:55,662 INFO L899 garLoopResultBuilder]: For program point L2649(lines 2649 2653) no Hoare annotation was computed. [2022-11-21 16:56:55,662 INFO L899 garLoopResultBuilder]: For program point L2649-2(lines 2628 2678) no Hoare annotation was computed. [2022-11-21 16:56:55,663 INFO L899 garLoopResultBuilder]: For program point L2583(line 2583) no Hoare annotation was computed. [2022-11-21 16:56:55,663 INFO L899 garLoopResultBuilder]: For program point L2484(line 2484) no Hoare annotation was computed. [2022-11-21 16:56:55,663 INFO L895 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) (= |ULTIMATE.start_lock_torture_init_~tmp___0~9#1| 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-11-21 16:56:55,663 INFO L899 garLoopResultBuilder]: For program point L2782(line 2782) no Hoare annotation was computed. [2022-11-21 16:56:55,663 INFO L895 garLoopResultBuilder]: At program point L2650(line 2650) the Hoare annotation is: false [2022-11-21 16:56:55,663 INFO L899 garLoopResultBuilder]: For program point L2683(line 2683) no Hoare annotation was computed. [2022-11-21 16:56:55,664 INFO L895 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))) [2022-11-21 16:56:55,664 INFO L899 garLoopResultBuilder]: For program point L2650-1(line 2650) no Hoare annotation was computed. [2022-11-21 16:56:55,664 INFO L899 garLoopResultBuilder]: For program point L2518(lines 2518 2521) no Hoare annotation was computed. [2022-11-21 16:56:55,664 INFO L895 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) (= |ULTIMATE.start_lock_torture_init_~tmp___0~9#1| 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-11-21 16:56:55,664 INFO L895 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)))) [2022-11-21 16:56:55,665 INFO L899 garLoopResultBuilder]: For program point L2783(lines 2783 2787) no Hoare annotation was computed. [2022-11-21 16:56:55,665 INFO L899 garLoopResultBuilder]: For program point L2684(lines 2684 2718) no Hoare annotation was computed. [2022-11-21 16:56:55,665 INFO L899 garLoopResultBuilder]: For program point L2750-1(line 2750) no Hoare annotation was computed. [2022-11-21 16:56:55,665 INFO L895 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) (= |ULTIMATE.start_lock_torture_init_~tmp___0~9#1| 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-11-21 16:56:55,665 INFO L899 garLoopResultBuilder]: For program point L2486-1(line 2486) no Hoare annotation was computed. [2022-11-21 16:56:55,666 INFO L895 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)) [2022-11-21 16:56:55,666 INFO L899 garLoopResultBuilder]: For program point L2883-1(line 2883) no Hoare annotation was computed. [2022-11-21 16:56:55,666 INFO L895 garLoopResultBuilder]: At program point L2883(line 2883) the Hoare annotation is: false [2022-11-21 16:56:55,666 INFO L895 garLoopResultBuilder]: At program point L2784(line 2784) the Hoare annotation is: false [2022-11-21 16:56:55,666 INFO L899 garLoopResultBuilder]: For program point L2784-1(line 2784) no Hoare annotation was computed. [2022-11-21 16:56:55,666 INFO L895 garLoopResultBuilder]: At program point L2884(lines 2880 2886) the Hoare annotation is: false [2022-11-21 16:56:55,666 INFO L899 garLoopResultBuilder]: For program point L2686(lines 2686 2715) no Hoare annotation was computed. [2022-11-21 16:56:55,667 INFO L899 garLoopResultBuilder]: For program point L2554(lines 2554 2557) no Hoare annotation was computed. [2022-11-21 16:56:55,667 INFO L899 garLoopResultBuilder]: For program point L2488(lines 2488 2496) no Hoare annotation was computed. [2022-11-21 16:56:55,667 INFO L895 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) (= |ULTIMATE.start_lock_torture_init_~tmp___0~9#1| 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-11-21 16:56:55,667 INFO L895 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) (= |ULTIMATE.start_lock_torture_init_~tmp___0~9#1| 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-11-21 16:56:55,667 INFO L899 garLoopResultBuilder]: For program point L2720(line 2720) no Hoare annotation was computed. [2022-11-21 16:56:55,667 INFO L899 garLoopResultBuilder]: For program point L2687(line 2687) no Hoare annotation was computed. [2022-11-21 16:56:55,668 INFO L899 garLoopResultBuilder]: For program point L2489(lines 2489 2492) no Hoare annotation was computed. [2022-11-21 16:56:55,668 INFO L899 garLoopResultBuilder]: For program point L2489-2(lines 2489 2492) no Hoare annotation was computed. [2022-11-21 16:56:55,668 INFO L899 garLoopResultBuilder]: For program point L2688(lines 2688 2693) no Hoare annotation was computed. [2022-11-21 16:56:55,668 INFO L899 garLoopResultBuilder]: For program point L2721(lines 2721 2776) no Hoare annotation was computed. [2022-11-21 16:56:55,668 INFO L899 garLoopResultBuilder]: For program point L2655-1(line 2655) no Hoare annotation was computed. [2022-11-21 16:56:55,668 INFO L895 garLoopResultBuilder]: At program point L2655(line 2655) the Hoare annotation is: false [2022-11-21 16:56:55,668 INFO L895 garLoopResultBuilder]: At program point L2986(lines 2985 2987) the Hoare annotation is: false [2022-11-21 16:56:55,669 INFO L899 garLoopResultBuilder]: For program point L2821(line 2821) no Hoare annotation was computed. [2022-11-21 16:56:55,669 INFO L899 garLoopResultBuilder]: For program point L2755(line 2755) no Hoare annotation was computed. [2022-11-21 16:56:55,669 INFO L899 garLoopResultBuilder]: For program point L2689-1(line 2689) no Hoare annotation was computed. [2022-11-21 16:56:55,669 INFO L895 garLoopResultBuilder]: At program point L2689(line 2689) the Hoare annotation is: (and (= ~ldv_spin~0 0) (<= (+ ~nwriters_stress~0 1) 0)) [2022-11-21 16:56:55,669 INFO L899 garLoopResultBuilder]: For program point L2524-1(lines 2425 2585) no Hoare annotation was computed. [2022-11-21 16:56:55,669 INFO L895 garLoopResultBuilder]: At program point L3053(lines 3052 3054) the Hoare annotation is: false [2022-11-21 16:56:55,670 INFO L899 garLoopResultBuilder]: For program point L2822(lines 2822 2827) no Hoare annotation was computed. [2022-11-21 16:56:55,670 INFO L899 garLoopResultBuilder]: For program point L2756(lines 2756 2761) no Hoare annotation was computed. [2022-11-21 16:56:55,670 INFO L899 garLoopResultBuilder]: For program point L2789(line 2789) no Hoare annotation was computed. [2022-11-21 16:56:55,670 INFO L899 garLoopResultBuilder]: For program point L2723(lines 2723 2773) no Hoare annotation was computed. [2022-11-21 16:56:55,670 INFO L899 garLoopResultBuilder]: For program point L2624(lines 2624 2838) no Hoare annotation was computed. [2022-11-21 16:56:55,670 INFO L899 garLoopResultBuilder]: For program point L2558(lines 2558 2561) no Hoare annotation was computed. [2022-11-21 16:56:55,670 INFO L899 garLoopResultBuilder]: For program point L2790(lines 2790 2794) no Hoare annotation was computed. [2022-11-21 16:56:55,671 INFO L899 garLoopResultBuilder]: For program point L2724(line 2724) no Hoare annotation was computed. [2022-11-21 16:56:55,671 INFO L899 garLoopResultBuilder]: For program point L2790-2(lines 2781 2831) no Hoare annotation was computed. [2022-11-21 16:56:55,671 INFO L899 garLoopResultBuilder]: For program point L2625(line 2625) no Hoare annotation was computed. [2022-11-21 16:56:55,671 INFO L899 garLoopResultBuilder]: For program point L2526(lines 2526 2529) no Hoare annotation was computed. [2022-11-21 16:56:55,671 INFO L899 garLoopResultBuilder]: For program point L2791-1(line 2791) no Hoare annotation was computed. [2022-11-21 16:56:55,671 INFO L895 garLoopResultBuilder]: At program point L2791(line 2791) the Hoare annotation is: false [2022-11-21 16:56:55,671 INFO L899 garLoopResultBuilder]: For program point L2725(lines 2725 2729) no Hoare annotation was computed. [2022-11-21 16:56:55,672 INFO L899 garLoopResultBuilder]: For program point L2626(lines 2626 2681) no Hoare annotation was computed. [2022-11-21 16:56:55,672 INFO L895 garLoopResultBuilder]: At program point L2990(lines 2989 2991) the Hoare annotation is: false [2022-11-21 16:56:55,672 INFO L895 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)))) [2022-11-21 16:56:55,672 INFO L899 garLoopResultBuilder]: For program point L2660(line 2660) no Hoare annotation was computed. [2022-11-21 16:56:55,672 INFO L899 garLoopResultBuilder]: For program point L2726-1(line 2726) no Hoare annotation was computed. [2022-11-21 16:56:55,672 INFO L899 garLoopResultBuilder]: For program point L2628(lines 2628 2678) no Hoare annotation was computed. [2022-11-21 16:56:55,673 INFO L899 garLoopResultBuilder]: For program point L2661(lines 2661 2666) no Hoare annotation was computed. [2022-11-21 16:56:55,673 INFO L899 garLoopResultBuilder]: For program point L2695(line 2695) no Hoare annotation was computed. [2022-11-21 16:56:55,673 INFO L899 garLoopResultBuilder]: For program point L2629(line 2629) no Hoare annotation was computed. [2022-11-21 16:56:55,673 INFO L895 garLoopResultBuilder]: At program point L2563(lines 2425 2585) the Hoare annotation is: false [2022-11-21 16:56:55,673 INFO L895 garLoopResultBuilder]: At program point L2464(lines 2456 2472) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= |ULTIMATE.start_lock_torture_init_~tmp___0~9#1| 0) (<= (+ ~nwriters_stress~0 1) 0)) [2022-11-21 16:56:55,673 INFO L899 garLoopResultBuilder]: For program point L2431(lines 2431 2435) no Hoare annotation was computed. [2022-11-21 16:56:55,674 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-21 16:56:55,674 INFO L899 garLoopResultBuilder]: For program point L2431-2(lines 2425 2585) no Hoare annotation was computed. [2022-11-21 16:56:55,674 INFO L899 garLoopResultBuilder]: For program point L2696(lines 2696 2711) no Hoare annotation was computed. [2022-11-21 16:56:55,674 INFO L899 garLoopResultBuilder]: For program point L2630(lines 2630 2634) no Hoare annotation was computed. [2022-11-21 16:56:55,674 INFO L895 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)))) [2022-11-21 16:56:55,675 INFO L895 garLoopResultBuilder]: At program point L2796(line 2796) the Hoare annotation is: false [2022-11-21 16:56:55,675 INFO L899 garLoopResultBuilder]: For program point L2829(line 2829) no Hoare annotation was computed. [2022-11-21 16:56:55,675 INFO L899 garLoopResultBuilder]: For program point L2763(line 2763) no Hoare annotation was computed. [2022-11-21 16:56:55,675 INFO L899 garLoopResultBuilder]: For program point L2796-1(line 2796) no Hoare annotation was computed. [2022-11-21 16:56:55,675 INFO L899 garLoopResultBuilder]: For program point L2631-1(line 2631) no Hoare annotation was computed. [2022-11-21 16:56:55,675 INFO L895 garLoopResultBuilder]: At program point L2631(line 2631) the Hoare annotation is: false [2022-11-21 16:56:55,676 INFO L895 garLoopResultBuilder]: At program point L2565(lines 2425 2585) the Hoare annotation is: false [2022-11-21 16:56:55,676 INFO L895 garLoopResultBuilder]: At program point L2466(lines 2456 2472) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= |ULTIMATE.start_lock_torture_init_~tmp___0~9#1| 0) (<= (+ ~nwriters_stress~0 1) 0)) [2022-11-21 16:56:55,676 INFO L899 garLoopResultBuilder]: For program point L2532-1(lines 2532 2539) no Hoare annotation was computed. [2022-11-21 16:56:55,676 INFO L895 garLoopResultBuilder]: At program point L3061(lines 3060 3062) the Hoare annotation is: false [2022-11-21 16:56:55,676 INFO L902 garLoopResultBuilder]: At program point L2830(line 2830) the Hoare annotation is: true [2022-11-21 16:56:55,676 INFO L899 garLoopResultBuilder]: For program point L2764(lines 2764 2769) no Hoare annotation was computed. [2022-11-21 16:56:55,676 INFO L899 garLoopResultBuilder]: For program point L2698(lines 2698 2704) no Hoare annotation was computed. [2022-11-21 16:56:55,677 INFO L899 garLoopResultBuilder]: For program point L2731(line 2731) no Hoare annotation was computed. [2022-11-21 16:56:55,677 INFO L899 garLoopResultBuilder]: For program point L2698-2(lines 2696 2710) no Hoare annotation was computed. [2022-11-21 16:56:55,677 INFO L899 garLoopResultBuilder]: For program point L2732(lines 2732 2736) no Hoare annotation was computed. [2022-11-21 16:56:55,677 INFO L899 garLoopResultBuilder]: For program point L2732-2(lines 2723 2773) no Hoare annotation was computed. [2022-11-21 16:56:55,677 INFO L899 garLoopResultBuilder]: For program point L2534(lines 2534 2537) no Hoare annotation was computed. [2022-11-21 16:56:55,677 INFO L899 garLoopResultBuilder]: For program point L2733-1(line 2733) no Hoare annotation was computed. [2022-11-21 16:56:55,678 INFO L895 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)))) [2022-11-21 16:56:55,678 INFO L899 garLoopResultBuilder]: For program point L2568(lines 2568 2578) no Hoare annotation was computed. [2022-11-21 16:56:55,678 INFO L895 garLoopResultBuilder]: At program point L2568-2(lines 2568 2578) the Hoare annotation is: false [2022-11-21 16:56:55,678 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-21 16:56:55,678 INFO L895 garLoopResultBuilder]: At program point L2998(lines 2997 2999) the Hoare annotation is: false [2022-11-21 16:56:55,678 INFO L899 garLoopResultBuilder]: For program point L2668(line 2668) no Hoare annotation was computed. [2022-11-21 16:56:55,679 INFO L899 garLoopResultBuilder]: For program point L2569-1(lines 2569 2572) no Hoare annotation was computed. [2022-11-21 16:56:55,679 INFO L895 garLoopResultBuilder]: At program point L2569(lines 2569 2572) the Hoare annotation is: false [2022-11-21 16:56:55,679 INFO L895 garLoopResultBuilder]: At program point L2470(line 2470) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= |ULTIMATE.start_lock_torture_init_~tmp___0~9#1| 0) (<= (+ ~nwriters_stress~0 1) 0)) [2022-11-21 16:56:55,679 INFO L895 garLoopResultBuilder]: At program point L2503(lines 2425 2585) the Hoare annotation is: false [2022-11-21 16:56:55,679 INFO L899 garLoopResultBuilder]: For program point L2470-1(line 2470) no Hoare annotation was computed. [2022-11-21 16:56:55,679 INFO L899 garLoopResultBuilder]: For program point L2801(line 2801) no Hoare annotation was computed. [2022-11-21 16:56:55,680 INFO L899 garLoopResultBuilder]: For program point L2636(line 2636) no Hoare annotation was computed. [2022-11-21 16:56:55,680 INFO L899 garLoopResultBuilder]: For program point L2669(lines 2669 2674) no Hoare annotation was computed. [2022-11-21 16:56:55,680 INFO L899 garLoopResultBuilder]: For program point L2802(lines 2802 2806) no Hoare annotation was computed. [2022-11-21 16:56:55,680 INFO L899 garLoopResultBuilder]: For program point L2802-2(lines 2781 2831) no Hoare annotation was computed. [2022-11-21 16:56:55,680 INFO L899 garLoopResultBuilder]: For program point L2637(lines 2637 2641) no Hoare annotation was computed. [2022-11-21 16:56:55,680 INFO L899 garLoopResultBuilder]: For program point L2637-2(lines 2628 2678) no Hoare annotation was computed. [2022-11-21 16:56:55,680 INFO L895 garLoopResultBuilder]: At program point L2505(lines 2425 2585) the Hoare annotation is: false [2022-11-21 16:56:55,681 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-21 16:56:55,681 INFO L899 garLoopResultBuilder]: For program point L2836(line 2836) no Hoare annotation was computed. [2022-11-21 16:56:55,681 INFO L899 garLoopResultBuilder]: For program point L2803-1(line 2803) no Hoare annotation was computed. [2022-11-21 16:56:55,681 INFO L895 garLoopResultBuilder]: At program point L2803(line 2803) the Hoare annotation is: false [2022-11-21 16:56:55,681 INFO L895 garLoopResultBuilder]: At program point L2638(line 2638) the Hoare annotation is: false [2022-11-21 16:56:55,681 INFO L899 garLoopResultBuilder]: For program point L2638-1(line 2638) no Hoare annotation was computed. [2022-11-21 16:56:55,682 INFO L895 garLoopResultBuilder]: At program point L3068(lines 3067 3069) the Hoare annotation is: false [2022-11-21 16:56:55,682 INFO L895 garLoopResultBuilder]: At program point L3002(lines 3001 3003) the Hoare annotation is: false [2022-11-21 16:56:55,682 INFO L895 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)) [2022-11-21 16:56:55,682 INFO L902 garLoopResultBuilder]: At program point L2837(line 2837) the Hoare annotation is: true [2022-11-21 16:56:55,682 INFO L895 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)))) [2022-11-21 16:56:55,682 INFO L899 garLoopResultBuilder]: For program point L2771(line 2771) no Hoare annotation was computed. [2022-11-21 16:56:55,683 INFO L899 garLoopResultBuilder]: For program point L2738-1(line 2738) no Hoare annotation was computed. [2022-11-21 16:56:55,683 INFO L899 garLoopResultBuilder]: For program point L2573(lines 2573 2576) no Hoare annotation was computed. [2022-11-21 16:56:55,683 INFO L899 garLoopResultBuilder]: For program point L2474(lines 2474 2477) no Hoare annotation was computed. [2022-11-21 16:56:55,683 INFO L899 garLoopResultBuilder]: For program point L2474-2(lines 2425 2585) no Hoare annotation was computed. [2022-11-21 16:56:55,683 INFO L895 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) (= |ULTIMATE.start_lock_torture_init_~tmp___0~9#1| 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-11-21 16:56:55,683 INFO L902 garLoopResultBuilder]: At program point L2772(line 2772) the Hoare annotation is: true [2022-11-21 16:56:55,684 INFO L895 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_~tmp___0~9#1| 0) (<= (+ |ULTIMATE.start_lock_torture_init_~firsterr~0#1| 12) 0) (<= (+ ~nwriters_stress~0 1) 0)) [2022-11-21 16:56:55,684 INFO L899 garLoopResultBuilder]: For program point L2508(lines 2508 2515) no Hoare annotation was computed. [2022-11-21 16:56:55,684 INFO L899 garLoopResultBuilder]: For program point L2475-1(line 2475) no Hoare annotation was computed. [2022-11-21 16:56:55,684 INFO L899 garLoopResultBuilder]: For program point L2508-2(lines 2425 2585) no Hoare annotation was computed. [2022-11-21 16:56:55,684 INFO L895 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) (= |ULTIMATE.start_lock_torture_init_~tmp___0~9#1| 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-11-21 16:56:55,684 INFO L895 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)))) [2022-11-21 16:56:55,685 INFO L902 garLoopResultBuilder]: At program point L2707(lines 2609 2844) the Hoare annotation is: true [2022-11-21 16:56:55,685 INFO L899 garLoopResultBuilder]: For program point L2542(lines 2542 2550) no Hoare annotation was computed. [2022-11-21 16:56:55,685 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-21 16:56:55,685 INFO L899 garLoopResultBuilder]: For program point L2510(lines 2510 2513) no Hoare annotation was computed. [2022-11-21 16:56:55,685 INFO L899 garLoopResultBuilder]: For program point L2543(lines 2543 2546) no Hoare annotation was computed. [2022-11-21 16:56:55,685 INFO L899 garLoopResultBuilder]: For program point L2543-2(lines 2543 2546) no Hoare annotation was computed. [2022-11-21 16:56:55,686 INFO L895 garLoopResultBuilder]: At program point L3072(lines 3071 3073) the Hoare annotation is: false [2022-11-21 16:56:55,686 INFO L895 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)))) [2022-11-21 16:56:55,686 INFO L895 garLoopResultBuilder]: At program point L2808(line 2808) the Hoare annotation is: false [2022-11-21 16:56:55,686 INFO L899 garLoopResultBuilder]: For program point L2808-1(line 2808) no Hoare annotation was computed. [2022-11-21 16:56:55,686 INFO L899 garLoopResultBuilder]: For program point L2676(line 2676) no Hoare annotation was computed. [2022-11-21 16:56:55,687 INFO L895 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)) [2022-11-21 16:56:55,687 INFO L899 garLoopResultBuilder]: For program point L2643-1(line 2643) no Hoare annotation was computed. [2022-11-21 16:56:55,687 INFO L895 garLoopResultBuilder]: At program point L2643(line 2643) the Hoare annotation is: false [2022-11-21 16:56:55,687 INFO L899 garLoopResultBuilder]: For program point L2610-1(line 2610) no Hoare annotation was computed. [2022-11-21 16:56:55,687 INFO L899 garLoopResultBuilder]: For program point L2445(lines 2445 2448) no Hoare annotation was computed. [2022-11-21 16:56:55,687 INFO L895 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) (= |ULTIMATE.start_lock_torture_init_~tmp___0~9#1| 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-11-21 16:56:55,687 INFO L899 garLoopResultBuilder]: For program point L2743(line 2743) no Hoare annotation was computed. [2022-11-21 16:56:55,688 INFO L902 garLoopResultBuilder]: At program point L2677(line 2677) the Hoare annotation is: true [2022-11-21 16:56:55,688 INFO L895 garLoopResultBuilder]: At program point L2894(line 2894) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (not (<= (+ ~nwriters_stress~0 1) 0))) [2022-11-21 16:56:55,688 INFO L899 garLoopResultBuilder]: For program point ldv_check_alloc_flagsEXIT(lines 2889 2898) no Hoare annotation was computed. [2022-11-21 16:56:55,688 INFO L899 garLoopResultBuilder]: For program point L2892(lines 2892 2895) no Hoare annotation was computed. [2022-11-21 16:56:55,688 INFO L899 garLoopResultBuilder]: For program point L2894-1(lines 2889 2898) no Hoare annotation was computed. [2022-11-21 16:56:55,688 INFO L902 garLoopResultBuilder]: At program point ldv_check_alloc_flagsENTRY(lines 2889 2898) the Hoare annotation is: true [2022-11-21 16:56:55,692 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:56:55,695 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 16:56:55,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 04:56:55 BoogieIcfgContainer [2022-11-21 16:56:55,725 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 16:56:55,725 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 16:56:55,725 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 16:56:55,726 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 16:56:55,726 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:47:33" (3/4) ... [2022-11-21 16:56:55,730 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-21 16:56:55,737 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure _torture_stop_kthread [2022-11-21 16:56:55,737 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2022-11-21 16:56:55,737 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_lock_busted_write_delay [2022-11-21 16:56:55,738 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_lock_spin_write_unlock_irq [2022-11-21 16:56:55,738 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __const_udelay [2022-11-21 16:56:55,738 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2022-11-21 16:56:55,738 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_lock_busted_write_lock [2022-11-21 16:56:55,738 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kmalloc [2022-11-21 16:56:55,738 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_random [2022-11-21 16:56:55,738 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2022-11-21 16:56:55,739 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure lock_torture_stats_print [2022-11-21 16:56:55,739 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_lock_busted_write_unlock [2022-11-21 16:56:55,739 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure lock_torture_print_module_parms [2022-11-21 16:56:55,739 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_delay [2022-11-21 16:56:55,739 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure lock_torture_cleanup [2022-11-21 16:56:55,739 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_init_end [2022-11-21 16:56:55,739 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-11-21 16:56:55,740 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_spin_unlock [2022-11-21 16:56:55,740 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_spin_lock [2022-11-21 16:56:55,740 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_lock_irq [2022-11-21 16:56:55,740 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-11-21 16:56:55,740 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure _torture_create_kthread [2022-11-21 16:56:55,740 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_lock [2022-11-21 16:56:55,740 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~~TO~VOID [2022-11-21 16:56:55,740 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2022-11-21 16:56:55,741 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_unlock [2022-11-21 16:56:55,741 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_check_alloc_flags [2022-11-21 16:56:55,760 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 126 nodes and edges [2022-11-21 16:56:55,761 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 39 nodes and edges [2022-11-21 16:56:55,763 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-11-21 16:56:55,765 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-21 16:56:55,766 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-21 16:56:55,768 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-21 16:56:55,769 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-21 16:56:55,814 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) [2022-11-21 16:56:55,820 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)) [2022-11-21 16:56:55,821 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)) [2022-11-21 16:56:55,822 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)) [2022-11-21 16:56:55,901 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094c5e8a-dcc6-4cae-863b-93e697bee2df/bin/uautomizer-vX5HgA9Q3a/witness.graphml [2022-11-21 16:56:55,902 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 16:56:55,902 INFO L158 Benchmark]: Toolchain (without parser) took 565138.17ms. Allocated memory was 172.0MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 135.3MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 441.3MB. Max. memory is 16.1GB. [2022-11-21 16:56:55,903 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 130.0MB. Free memory was 98.3MB in the beginning and 98.2MB in the end (delta: 69.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:56:55,903 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1000.40ms. Allocated memory is still 172.0MB. Free memory was 135.3MB in the beginning and 103.5MB in the end (delta: 31.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-11-21 16:56:55,904 INFO L158 Benchmark]: Boogie Procedure Inliner took 126.01ms. Allocated memory is still 172.0MB. Free memory was 103.5MB in the beginning and 97.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-21 16:56:55,904 INFO L158 Benchmark]: Boogie Preprocessor took 111.43ms. Allocated memory is still 172.0MB. Free memory was 97.2MB in the beginning and 91.7MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-21 16:56:55,904 INFO L158 Benchmark]: RCFGBuilder took 1371.29ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 91.7MB in the beginning and 137.5MB in the end (delta: -45.8MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. [2022-11-21 16:56:55,905 INFO L158 Benchmark]: TraceAbstraction took 562345.26ms. Allocated memory was 207.6MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 136.4MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2022-11-21 16:56:55,905 INFO L158 Benchmark]: Witness Printer took 176.55ms. Allocated memory is still 2.2GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-21 16:56:55,907 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.25ms. Allocated memory is still 130.0MB. Free memory was 98.3MB in the beginning and 98.2MB in the end (delta: 69.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1000.40ms. Allocated memory is still 172.0MB. Free memory was 135.3MB in the beginning and 103.5MB in the end (delta: 31.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 126.01ms. Allocated memory is still 172.0MB. Free memory was 103.5MB in the beginning and 97.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 111.43ms. Allocated memory is still 172.0MB. Free memory was 97.2MB in the beginning and 91.7MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1371.29ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 91.7MB in the beginning and 137.5MB in the end (delta: -45.8MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. * TraceAbstraction took 562345.26ms. Allocated memory was 207.6MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 136.4MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 176.55ms. Allocated memory is still 2.2GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. 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, 345 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 562.2s, OverallIterations: 15, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 20.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 529.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10428 SdHoareTripleChecker+Valid, 13.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10024 mSDsluCounter, 16836 SdHoareTripleChecker+Invalid, 11.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11443 mSDsCounter, 4301 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9381 IncrementalHoareTripleChecker+Invalid, 13682 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4301 mSolverCounterUnsat, 5393 mSDtfsCounter, 9381 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 650 GetRequests, 525 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19310occurred 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: 6.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 7567 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 139 LocationsWithAnnotation, 22187 PreInvPairs, 23451 NumberOfFragments, 1986 HoareAnnotationTreeSize, 22187 FomulaSimplifications, 5037376 FormulaSimplificationTreeSizeReduction, 521.0s HoareSimplificationTime, 139 FomulaSimplificationsInter, 2451605 FormulaSimplificationTreeSizeReductionInter, 7.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1722 NumberOfCodeBlocks, 1722 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1705 ConstructedInterpolants, 0 QuantifiedInterpolants, 3232 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2130 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 17 InterpolantComputations, 15 PerfectInterpolantSequences, 472/498 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) && tmp___0 == 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) && tmp___0 == 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) && tmp___0 == 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) && tmp___0 == 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) && tmp___0 == 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) && tmp___0 == 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) && tmp___0 == 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 && tmp___0 == 0) && 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 && tmp___0 == 0) && 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! [2022-11-21 16:56:55,956 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094c5e8a-dcc6-4cae-863b-93e697bee2df/bin/uautomizer-vX5HgA9Q3a/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