./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 eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c0e62a2f55ddaeb08563a2d9bb0bfed8d8d740037b0faa92e9ebf8fe89adc120 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 23:59:57,121 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 23:59:57,122 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 23:59:57,148 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 23:59:57,150 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 23:59:57,151 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 23:59:57,155 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 23:59:57,158 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 23:59:57,160 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 23:59:57,163 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 23:59:57,164 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 23:59:57,165 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 23:59:57,165 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 23:59:57,167 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 23:59:57,168 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 23:59:57,170 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 23:59:57,170 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 23:59:57,171 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 23:59:57,174 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 23:59:57,178 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 23:59:57,179 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 23:59:57,180 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 23:59:57,180 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 23:59:57,181 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 23:59:57,182 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 23:59:57,187 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 23:59:57,187 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 23:59:57,187 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 23:59:57,188 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 23:59:57,188 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 23:59:57,189 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 23:59:57,189 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 23:59:57,190 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 23:59:57,191 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 23:59:57,191 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 23:59:57,192 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 23:59:57,192 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 23:59:57,193 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 23:59:57,193 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 23:59:57,193 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 23:59:57,194 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 23:59:57,196 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 23:59:57,197 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-19 23:59:57,219 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 23:59:57,219 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 23:59:57,219 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 23:59:57,220 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 23:59:57,220 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 23:59:57,220 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 23:59:57,221 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 23:59:57,221 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 23:59:57,221 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 23:59:57,222 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 23:59:57,222 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 23:59:57,222 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 23:59:57,222 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 23:59:57,222 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 23:59:57,223 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 23:59:57,223 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 23:59:57,223 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 23:59:57,223 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 23:59:57,223 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 23:59:57,223 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 23:59:57,224 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 23:59:57,224 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 23:59:57,224 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 23:59:57,224 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 23:59:57,224 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 23:59:57,224 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 23:59:57,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 23:59:57,225 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 23:59:57,225 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 23:59:57,225 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 23:59:57,225 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c0e62a2f55ddaeb08563a2d9bb0bfed8d8d740037b0faa92e9ebf8fe89adc120 [2022-07-19 23:59:57,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 23:59:57,459 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 23:59:57,460 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 23:59:57,461 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 23:59:57,461 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 23:59:57,462 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../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-07-19 23:59:57,511 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b47a6532a/0b6f63c074744ca59e0714e6e4816b77/FLAG6efc019d7 [2022-07-19 23:59:58,018 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 23:59:58,019 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/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-07-19 23:59:58,040 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b47a6532a/0b6f63c074744ca59e0714e6e4816b77/FLAG6efc019d7 [2022-07-19 23:59:58,492 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b47a6532a/0b6f63c074744ca59e0714e6e4816b77 [2022-07-19 23:59:58,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 23:59:58,494 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 23:59:58,496 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 23:59:58,496 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 23:59:58,498 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 23:59:58,499 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:59:58" (1/1) ... [2022-07-19 23:59:58,499 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bfe8046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:59:58, skipping insertion in model container [2022-07-19 23:59:58,499 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:59:58" (1/1) ... [2022-07-19 23:59:58,504 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 23:59:58,569 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 23:59:58,800 WARN L1251 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1764] [2022-07-19 23:59:58,801 WARN L1251 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-07-19 23:59:58,877 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.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-07-19 23:59:59,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 23:59:59,082 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 23:59:59,128 WARN L1251 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1764] [2022-07-19 23:59:59,129 WARN L1251 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-07-19 23:59:59,141 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.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-07-19 23:59:59,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 23:59:59,215 INFO L208 MainTranslator]: Completed translation [2022-07-19 23:59:59,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:59:59 WrapperNode [2022-07-19 23:59:59,215 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 23:59:59,216 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 23:59:59,216 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 23:59:59,216 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 23:59:59,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:59:59" (1/1) ... [2022-07-19 23:59:59,239 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:59:59" (1/1) ... [2022-07-19 23:59:59,269 INFO L137 Inliner]: procedures = 114, calls = 288, calls flagged for inlining = 49, calls inlined = 38, statements flattened = 878 [2022-07-19 23:59:59,270 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 23:59:59,271 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 23:59:59,271 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 23:59:59,271 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 23:59:59,276 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:59:59" (1/1) ... [2022-07-19 23:59:59,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:59:59" (1/1) ... [2022-07-19 23:59:59,290 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:59:59" (1/1) ... [2022-07-19 23:59:59,290 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:59:59" (1/1) ... [2022-07-19 23:59:59,308 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:59:59" (1/1) ... [2022-07-19 23:59:59,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:59:59" (1/1) ... [2022-07-19 23:59:59,318 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:59:59" (1/1) ... [2022-07-19 23:59:59,344 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 23:59:59,345 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 23:59:59,345 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 23:59:59,346 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 23:59:59,346 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:59:59" (1/1) ... [2022-07-19 23:59:59,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 23:59:59,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:59:59,376 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 23:59:59,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 23:59:59,409 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_stop_kthread [2022-07-19 23:59:59,409 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_stop_kthread [2022-07-19 23:59:59,409 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_lock [2022-07-19 23:59:59,410 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_lock [2022-07-19 23:59:59,410 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-19 23:59:59,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-19 23:59:59,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 23:59:59,410 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_delay [2022-07-19 23:59:59,411 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_delay [2022-07-19 23:59:59,411 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock [2022-07-19 23:59:59,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock [2022-07-19 23:59:59,411 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-19 23:59:59,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-19 23:59:59,411 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_create_kthread [2022-07-19 23:59:59,411 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_create_kthread [2022-07-19 23:59:59,411 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock [2022-07-19 23:59:59,412 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock [2022-07-19 23:59:59,412 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-19 23:59:59,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-19 23:59:59,412 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-19 23:59:59,412 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-19 23:59:59,412 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_spin_write_unlock_irq [2022-07-19 23:59:59,412 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_spin_write_unlock_irq [2022-07-19 23:59:59,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 23:59:59,413 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-19 23:59:59,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-19 23:59:59,413 INFO L130 BoogieDeclarations]: Found specification of procedure torture_random [2022-07-19 23:59:59,413 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_random [2022-07-19 23:59:59,413 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_cleanup [2022-07-19 23:59:59,413 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_cleanup [2022-07-19 23:59:59,413 INFO L130 BoogieDeclarations]: Found specification of procedure torture_init_end [2022-07-19 23:59:59,413 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_init_end [2022-07-19 23:59:59,414 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-19 23:59:59,414 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-19 23:59:59,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 23:59:59,414 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2022-07-19 23:59:59,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2022-07-19 23:59:59,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 23:59:59,414 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-07-19 23:59:59,414 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-07-19 23:59:59,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 23:59:59,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 23:59:59,415 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_stats_print [2022-07-19 23:59:59,415 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_stats_print [2022-07-19 23:59:59,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 23:59:59,415 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock [2022-07-19 23:59:59,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock [2022-07-19 23:59:59,416 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock_irq [2022-07-19 23:59:59,416 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock_irq [2022-07-19 23:59:59,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 23:59:59,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 23:59:59,417 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_delay [2022-07-19 23:59:59,417 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_delay [2022-07-19 23:59:59,417 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-19 23:59:59,417 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-19 23:59:59,418 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_unlock [2022-07-19 23:59:59,418 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_unlock [2022-07-19 23:59:59,418 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_print_module_parms [2022-07-19 23:59:59,419 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_print_module_parms [2022-07-19 23:59:59,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 23:59:59,419 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-19 23:59:59,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-19 23:59:59,419 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_unlock [2022-07-19 23:59:59,419 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_unlock [2022-07-19 23:59:59,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 23:59:59,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 23:59:59,652 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 23:59:59,653 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 23:59:59,750 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-20 00:00:00,202 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 00:00:00,224 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 00:00:00,225 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-20 00:00:00,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 12:00:00 BoogieIcfgContainer [2022-07-20 00:00:00,227 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 00:00:00,230 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 00:00:00,230 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 00:00:00,232 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 00:00:00,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 11:59:58" (1/3) ... [2022-07-20 00:00:00,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61458741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 12:00:00, skipping insertion in model container [2022-07-20 00:00:00,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:59:59" (2/3) ... [2022-07-20 00:00:00,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61458741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 12:00:00, skipping insertion in model container [2022-07-20 00:00:00,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 12:00:00" (3/3) ... [2022-07-20 00:00:00,235 INFO L111 eAbstractionObserver]: Analyzing ICFG 43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2022-07-20 00:00:00,244 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 00:00:00,244 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 00:00:00,287 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 00:00:00,291 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@39419d22, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3f9b34b6 [2022-07-20 00:00:00,291 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 00:00:00,300 INFO L276 IsEmpty]: Start isEmpty. Operand has 347 states, 258 states have (on average 1.4108527131782946) internal successors, (364), 274 states have internal predecessors, (364), 61 states have call successors, (61), 27 states have call predecessors, (61), 26 states have return successors, (56), 51 states have call predecessors, (56), 56 states have call successors, (56) [2022-07-20 00:00:00,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-20 00:00:00,313 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:00:00,313 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-07-20 00:00:00,314 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:00:00,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:00:00,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1909877325, now seen corresponding path program 1 times [2022-07-20 00:00:00,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:00:00,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616880798] [2022-07-20 00:00:00,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:00:00,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:00:00,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:00,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:00:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:00,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 00:00:00,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:00,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 00:00:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:00,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 00:00:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:00,631 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 00:00:00,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:00:00,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616880798] [2022-07-20 00:00:00,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616880798] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:00:00,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:00:00,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 00:00:00,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648445315] [2022-07-20 00:00:00,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:00:00,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 00:00:00,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:00:00,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 00:00:00,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 00:00:00,658 INFO L87 Difference]: Start difference. First operand has 347 states, 258 states have (on average 1.4108527131782946) internal successors, (364), 274 states have internal predecessors, (364), 61 states have call successors, (61), 27 states have call predecessors, (61), 26 states have return successors, (56), 51 states have call predecessors, (56), 56 states have call successors, (56) Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-20 00:00:01,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:00:01,264 INFO L93 Difference]: Finished difference Result 1016 states and 1435 transitions. [2022-07-20 00:00:01,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 00:00:01,266 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-07-20 00:00:01,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:00:01,276 INFO L225 Difference]: With dead ends: 1016 [2022-07-20 00:00:01,277 INFO L226 Difference]: Without dead ends: 571 [2022-07-20 00:00:01,281 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-07-20 00:00:01,283 INFO L413 NwaCegarLoop]: 513 mSDtfsCounter, 620 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 00:00:01,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 911 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-20 00:00:01,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-07-20 00:00:01,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 524. [2022-07-20 00:00:01,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 397 states have (on average 1.3778337531486147) internal successors, (547), 408 states have internal predecessors, (547), 86 states have call successors, (86), 45 states have call predecessors, (86), 40 states have return successors, (81), 76 states have call predecessors, (81), 81 states have call successors, (81) [2022-07-20 00:00:01,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 714 transitions. [2022-07-20 00:00:01,381 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 714 transitions. Word has length 45 [2022-07-20 00:00:01,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:00:01,381 INFO L495 AbstractCegarLoop]: Abstraction has 524 states and 714 transitions. [2022-07-20 00:00:01,382 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-07-20 00:00:01,382 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 714 transitions. [2022-07-20 00:00:01,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-20 00:00:01,388 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:00:01,389 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-07-20 00:00:01,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 00:00:01,390 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:00:01,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:00:01,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1822185999, now seen corresponding path program 1 times [2022-07-20 00:00:01,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:00:01,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551238869] [2022-07-20 00:00:01,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:00:01,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:00:01,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:01,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:00:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:01,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 00:00:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:01,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 00:00:01,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:01,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 00:00:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:01,531 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 00:00:01,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:00:01,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551238869] [2022-07-20 00:00:01,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551238869] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:00:01,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:00:01,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 00:00:01,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674087295] [2022-07-20 00:00:01,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:00:01,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 00:00:01,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:00:01,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 00:00:01,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 00:00:01,534 INFO L87 Difference]: Start difference. First operand 524 states and 714 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-20 00:00:02,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:00:02,327 INFO L93 Difference]: Finished difference Result 1271 states and 1794 transitions. [2022-07-20 00:00:02,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 00:00:02,328 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2022-07-20 00:00:02,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:00:02,332 INFO L225 Difference]: With dead ends: 1271 [2022-07-20 00:00:02,332 INFO L226 Difference]: Without dead ends: 767 [2022-07-20 00:00:02,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 00:00:02,334 INFO L413 NwaCegarLoop]: 736 mSDtfsCounter, 744 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 1636 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 00:00:02,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 1636 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-20 00:00:02,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2022-07-20 00:00:02,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 525. [2022-07-20 00:00:02,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 398 states have (on average 1.3768844221105527) internal successors, (548), 409 states have internal predecessors, (548), 86 states have call successors, (86), 45 states have call predecessors, (86), 40 states have return successors, (81), 76 states have call predecessors, (81), 81 states have call successors, (81) [2022-07-20 00:00:02,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 715 transitions. [2022-07-20 00:00:02,356 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 715 transitions. Word has length 47 [2022-07-20 00:00:02,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:00:02,356 INFO L495 AbstractCegarLoop]: Abstraction has 525 states and 715 transitions. [2022-07-20 00:00:02,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-20 00:00:02,356 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 715 transitions. [2022-07-20 00:00:02,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-20 00:00:02,358 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:00:02,358 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-07-20 00:00:02,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 00:00:02,359 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:00:02,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:00:02,359 INFO L85 PathProgramCache]: Analyzing trace with hash -478636591, now seen corresponding path program 1 times [2022-07-20 00:00:02,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:00:02,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812950205] [2022-07-20 00:00:02,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:00:02,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:00:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:02,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:00:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:02,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 00:00:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:02,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 00:00:02,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:02,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 00:00:02,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:02,428 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 00:00:02,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:00:02,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812950205] [2022-07-20 00:00:02,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812950205] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:00:02,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:00:02,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 00:00:02,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011489564] [2022-07-20 00:00:02,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:00:02,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 00:00:02,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:00:02,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 00:00:02,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 00:00:02,431 INFO L87 Difference]: Start difference. First operand 525 states and 715 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-20 00:00:02,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:00:02,695 INFO L93 Difference]: Finished difference Result 1074 states and 1473 transitions. [2022-07-20 00:00:02,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 00:00:02,696 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-07-20 00:00:02,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:00:02,699 INFO L225 Difference]: With dead ends: 1074 [2022-07-20 00:00:02,700 INFO L226 Difference]: Without dead ends: 569 [2022-07-20 00:00:02,701 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-07-20 00:00:02,705 INFO L413 NwaCegarLoop]: 437 mSDtfsCounter, 534 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 00:00:02,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 644 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 00:00:02,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2022-07-20 00:00:02,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 525. [2022-07-20 00:00:02,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 398 states have (on average 1.3743718592964824) internal successors, (547), 409 states have internal predecessors, (547), 86 states have call successors, (86), 45 states have call predecessors, (86), 40 states have return successors, (81), 76 states have call predecessors, (81), 81 states have call successors, (81) [2022-07-20 00:00:02,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 714 transitions. [2022-07-20 00:00:02,742 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 714 transitions. Word has length 47 [2022-07-20 00:00:02,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:00:02,742 INFO L495 AbstractCegarLoop]: Abstraction has 525 states and 714 transitions. [2022-07-20 00:00:02,743 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-07-20 00:00:02,744 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 714 transitions. [2022-07-20 00:00:02,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-20 00:00:02,746 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:00:02,746 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-07-20 00:00:02,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 00:00:02,746 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:00:02,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:00:02,747 INFO L85 PathProgramCache]: Analyzing trace with hash -457513191, now seen corresponding path program 1 times [2022-07-20 00:00:02,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:00:02,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742470129] [2022-07-20 00:00:02,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:00:02,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:00:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:02,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:00:02,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:02,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 00:00:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:02,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 00:00:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:02,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-20 00:00:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:02,828 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 00:00:02,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:00:02,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742470129] [2022-07-20 00:00:02,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742470129] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:00:02,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:00:02,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 00:00:02,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911126871] [2022-07-20 00:00:02,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:00:02,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 00:00:02,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:00:02,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 00:00:02,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 00:00:02,840 INFO L87 Difference]: Start difference. First operand 525 states and 714 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-20 00:00:03,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:00:03,328 INFO L93 Difference]: Finished difference Result 1054 states and 1484 transitions. [2022-07-20 00:00:03,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 00:00:03,329 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-07-20 00:00:03,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:00:03,333 INFO L225 Difference]: With dead ends: 1054 [2022-07-20 00:00:03,333 INFO L226 Difference]: Without dead ends: 1025 [2022-07-20 00:00:03,334 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-07-20 00:00:03,335 INFO L413 NwaCegarLoop]: 472 mSDtfsCounter, 617 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 00:00:03,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 916 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 00:00:03,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2022-07-20 00:00:03,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 932. [2022-07-20 00:00:03,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 719 states have (on average 1.411682892906815) internal successors, (1015), 743 states have internal predecessors, (1015), 143 states have call successors, (143), 69 states have call predecessors, (143), 69 states have return successors, (147), 131 states have call predecessors, (147), 138 states have call successors, (147) [2022-07-20 00:00:03,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1305 transitions. [2022-07-20 00:00:03,370 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1305 transitions. Word has length 50 [2022-07-20 00:00:03,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:00:03,370 INFO L495 AbstractCegarLoop]: Abstraction has 932 states and 1305 transitions. [2022-07-20 00:00:03,370 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-07-20 00:00:03,371 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1305 transitions. [2022-07-20 00:00:03,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-20 00:00:03,373 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:00:03,373 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-07-20 00:00:03,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 00:00:03,373 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:00:03,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:00:03,374 INFO L85 PathProgramCache]: Analyzing trace with hash 638272764, now seen corresponding path program 1 times [2022-07-20 00:00:03,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:00:03,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528209591] [2022-07-20 00:00:03,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:00:03,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:00:03,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:03,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:00:03,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:03,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 00:00:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:03,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 00:00:03,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:03,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 00:00:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:03,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:00:03,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:03,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-20 00:00:03,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:03,466 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 00:00:03,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:00:03,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528209591] [2022-07-20 00:00:03,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528209591] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:00:03,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:00:03,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 00:00:03,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373473427] [2022-07-20 00:00:03,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:00:03,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 00:00:03,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:00:03,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 00:00:03,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-20 00:00:03,469 INFO L87 Difference]: Start difference. First operand 932 states and 1305 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-20 00:00:04,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:00:04,254 INFO L93 Difference]: Finished difference Result 2764 states and 3873 transitions. [2022-07-20 00:00:04,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 00:00:04,255 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-07-20 00:00:04,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:00:04,261 INFO L225 Difference]: With dead ends: 2764 [2022-07-20 00:00:04,261 INFO L226 Difference]: Without dead ends: 1852 [2022-07-20 00:00:04,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-20 00:00:04,263 INFO L413 NwaCegarLoop]: 462 mSDtfsCounter, 1112 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 00:00:04,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 1098 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-20 00:00:04,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2022-07-20 00:00:04,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 1659. [2022-07-20 00:00:04,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1659 states, 1288 states have (on average 1.4122670807453417) internal successors, (1819), 1328 states have internal predecessors, (1819), 247 states have call successors, (247), 126 states have call predecessors, (247), 123 states have return successors, (246), 228 states have call predecessors, (246), 242 states have call successors, (246) [2022-07-20 00:00:04,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2312 transitions. [2022-07-20 00:00:04,326 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2312 transitions. Word has length 65 [2022-07-20 00:00:04,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:00:04,326 INFO L495 AbstractCegarLoop]: Abstraction has 1659 states and 2312 transitions. [2022-07-20 00:00:04,326 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-07-20 00:00:04,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2312 transitions. [2022-07-20 00:00:04,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-20 00:00:04,329 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:00:04,329 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-07-20 00:00:04,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 00:00:04,330 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:00:04,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:00:04,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1750010362, now seen corresponding path program 1 times [2022-07-20 00:00:04,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:00:04,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336912415] [2022-07-20 00:00:04,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:00:04,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:00:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:04,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:00:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:04,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 00:00:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:04,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 00:00:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:04,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 00:00:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:04,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:00:04,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:04,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 00:00:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:04,401 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-20 00:00:04,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:00:04,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336912415] [2022-07-20 00:00:04,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336912415] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:00:04,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:00:04,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 00:00:04,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144709427] [2022-07-20 00:00:04,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:00:04,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 00:00:04,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:00:04,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 00:00:04,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-20 00:00:04,403 INFO L87 Difference]: Start difference. First operand 1659 states and 2312 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-20 00:00:05,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:00:05,086 INFO L93 Difference]: Finished difference Result 3474 states and 4860 transitions. [2022-07-20 00:00:05,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 00:00:05,087 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-07-20 00:00:05,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:00:05,100 INFO L225 Difference]: With dead ends: 3474 [2022-07-20 00:00:05,100 INFO L226 Difference]: Without dead ends: 1803 [2022-07-20 00:00:05,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-20 00:00:05,103 INFO L413 NwaCegarLoop]: 445 mSDtfsCounter, 370 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 00:00:05,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 1331 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-20 00:00:05,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2022-07-20 00:00:05,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1639. [2022-07-20 00:00:05,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1639 states, 1272 states have (on average 1.404874213836478) internal successors, (1787), 1312 states have internal predecessors, (1787), 243 states have call successors, (243), 126 states have call predecessors, (243), 123 states have return successors, (242), 224 states have call predecessors, (242), 238 states have call successors, (242) [2022-07-20 00:00:05,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1639 states and 2272 transitions. [2022-07-20 00:00:05,203 INFO L78 Accepts]: Start accepts. Automaton has 1639 states and 2272 transitions. Word has length 73 [2022-07-20 00:00:05,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:00:05,204 INFO L495 AbstractCegarLoop]: Abstraction has 1639 states and 2272 transitions. [2022-07-20 00:00:05,204 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-07-20 00:00:05,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1639 states and 2272 transitions. [2022-07-20 00:00:05,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-20 00:00:05,205 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:00:05,205 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-07-20 00:00:05,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 00:00:05,206 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:00:05,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:00:05,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1924223221, now seen corresponding path program 1 times [2022-07-20 00:00:05,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:00:05,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379298717] [2022-07-20 00:00:05,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:00:05,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:00:05,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:05,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:00:05,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:05,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 00:00:05,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:05,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 00:00:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:05,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 00:00:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:05,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:00:05,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:05,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-20 00:00:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:05,285 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 00:00:05,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:00:05,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379298717] [2022-07-20 00:00:05,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379298717] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:00:05,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:00:05,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 00:00:05,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600185636] [2022-07-20 00:00:05,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:00:05,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 00:00:05,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:00:05,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 00:00:05,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 00:00:05,287 INFO L87 Difference]: Start difference. First operand 1639 states and 2272 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-20 00:00:05,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:00:05,940 INFO L93 Difference]: Finished difference Result 4908 states and 6816 transitions. [2022-07-20 00:00:05,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 00:00:05,940 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-07-20 00:00:05,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:00:05,953 INFO L225 Difference]: With dead ends: 4908 [2022-07-20 00:00:05,954 INFO L226 Difference]: Without dead ends: 3289 [2022-07-20 00:00:05,961 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-07-20 00:00:05,962 INFO L413 NwaCegarLoop]: 503 mSDtfsCounter, 847 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 358 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 00:00:05,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 1186 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [358 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-20 00:00:05,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3289 states. [2022-07-20 00:00:06,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3289 to 2936. [2022-07-20 00:00:06,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2936 states, 2278 states have (on average 1.3999122036874452) internal successors, (3189), 2354 states have internal predecessors, (3189), 428 states have call successors, (428), 230 states have call predecessors, (428), 229 states have return successors, (431), 395 states have call predecessors, (431), 423 states have call successors, (431) [2022-07-20 00:00:06,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2936 states to 2936 states and 4048 transitions. [2022-07-20 00:00:06,100 INFO L78 Accepts]: Start accepts. Automaton has 2936 states and 4048 transitions. Word has length 71 [2022-07-20 00:00:06,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:00:06,101 INFO L495 AbstractCegarLoop]: Abstraction has 2936 states and 4048 transitions. [2022-07-20 00:00:06,101 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-07-20 00:00:06,101 INFO L276 IsEmpty]: Start isEmpty. Operand 2936 states and 4048 transitions. [2022-07-20 00:00:06,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-20 00:00:06,104 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:00:06,104 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-07-20 00:00:06,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 00:00:06,105 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:00:06,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:00:06,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1077933097, now seen corresponding path program 1 times [2022-07-20 00:00:06,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:00:06,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472843003] [2022-07-20 00:00:06,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:00:06,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:00:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:06,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:00:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:06,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 00:00:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:06,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 00:00:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:06,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-20 00:00:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:06,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-20 00:00:06,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:06,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:00:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:06,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 00:00:06,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:06,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 00:00:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:06,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-20 00:00:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:06,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-20 00:00:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:06,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:00:06,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:06,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-20 00:00:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:06,208 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 00:00:06,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:00:06,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472843003] [2022-07-20 00:00:06,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472843003] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:00:06,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:00:06,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 00:00:06,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741253802] [2022-07-20 00:00:06,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:00:06,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 00:00:06,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:00:06,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 00:00:06,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-20 00:00:06,210 INFO L87 Difference]: Start difference. First operand 2936 states and 4048 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (17), 7 states have call predecessors, (17), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-20 00:00:07,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:00:07,204 INFO L93 Difference]: Finished difference Result 7847 states and 10900 transitions. [2022-07-20 00:00:07,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 00:00:07,205 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-07-20 00:00:07,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:00:07,225 INFO L225 Difference]: With dead ends: 7847 [2022-07-20 00:00:07,225 INFO L226 Difference]: Without dead ends: 4931 [2022-07-20 00:00:07,234 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-07-20 00:00:07,235 INFO L413 NwaCegarLoop]: 733 mSDtfsCounter, 1054 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 644 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 1581 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 644 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 00:00:07,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 1581 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [644 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-20 00:00:07,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4931 states. [2022-07-20 00:00:07,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4931 to 4414. [2022-07-20 00:00:07,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4414 states, 3444 states have (on average 1.3945993031358885) internal successors, (4803), 3560 states have internal predecessors, (4803), 627 states have call successors, (627), 341 states have call predecessors, (627), 342 states have return successors, (634), 580 states have call predecessors, (634), 622 states have call successors, (634) [2022-07-20 00:00:07,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4414 states to 4414 states and 6064 transitions. [2022-07-20 00:00:07,441 INFO L78 Accepts]: Start accepts. Automaton has 4414 states and 6064 transitions. Word has length 117 [2022-07-20 00:00:07,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:00:07,441 INFO L495 AbstractCegarLoop]: Abstraction has 4414 states and 6064 transitions. [2022-07-20 00:00:07,442 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-07-20 00:00:07,442 INFO L276 IsEmpty]: Start isEmpty. Operand 4414 states and 6064 transitions. [2022-07-20 00:00:07,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-20 00:00:07,446 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:00:07,446 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-07-20 00:00:07,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 00:00:07,447 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:00:07,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:00:07,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1717722878, now seen corresponding path program 1 times [2022-07-20 00:00:07,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:00:07,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722557386] [2022-07-20 00:00:07,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:00:07,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:00:07,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:07,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:00:07,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:07,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 00:00:07,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:07,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 00:00:07,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:07,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-20 00:00:07,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:07,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-20 00:00:07,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:07,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:00:07,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:07,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 00:00:07,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:07,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 00:00:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:07,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-20 00:00:07,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:07,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 00:00:07,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:07,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:00:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:07,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 00:00:07,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:07,541 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 00:00:07,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:00:07,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722557386] [2022-07-20 00:00:07,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722557386] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:00:07,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:00:07,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 00:00:07,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586171959] [2022-07-20 00:00:07,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:00:07,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 00:00:07,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:00:07,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 00:00:07,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-20 00:00:07,543 INFO L87 Difference]: Start difference. First operand 4414 states and 6064 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-20 00:00:08,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:00:08,547 INFO L93 Difference]: Finished difference Result 11777 states and 16307 transitions. [2022-07-20 00:00:08,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 00:00:08,548 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-07-20 00:00:08,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:00:08,576 INFO L225 Difference]: With dead ends: 11777 [2022-07-20 00:00:08,577 INFO L226 Difference]: Without dead ends: 7383 [2022-07-20 00:00:08,587 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-07-20 00:00:08,589 INFO L413 NwaCegarLoop]: 708 mSDtfsCounter, 788 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 427 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 1866 SdHoareTripleChecker+Invalid, 1273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 427 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 00:00:08,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 1866 Invalid, 1273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [427 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-20 00:00:08,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7383 states. [2022-07-20 00:00:08,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7383 to 6624. [2022-07-20 00:00:08,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6624 states, 5195 states have (on average 1.3897978825794033) internal successors, (7220), 5371 states have internal predecessors, (7220), 918 states have call successors, (918), 506 states have call predecessors, (918), 510 states have return successors, (931), 850 states have call predecessors, (931), 913 states have call successors, (931) [2022-07-20 00:00:08,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6624 states to 6624 states and 9069 transitions. [2022-07-20 00:00:08,904 INFO L78 Accepts]: Start accepts. Automaton has 6624 states and 9069 transitions. Word has length 123 [2022-07-20 00:00:08,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:00:08,906 INFO L495 AbstractCegarLoop]: Abstraction has 6624 states and 9069 transitions. [2022-07-20 00:00:08,906 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-07-20 00:00:08,906 INFO L276 IsEmpty]: Start isEmpty. Operand 6624 states and 9069 transitions. [2022-07-20 00:00:08,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-20 00:00:08,914 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:00:08,914 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-07-20 00:00:08,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 00:00:08,915 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:00:08,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:00:08,915 INFO L85 PathProgramCache]: Analyzing trace with hash 723546157, now seen corresponding path program 1 times [2022-07-20 00:00:08,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:00:08,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074511548] [2022-07-20 00:00:08,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:00:08,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:00:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:09,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:00:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:09,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 00:00:09,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:09,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 00:00:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:09,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-20 00:00:09,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:09,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-20 00:00:09,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:09,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:00:09,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:09,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 00:00:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:09,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 00:00:09,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:09,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-20 00:00:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:09,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-20 00:00:09,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:09,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:00:09,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:09,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-20 00:00:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:09,080 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-20 00:00:09,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:00:09,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074511548] [2022-07-20 00:00:09,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074511548] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 00:00:09,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739326155] [2022-07-20 00:00:09,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:00:09,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 00:00:09,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 00:00:09,082 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 00:00:09,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-20 00:00:09,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:09,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 1059 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 00:00:09,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:00:09,426 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-20 00:00:09,426 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 00:00:09,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739326155] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:00:09,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 00:00:09,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2022-07-20 00:00:09,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688652751] [2022-07-20 00:00:09,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:00:09,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 00:00:09,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:00:09,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 00:00:09,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-07-20 00:00:09,428 INFO L87 Difference]: Start difference. First operand 6624 states and 9069 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-20 00:00:09,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:00:09,695 INFO L93 Difference]: Finished difference Result 13336 states and 18277 transitions. [2022-07-20 00:00:09,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 00:00:09,696 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-07-20 00:00:09,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:00:09,722 INFO L225 Difference]: With dead ends: 13336 [2022-07-20 00:00:09,723 INFO L226 Difference]: Without dead ends: 6606 [2022-07-20 00:00:09,740 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-07-20 00:00:09,740 INFO L413 NwaCegarLoop]: 448 mSDtfsCounter, 6 mSDsluCounter, 1319 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1767 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 00:00:09,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1767 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 00:00:09,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6606 states. [2022-07-20 00:00:09,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6606 to 6606. [2022-07-20 00:00:09,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6606 states, 5159 states have (on average 1.3855398333010274) internal successors, (7148), 5344 states have internal predecessors, (7148), 936 states have call successors, (936), 506 states have call predecessors, (936), 510 states have return successors, (940), 859 states have call predecessors, (940), 922 states have call successors, (940) [2022-07-20 00:00:10,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6606 states to 6606 states and 9024 transitions. [2022-07-20 00:00:10,011 INFO L78 Accepts]: Start accepts. Automaton has 6606 states and 9024 transitions. Word has length 127 [2022-07-20 00:00:10,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:00:10,011 INFO L495 AbstractCegarLoop]: Abstraction has 6606 states and 9024 transitions. [2022-07-20 00:00:10,011 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-07-20 00:00:10,012 INFO L276 IsEmpty]: Start isEmpty. Operand 6606 states and 9024 transitions. [2022-07-20 00:00:10,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-20 00:00:10,017 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:00:10,017 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-07-20 00:00:10,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-20 00:00:10,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-20 00:00:10,231 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:00:10,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:00:10,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1165331384, now seen corresponding path program 1 times [2022-07-20 00:00:10,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:00:10,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727580836] [2022-07-20 00:00:10,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:00:10,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:00:10,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:10,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:00:10,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:10,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 00:00:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:10,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 00:00:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:10,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-20 00:00:10,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:10,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-20 00:00:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:10,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:00:10,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:10,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 00:00:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:10,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 00:00:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:10,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-20 00:00:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:10,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 00:00:10,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:10,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:00:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:10,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 00:00:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:10,352 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-20 00:00:10,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:00:10,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727580836] [2022-07-20 00:00:10,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727580836] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:00:10,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:00:10,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 00:00:10,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163216416] [2022-07-20 00:00:10,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:00:10,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 00:00:10,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:00:10,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 00:00:10,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-20 00:00:10,354 INFO L87 Difference]: Start difference. First operand 6606 states and 9024 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (17), 7 states have call predecessors, (17), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-20 00:00:11,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:00:11,167 INFO L93 Difference]: Finished difference Result 13880 states and 19040 transitions. [2022-07-20 00:00:11,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 00:00:11,180 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-07-20 00:00:11,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:00:11,206 INFO L225 Difference]: With dead ends: 13880 [2022-07-20 00:00:11,207 INFO L226 Difference]: Without dead ends: 7294 [2022-07-20 00:00:11,223 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-07-20 00:00:11,224 INFO L413 NwaCegarLoop]: 431 mSDtfsCounter, 721 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 00:00:11,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 1209 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-20 00:00:11,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7294 states. [2022-07-20 00:00:11,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7294 to 6570. [2022-07-20 00:00:11,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6570 states, 5123 states have (on average 1.3812219402693735) internal successors, (7076), 5308 states have internal predecessors, (7076), 936 states have call successors, (936), 506 states have call predecessors, (936), 510 states have return successors, (940), 859 states have call predecessors, (940), 922 states have call successors, (940) [2022-07-20 00:00:11,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6570 states to 6570 states and 8952 transitions. [2022-07-20 00:00:11,557 INFO L78 Accepts]: Start accepts. Automaton has 6570 states and 8952 transitions. Word has length 129 [2022-07-20 00:00:11,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:00:11,558 INFO L495 AbstractCegarLoop]: Abstraction has 6570 states and 8952 transitions. [2022-07-20 00:00:11,558 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-07-20 00:00:11,558 INFO L276 IsEmpty]: Start isEmpty. Operand 6570 states and 8952 transitions. [2022-07-20 00:00:11,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-20 00:00:11,564 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:00:11,564 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-07-20 00:00:11,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 00:00:11,565 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:00:11,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:00:11,565 INFO L85 PathProgramCache]: Analyzing trace with hash -985966780, now seen corresponding path program 1 times [2022-07-20 00:00:11,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:00:11,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368217378] [2022-07-20 00:00:11,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:00:11,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:00:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:11,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:00:11,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:11,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 00:00:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:11,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 00:00:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:11,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-20 00:00:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:11,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-20 00:00:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:11,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:00:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:11,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 00:00:11,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:11,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-20 00:00:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:11,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-20 00:00:11,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:11,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 00:00:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:11,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:00:11,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:11,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 00:00:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:11,696 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-20 00:00:11,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:00:11,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368217378] [2022-07-20 00:00:11,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368217378] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 00:00:11,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451496747] [2022-07-20 00:00:11,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:00:11,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 00:00:11,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 00:00:11,699 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 00:00:11,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-20 00:00:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:11,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 1071 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 00:00:11,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:00:12,019 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-20 00:00:12,019 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 00:00:12,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451496747] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:00:12,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 00:00:12,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 10 [2022-07-20 00:00:12,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750332827] [2022-07-20 00:00:12,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:00:12,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 00:00:12,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:00:12,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 00:00:12,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-20 00:00:12,020 INFO L87 Difference]: Start difference. First operand 6570 states and 8952 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 4 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-20 00:00:12,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:00:12,713 INFO L93 Difference]: Finished difference Result 19649 states and 26785 transitions. [2022-07-20 00:00:12,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 00:00:12,714 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-07-20 00:00:12,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:00:12,770 INFO L225 Difference]: With dead ends: 19649 [2022-07-20 00:00:12,770 INFO L226 Difference]: Without dead ends: 19622 [2022-07-20 00:00:12,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-20 00:00:12,780 INFO L413 NwaCegarLoop]: 846 mSDtfsCounter, 774 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 00:00:12,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 1682 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 00:00:12,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19622 states. [2022-07-20 00:00:13,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19622 to 19472. [2022-07-20 00:00:13,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19472 states, 15165 states have (on average 1.3853610286844709) internal successors, (21009), 15720 states have internal predecessors, (21009), 2784 states have call successors, (2784), 1500 states have call predecessors, (2784), 1522 states have return successors, (2806), 2563 states have call predecessors, (2806), 2752 states have call successors, (2806) [2022-07-20 00:00:13,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19472 states to 19472 states and 26599 transitions. [2022-07-20 00:00:13,529 INFO L78 Accepts]: Start accepts. Automaton has 19472 states and 26599 transitions. Word has length 130 [2022-07-20 00:00:13,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:00:13,529 INFO L495 AbstractCegarLoop]: Abstraction has 19472 states and 26599 transitions. [2022-07-20 00:00:13,529 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-07-20 00:00:13,530 INFO L276 IsEmpty]: Start isEmpty. Operand 19472 states and 26599 transitions. [2022-07-20 00:00:13,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-20 00:00:13,546 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:00:13,547 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-07-20 00:00:13,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-20 00:00:13,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-20 00:00:13,762 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:00:13,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:00:13,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1089963992, now seen corresponding path program 1 times [2022-07-20 00:00:13,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:00:13,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408343725] [2022-07-20 00:00:13,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:00:13,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:00:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:13,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:00:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:13,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 00:00:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:13,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 00:00:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:13,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-20 00:00:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:13,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-20 00:00:13,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:13,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:00:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:13,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 00:00:13,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:13,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-20 00:00:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:13,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-20 00:00:13,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:13,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 00:00:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:13,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:00:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:13,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 00:00:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:13,898 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-20 00:00:13,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:00:13,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408343725] [2022-07-20 00:00:13,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408343725] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:00:13,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:00:13,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 00:00:13,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261737004] [2022-07-20 00:00:13,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:00:13,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 00:00:13,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:00:13,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 00:00:13,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-20 00:00:13,900 INFO L87 Difference]: Start difference. First operand 19472 states and 26599 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (15), 7 states have call predecessors, (15), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-20 00:00:14,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:00:14,947 INFO L93 Difference]: Finished difference Result 26068 states and 35801 transitions. [2022-07-20 00:00:14,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 00:00:14,948 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-07-20 00:00:14,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:00:14,967 INFO L225 Difference]: With dead ends: 26068 [2022-07-20 00:00:14,968 INFO L226 Difference]: Without dead ends: 6429 [2022-07-20 00:00:15,011 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-07-20 00:00:15,012 INFO L413 NwaCegarLoop]: 536 mSDtfsCounter, 817 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 461 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 461 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 00:00:15,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [839 Valid, 1149 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [461 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-20 00:00:15,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6429 states. [2022-07-20 00:00:15,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6429 to 6299. [2022-07-20 00:00:15,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6299 states, 5043 states have (on average 1.403926234384295) internal successors, (7080), 5166 states have internal predecessors, (7080), 795 states have call successors, (795), 465 states have call predecessors, (795), 460 states have return successors, (790), 775 states have call predecessors, (790), 790 states have call successors, (790) [2022-07-20 00:00:15,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6299 states to 6299 states and 8665 transitions. [2022-07-20 00:00:15,247 INFO L78 Accepts]: Start accepts. Automaton has 6299 states and 8665 transitions. Word has length 135 [2022-07-20 00:00:15,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:00:15,248 INFO L495 AbstractCegarLoop]: Abstraction has 6299 states and 8665 transitions. [2022-07-20 00:00:15,248 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-07-20 00:00:15,248 INFO L276 IsEmpty]: Start isEmpty. Operand 6299 states and 8665 transitions. [2022-07-20 00:00:15,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-20 00:00:15,260 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:00:15,260 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-07-20 00:00:15,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 00:00:15,260 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:00:15,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:00:15,261 INFO L85 PathProgramCache]: Analyzing trace with hash 862404707, now seen corresponding path program 1 times [2022-07-20 00:00:15,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:00:15,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085398856] [2022-07-20 00:00:15,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:00:15,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:00:15,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:15,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:00:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:15,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 00:00:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:15,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 00:00:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:15,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-20 00:00:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:15,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-20 00:00:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:15,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:00:15,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:15,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 00:00:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:15,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-20 00:00:15,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:15,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-20 00:00:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:15,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 00:00:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:15,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:00:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:15,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-20 00:00:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:15,397 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-20 00:00:15,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:00:15,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085398856] [2022-07-20 00:00:15,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085398856] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:00:15,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:00:15,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 00:00:15,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389162734] [2022-07-20 00:00:15,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:00:15,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 00:00:15,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:00:15,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 00:00:15,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-20 00:00:15,401 INFO L87 Difference]: Start difference. First operand 6299 states and 8665 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 7 states have call predecessors, (17), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-20 00:00:16,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:00:16,455 INFO L93 Difference]: Finished difference Result 16405 states and 23360 transitions. [2022-07-20 00:00:16,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 00:00:16,456 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-07-20 00:00:16,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:00:16,480 INFO L225 Difference]: With dead ends: 16405 [2022-07-20 00:00:16,480 INFO L226 Difference]: Without dead ends: 10126 [2022-07-20 00:00:16,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-07-20 00:00:16,492 INFO L413 NwaCegarLoop]: 474 mSDtfsCounter, 735 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 426 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 426 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 00:00:16,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 1632 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [426 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-20 00:00:16,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10126 states. [2022-07-20 00:00:16,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10126 to 6302. [2022-07-20 00:00:16,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6302 states, 5046 states have (on average 1.4036860879904876) internal successors, (7083), 5169 states have internal predecessors, (7083), 795 states have call successors, (795), 465 states have call predecessors, (795), 460 states have return successors, (790), 775 states have call predecessors, (790), 790 states have call successors, (790) [2022-07-20 00:00:16,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6302 states to 6302 states and 8668 transitions. [2022-07-20 00:00:16,711 INFO L78 Accepts]: Start accepts. Automaton has 6302 states and 8668 transitions. Word has length 139 [2022-07-20 00:00:16,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:00:16,711 INFO L495 AbstractCegarLoop]: Abstraction has 6302 states and 8668 transitions. [2022-07-20 00:00:16,712 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-07-20 00:00:16,712 INFO L276 IsEmpty]: Start isEmpty. Operand 6302 states and 8668 transitions. [2022-07-20 00:00:16,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-20 00:00:16,732 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:00:16,732 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-07-20 00:00:16,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-20 00:00:16,732 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:00:16,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:00:16,733 INFO L85 PathProgramCache]: Analyzing trace with hash -460523326, now seen corresponding path program 1 times [2022-07-20 00:00:16,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:00:16,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590812885] [2022-07-20 00:00:16,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:00:16,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:00:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:16,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:00:16,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:16,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 00:00:16,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:16,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 00:00:16,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:16,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-20 00:00:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:16,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-20 00:00:16,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:16,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:00:16,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:16,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 00:00:16,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:16,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-20 00:00:16,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:16,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 00:00:16,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:16,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-20 00:00:16,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:16,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:00:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:16,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 00:00:16,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:16,876 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-20 00:00:16,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:00:16,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590812885] [2022-07-20 00:00:16,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590812885] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:00:16,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:00:16,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 00:00:16,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64773761] [2022-07-20 00:00:16,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:00:16,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 00:00:16,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:00:16,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 00:00:16,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-20 00:00:16,878 INFO L87 Difference]: Start difference. First operand 6302 states and 8668 transitions. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (17), 7 states have call predecessors, (17), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-20 00:00:17,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:00:17,512 INFO L93 Difference]: Finished difference Result 6983 states and 9558 transitions. [2022-07-20 00:00:17,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 00:00:17,512 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-07-20 00:00:17,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:00:17,513 INFO L225 Difference]: With dead ends: 6983 [2022-07-20 00:00:17,513 INFO L226 Difference]: Without dead ends: 0 [2022-07-20 00:00:17,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-07-20 00:00:17,523 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 706 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 00:00:17,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 634 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-20 00:00:17,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-20 00:00:17,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-20 00:00:17,527 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-07-20 00:00:17,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-20 00:00:17,528 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 141 [2022-07-20 00:00:17,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:00:17,528 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-20 00:00:17,528 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-07-20 00:00:17,528 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-20 00:00:17,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-20 00:00:17,530 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-20 00:00:17,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 00:00:17,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-20 00:03:39,296 INFO L899 garLoopResultBuilder]: For program point _torture_stop_kthreadEXIT(lines 2972 2974) no Hoare annotation was computed. [2022-07-20 00:03:39,296 INFO L899 garLoopResultBuilder]: For program point _torture_stop_kthreadFINAL(lines 2972 2974) no Hoare annotation was computed. [2022-07-20 00:03:39,296 INFO L902 garLoopResultBuilder]: At program point _torture_stop_kthreadENTRY(lines 2972 2974) the Hoare annotation is: true [2022-07-20 00:03:39,296 INFO L899 garLoopResultBuilder]: For program point kfreeEXIT(lines 3078 3080) no Hoare annotation was computed. [2022-07-20 00:03:39,296 INFO L895 garLoopResultBuilder]: At program point kfreeENTRY(lines 3078 3080) the Hoare annotation is: (= |old(#valid)| |#valid|) [2022-07-20 00:03:39,296 INFO L899 garLoopResultBuilder]: For program point kfreeFINAL(lines 3078 3080) no Hoare annotation was computed. [2022-07-20 00:03:39,297 INFO L899 garLoopResultBuilder]: For program point torture_lock_busted_write_delayEXIT(lines 2087 2112) no Hoare annotation was computed. [2022-07-20 00:03:39,297 INFO L902 garLoopResultBuilder]: At program point torture_lock_busted_write_delayENTRY(lines 2087 2112) the Hoare annotation is: true [2022-07-20 00:03:39,297 INFO L899 garLoopResultBuilder]: For program point L2104(lines 2104 2107) no Hoare annotation was computed. [2022-07-20 00:03:39,297 INFO L902 garLoopResultBuilder]: At program point L2105(lines 2096 2108) the Hoare annotation is: true [2022-07-20 00:03:39,297 INFO L902 garLoopResultBuilder]: At program point L2100(lines 2096 2108) the Hoare annotation is: true [2022-07-20 00:03:39,297 INFO L899 garLoopResultBuilder]: For program point L2096(lines 2096 2109) no Hoare annotation was computed. [2022-07-20 00:03:39,297 INFO L899 garLoopResultBuilder]: For program point L2095-1(line 2095) no Hoare annotation was computed. [2022-07-20 00:03:39,297 INFO L899 garLoopResultBuilder]: For program point L2096-2(lines 2087 2112) no Hoare annotation was computed. [2022-07-20 00:03:39,297 INFO L902 garLoopResultBuilder]: At program point L2095(line 2095) the Hoare annotation is: true [2022-07-20 00:03:39,297 INFO L899 garLoopResultBuilder]: For program point L2865-1(line 2865) no Hoare annotation was computed. [2022-07-20 00:03:39,297 INFO L899 garLoopResultBuilder]: For program point torture_lock_spin_write_unlock_irqEXIT(lines 2182 2188) no Hoare annotation was computed. [2022-07-20 00:03:39,298 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-07-20 00:03:39,298 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-07-20 00:03:39,298 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-07-20 00:03:39,298 INFO L899 garLoopResultBuilder]: For program point torture_lock_spin_write_unlock_irqFINAL(lines 2182 2188) no Hoare annotation was computed. [2022-07-20 00:03:39,298 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-07-20 00:03:39,298 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-07-20 00:03:39,298 INFO L899 garLoopResultBuilder]: For program point __const_udelayFINAL(lines 2953 2955) no Hoare annotation was computed. [2022-07-20 00:03:39,298 INFO L899 garLoopResultBuilder]: For program point __const_udelayEXIT(lines 2953 2955) no Hoare annotation was computed. [2022-07-20 00:03:39,298 INFO L902 garLoopResultBuilder]: At program point __const_udelayENTRY(lines 2953 2955) the Hoare annotation is: true [2022-07-20 00:03:39,299 INFO L899 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 2009 2015) no Hoare annotation was computed. [2022-07-20 00:03:39,299 INFO L902 garLoopResultBuilder]: At program point ldv_errorENTRY(lines 2009 2015) the Hoare annotation is: true [2022-07-20 00:03:39,299 INFO L899 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2013) no Hoare annotation was computed. [2022-07-20 00:03:39,299 INFO L899 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 2009 2015) no Hoare annotation was computed. [2022-07-20 00:03:39,299 INFO L899 garLoopResultBuilder]: For program point torture_lock_busted_write_lockFINAL(lines 2081 2086) no Hoare annotation was computed. [2022-07-20 00:03:39,299 INFO L902 garLoopResultBuilder]: At program point torture_lock_busted_write_lockENTRY(lines 2081 2086) the Hoare annotation is: true [2022-07-20 00:03:39,299 INFO L899 garLoopResultBuilder]: For program point torture_lock_busted_write_lockEXIT(lines 2081 2086) no Hoare annotation was computed. [2022-07-20 00:03:39,299 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-07-20 00:03:39,300 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-07-20 00:03:39,300 INFO L899 garLoopResultBuilder]: For program point L1937-1(line 1937) no Hoare annotation was computed. [2022-07-20 00:03:39,300 INFO L902 garLoopResultBuilder]: At program point L1937-2(lines 1935 1938) the Hoare annotation is: true [2022-07-20 00:03:39,300 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-07-20 00:03:39,300 INFO L902 garLoopResultBuilder]: At program point L1945(lines 1940 1947) the Hoare annotation is: true [2022-07-20 00:03:39,300 INFO L899 garLoopResultBuilder]: For program point kmallocFINAL(lines 2871 2878) no Hoare annotation was computed. [2022-07-20 00:03:39,300 INFO L899 garLoopResultBuilder]: For program point L2874-1(line 2874) no Hoare annotation was computed. [2022-07-20 00:03:39,300 INFO L899 garLoopResultBuilder]: For program point kmallocEXIT(lines 2871 2878) no Hoare annotation was computed. [2022-07-20 00:03:39,300 INFO L899 garLoopResultBuilder]: For program point torture_randomEXIT(lines 3056 3058) no Hoare annotation was computed. [2022-07-20 00:03:39,301 INFO L902 garLoopResultBuilder]: At program point torture_randomENTRY(lines 3056 3058) the Hoare annotation is: true [2022-07-20 00:03:39,301 INFO L899 garLoopResultBuilder]: For program point torture_randomFINAL(lines 3056 3058) no Hoare annotation was computed. [2022-07-20 00:03:39,301 INFO L899 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 2016 2022) no Hoare annotation was computed. [2022-07-20 00:03:39,301 INFO L902 garLoopResultBuilder]: At program point ldv_stopENTRY(lines 2016 2022) the Hoare annotation is: true [2022-07-20 00:03:39,301 INFO L902 garLoopResultBuilder]: At program point L2298(lines 2274 2312) the Hoare annotation is: true [2022-07-20 00:03:39,301 INFO L899 garLoopResultBuilder]: For program point L2323(lines 2323 2327) no Hoare annotation was computed. [2022-07-20 00:03:39,301 INFO L899 garLoopResultBuilder]: For program point L2282(lines 2282 2285) no Hoare annotation was computed. [2022-07-20 00:03:39,301 INFO L899 garLoopResultBuilder]: For program point L2282-2(lines 2282 2285) no Hoare annotation was computed. [2022-07-20 00:03:39,301 INFO L899 garLoopResultBuilder]: For program point L2307(lines 2307 2310) no Hoare annotation was computed. [2022-07-20 00:03:39,301 INFO L902 garLoopResultBuilder]: At program point L2307-2(lines 2265 2313) the Hoare annotation is: true [2022-07-20 00:03:39,302 INFO L899 garLoopResultBuilder]: For program point L2291(lines 2291 2294) no Hoare annotation was computed. [2022-07-20 00:03:39,302 INFO L899 garLoopResultBuilder]: For program point L2291-2(lines 2291 2294) no Hoare annotation was computed. [2022-07-20 00:03:39,302 INFO L902 garLoopResultBuilder]: At program point L1903(lines 1899 1905) the Hoare annotation is: true [2022-07-20 00:03:39,302 INFO L899 garLoopResultBuilder]: For program point L2287(lines 2287 2290) no Hoare annotation was computed. [2022-07-20 00:03:39,302 INFO L899 garLoopResultBuilder]: For program point L2287-2(lines 2287 2290) no Hoare annotation was computed. [2022-07-20 00:03:39,302 INFO L899 garLoopResultBuilder]: For program point L2304(line 2304) no Hoare annotation was computed. [2022-07-20 00:03:39,302 INFO L899 garLoopResultBuilder]: For program point L2304-2(lines 2303 2305) no Hoare annotation was computed. [2022-07-20 00:03:39,302 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-07-20 00:03:39,302 INFO L899 garLoopResultBuilder]: For program point lock_torture_stats_printFINAL(lines 2314 2333) no Hoare annotation was computed. [2022-07-20 00:03:39,302 INFO L902 garLoopResultBuilder]: At program point L2296(lines 2274 2312) the Hoare annotation is: true [2022-07-20 00:03:39,303 INFO L899 garLoopResultBuilder]: For program point L2321-1(line 2321) no Hoare annotation was computed. [2022-07-20 00:03:39,303 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-07-20 00:03:39,303 INFO L899 garLoopResultBuilder]: For program point L2305-1(line 2305) no Hoare annotation was computed. [2022-07-20 00:03:39,305 INFO L899 garLoopResultBuilder]: For program point lock_torture_stats_printEXIT(lines 2314 2333) no Hoare annotation was computed. [2022-07-20 00:03:39,306 INFO L902 garLoopResultBuilder]: At program point L2330(line 2330) the Hoare annotation is: true [2022-07-20 00:03:39,306 INFO L902 garLoopResultBuilder]: At program point torture_lock_busted_write_unlockFINAL(lines 2113 2118) the Hoare annotation is: true [2022-07-20 00:03:39,306 INFO L899 garLoopResultBuilder]: For program point torture_lock_busted_write_unlockEXIT(lines 2113 2118) no Hoare annotation was computed. [2022-07-20 00:03:39,306 INFO L899 garLoopResultBuilder]: For program point lock_torture_print_module_parmsEXIT(lines 2361 2370) no Hoare annotation was computed. [2022-07-20 00:03:39,306 INFO L902 garLoopResultBuilder]: At program point lock_torture_print_module_parmsENTRY(lines 2361 2370) the Hoare annotation is: true [2022-07-20 00:03:39,306 INFO L899 garLoopResultBuilder]: For program point lock_torture_print_module_parmsFINAL(lines 2361 2370) no Hoare annotation was computed. [2022-07-20 00:03:39,306 INFO L899 garLoopResultBuilder]: For program point L2141-1(line 2141) no Hoare annotation was computed. [2022-07-20 00:03:39,306 INFO L902 garLoopResultBuilder]: At program point L2141(line 2141) the Hoare annotation is: true [2022-07-20 00:03:39,306 INFO L899 garLoopResultBuilder]: For program point torture_spin_lock_write_delayEXIT(lines 2130 2163) no Hoare annotation was computed. [2022-07-20 00:03:39,306 INFO L899 garLoopResultBuilder]: For program point L2156(line 2156) no Hoare annotation was computed. [2022-07-20 00:03:39,307 INFO L902 garLoopResultBuilder]: At program point L2957(lines 2956 2958) the Hoare annotation is: true [2022-07-20 00:03:39,307 INFO L899 garLoopResultBuilder]: For program point L2150(lines 2150 2153) no Hoare annotation was computed. [2022-07-20 00:03:39,307 INFO L902 garLoopResultBuilder]: At program point torture_spin_lock_write_delayENTRY(lines 2130 2163) the Hoare annotation is: true [2022-07-20 00:03:39,307 INFO L902 garLoopResultBuilder]: At program point L2146(lines 2142 2154) the Hoare annotation is: true [2022-07-20 00:03:39,307 INFO L899 garLoopResultBuilder]: For program point L2142(lines 2142 2155) no Hoare annotation was computed. [2022-07-20 00:03:39,307 INFO L902 garLoopResultBuilder]: At program point L2142-2(lines 2142 2155) the Hoare annotation is: true [2022-07-20 00:03:39,307 INFO L899 garLoopResultBuilder]: For program point L2157(lines 2157 2160) no Hoare annotation was computed. [2022-07-20 00:03:39,307 INFO L899 garLoopResultBuilder]: For program point L2157-2(lines 2130 2163) no Hoare annotation was computed. [2022-07-20 00:03:39,307 INFO L902 garLoopResultBuilder]: At program point L2151(lines 2142 2154) the Hoare annotation is: true [2022-07-20 00:03:39,307 INFO L899 garLoopResultBuilder]: For program point L2401(lines 2401 2410) no Hoare annotation was computed. [2022-07-20 00:03:39,307 INFO L899 garLoopResultBuilder]: For program point L2399(line 2399) no Hoare annotation was computed. [2022-07-20 00:03:39,307 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-07-20 00:03:39,307 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-07-20 00:03:39,307 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-07-20 00:03:39,307 INFO L899 garLoopResultBuilder]: For program point L2387(line 2387) no Hoare annotation was computed. [2022-07-20 00:03:39,307 INFO L899 garLoopResultBuilder]: For program point L2383(lines 2383 2397) no Hoare annotation was computed. [2022-07-20 00:03:39,307 INFO L902 garLoopResultBuilder]: At program point L2383-2(lines 2383 2397) the Hoare annotation is: true [2022-07-20 00:03:39,307 INFO L899 garLoopResultBuilder]: For program point L2379(lines 2379 2382) no Hoare annotation was computed. [2022-07-20 00:03:39,308 INFO L902 garLoopResultBuilder]: At program point L2408(line 2408) the Hoare annotation is: true [2022-07-20 00:03:39,308 INFO L902 garLoopResultBuilder]: At program point L1896(lines 1893 1898) the Hoare annotation is: true [2022-07-20 00:03:39,308 INFO L902 garLoopResultBuilder]: At program point L2406(line 2406) the Hoare annotation is: true [2022-07-20 00:03:39,308 INFO L899 garLoopResultBuilder]: For program point lock_torture_cleanupEXIT(lines 2371 2413) no Hoare annotation was computed. [2022-07-20 00:03:39,308 INFO L899 garLoopResultBuilder]: For program point L2408-1(lines 2371 2413) no Hoare annotation was computed. [2022-07-20 00:03:39,308 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-07-20 00:03:39,308 INFO L902 garLoopResultBuilder]: At program point L2402(line 2402) the Hoare annotation is: true [2022-07-20 00:03:39,308 INFO L902 garLoopResultBuilder]: At program point L2398(line 2398) the Hoare annotation is: true [2022-07-20 00:03:39,308 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-07-20 00:03:39,308 INFO L899 garLoopResultBuilder]: For program point L2394-1(line 2394) no Hoare annotation was computed. [2022-07-20 00:03:39,309 INFO L902 garLoopResultBuilder]: At program point L3049(lines 3048 3050) the Hoare annotation is: true [2022-07-20 00:03:39,309 INFO L899 garLoopResultBuilder]: For program point L2405(lines 2405 2409) no Hoare annotation was computed. [2022-07-20 00:03:39,309 INFO L902 garLoopResultBuilder]: At program point torture_init_endFINAL(lines 3037 3039) the Hoare annotation is: true [2022-07-20 00:03:39,309 INFO L899 garLoopResultBuilder]: For program point torture_init_endEXIT(lines 3037 3039) no Hoare annotation was computed. [2022-07-20 00:03:39,309 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 1956 1958) the Hoare annotation is: true [2022-07-20 00:03:39,309 INFO L899 garLoopResultBuilder]: For program point L1957(line 1957) no Hoare annotation was computed. [2022-07-20 00:03:39,309 INFO L899 garLoopResultBuilder]: For program point L1957-2(lines 1956 1958) no Hoare annotation was computed. [2022-07-20 00:03:39,309 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 1956 1958) no Hoare annotation was computed. [2022-07-20 00:03:39,309 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-07-20 00:03:39,310 INFO L899 garLoopResultBuilder]: For program point ldv_spin_unlockFINAL(lines 2929 2935) no Hoare annotation was computed. [2022-07-20 00:03:39,310 INFO L899 garLoopResultBuilder]: For program point ldv_spin_unlockEXIT(lines 2929 2935) no Hoare annotation was computed. [2022-07-20 00:03:39,310 INFO L899 garLoopResultBuilder]: For program point ldv_spin_lockEXIT(lines 2922 2928) no Hoare annotation was computed. [2022-07-20 00:03:39,310 INFO L902 garLoopResultBuilder]: At program point ldv_spin_lockENTRY(lines 2922 2928) the Hoare annotation is: true [2022-07-20 00:03:39,310 INFO L899 garLoopResultBuilder]: For program point ldv_spin_lockFINAL(lines 2922 2928) no Hoare annotation was computed. [2022-07-20 00:03:39,310 INFO L899 garLoopResultBuilder]: For program point L2177-1(line 2177) no Hoare annotation was computed. [2022-07-20 00:03:39,310 INFO L902 garLoopResultBuilder]: At program point L2177(line 2177) the Hoare annotation is: true [2022-07-20 00:03:39,310 INFO L899 garLoopResultBuilder]: For program point torture_spin_lock_write_lock_irqEXIT(lines 2173 2181) no Hoare annotation was computed. [2022-07-20 00:03:39,310 INFO L902 garLoopResultBuilder]: At program point torture_spin_lock_write_lock_irqENTRY(lines 2173 2181) the Hoare annotation is: true [2022-07-20 00:03:39,310 INFO L899 garLoopResultBuilder]: For program point torture_spin_lock_write_lock_irqFINAL(lines 2173 2181) no Hoare annotation was computed. [2022-07-20 00:03:39,311 INFO L895 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 1959 1975) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-07-20 00:03:39,311 INFO L899 garLoopResultBuilder]: For program point L1966(lines 1966 1973) no Hoare annotation was computed. [2022-07-20 00:03:39,311 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 1959 1975) no Hoare annotation was computed. [2022-07-20 00:03:39,311 INFO L902 garLoopResultBuilder]: At program point L1971(line 1971) the Hoare annotation is: true [2022-07-20 00:03:39,311 INFO L899 garLoopResultBuilder]: For program point L1971-1(line 1971) no Hoare annotation was computed. [2022-07-20 00:03:39,311 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 1959 1975) no Hoare annotation was computed. [2022-07-20 00:03:39,311 INFO L899 garLoopResultBuilder]: For program point _torture_create_kthreadFINAL(lines 2969 2971) no Hoare annotation was computed. [2022-07-20 00:03:39,311 INFO L902 garLoopResultBuilder]: At program point _torture_create_kthreadENTRY(lines 2969 2971) the Hoare annotation is: true [2022-07-20 00:03:39,311 INFO L899 garLoopResultBuilder]: For program point _torture_create_kthreadEXIT(lines 2969 2971) no Hoare annotation was computed. [2022-07-20 00:03:39,312 INFO L899 garLoopResultBuilder]: For program point L2849-1(line 2849) no Hoare annotation was computed. [2022-07-20 00:03:39,312 INFO L902 garLoopResultBuilder]: At program point L2960(lines 2959 2961) the Hoare annotation is: true [2022-07-20 00:03:39,312 INFO L899 garLoopResultBuilder]: For program point torture_spin_lock_write_lockFINAL(lines 2123 2129) no Hoare annotation was computed. [2022-07-20 00:03:39,312 INFO L902 garLoopResultBuilder]: At program point L2849(line 2849) the Hoare annotation is: true [2022-07-20 00:03:39,312 INFO L902 garLoopResultBuilder]: At program point torture_spin_lock_write_lockENTRY(lines 2123 2129) the Hoare annotation is: true [2022-07-20 00:03:39,312 INFO L902 garLoopResultBuilder]: At program point L1913(lines 1909 1915) the Hoare annotation is: true [2022-07-20 00:03:39,312 INFO L899 garLoopResultBuilder]: For program point torture_spin_lock_write_lockEXIT(lines 2123 2129) no Hoare annotation was computed. [2022-07-20 00:03:39,312 INFO L902 garLoopResultBuilder]: At program point L2851(lines 2846 2853) the Hoare annotation is: true [2022-07-20 00:03:39,312 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-07-20 00:03:39,313 INFO L899 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2022-07-20 00:03:39,313 INFO L899 garLoopResultBuilder]: For program point ##fun~~TO~VOIDEXIT(line -1) no Hoare annotation was computed. [2022-07-20 00:03:39,313 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-07-20 00:03:39,313 INFO L899 garLoopResultBuilder]: For program point L-1-5(line -1) no Hoare annotation was computed. [2022-07-20 00:03:39,313 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-07-20 00:03:39,313 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-07-20 00:03:39,313 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-07-20 00:03:39,313 INFO L899 garLoopResultBuilder]: For program point L-1-9(line -1) no Hoare annotation was computed. [2022-07-20 00:03:39,313 INFO L899 garLoopResultBuilder]: For program point L1983(lines 1983 1990) no Hoare annotation was computed. [2022-07-20 00:03:39,314 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-20 00:03:39,314 INFO L899 garLoopResultBuilder]: For program point ldv_zallocEXIT(lines 1976 1992) no Hoare annotation was computed. [2022-07-20 00:03:39,314 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-07-20 00:03:39,314 INFO L902 garLoopResultBuilder]: At program point L1988(line 1988) the Hoare annotation is: true [2022-07-20 00:03:39,314 INFO L899 garLoopResultBuilder]: For program point ldv_zallocFINAL(lines 1976 1992) no Hoare annotation was computed. [2022-07-20 00:03:39,314 INFO L899 garLoopResultBuilder]: For program point L1988-1(line 1988) no Hoare annotation was computed. [2022-07-20 00:03:39,314 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-07-20 00:03:39,314 INFO L899 garLoopResultBuilder]: For program point torture_spin_lock_write_unlockEXIT(lines 2164 2170) no Hoare annotation was computed. [2022-07-20 00:03:39,314 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-07-20 00:03:39,315 INFO L899 garLoopResultBuilder]: For program point torture_spin_lock_write_unlockFINAL(lines 2164 2170) no Hoare annotation was computed. [2022-07-20 00:03:39,315 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-07-20 00:03:39,315 INFO L899 garLoopResultBuilder]: For program point L2857-1(line 2857) no Hoare annotation was computed. [2022-07-20 00:03:39,315 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-07-20 00:03:39,315 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-07-20 00:03:39,315 INFO L902 garLoopResultBuilder]: At program point L2843(lines 2596 2845) the Hoare annotation is: true [2022-07-20 00:03:39,315 INFO L899 garLoopResultBuilder]: For program point L2744(lines 2744 2748) no Hoare annotation was computed. [2022-07-20 00:03:39,315 INFO L899 garLoopResultBuilder]: For program point L2744-2(lines 2723 2773) no Hoare annotation was computed. [2022-07-20 00:03:39,315 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-07-20 00:03:39,316 INFO L899 garLoopResultBuilder]: For program point L2612-1(line 2612) no Hoare annotation was computed. [2022-07-20 00:03:39,316 INFO L899 garLoopResultBuilder]: For program point L2579(line 2579) no Hoare annotation was computed. [2022-07-20 00:03:39,316 INFO L899 garLoopResultBuilder]: For program point L2778(line 2778) no Hoare annotation was computed. [2022-07-20 00:03:39,316 INFO L899 garLoopResultBuilder]: For program point L2745-1(line 2745) no Hoare annotation was computed. [2022-07-20 00:03:39,316 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-07-20 00:03:39,316 INFO L899 garLoopResultBuilder]: For program point L2779(lines 2779 2834) no Hoare annotation was computed. [2022-07-20 00:03:39,316 INFO L899 garLoopResultBuilder]: For program point L2713(line 2713) no Hoare annotation was computed. [2022-07-20 00:03:39,316 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-07-20 00:03:39,316 INFO L899 garLoopResultBuilder]: For program point L2614-1(line 2614) no Hoare annotation was computed. [2022-07-20 00:03:39,316 INFO L899 garLoopResultBuilder]: For program point L2813(line 2813) no Hoare annotation was computed. [2022-07-20 00:03:39,317 INFO L902 garLoopResultBuilder]: At program point L2714(line 2714) the Hoare annotation is: true [2022-07-20 00:03:39,317 INFO L899 garLoopResultBuilder]: For program point L2648(line 2648) no Hoare annotation was computed. [2022-07-20 00:03:39,317 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_~firsterr~0#1| 12) 0) (<= (+ ~nwriters_stress~0 1) 0)) [2022-07-20 00:03:39,317 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) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-07-20 00:03:39,317 INFO L899 garLoopResultBuilder]: For program point L2516-1(lines 2425 2585) no Hoare annotation was computed. [2022-07-20 00:03:39,317 INFO L902 garLoopResultBuilder]: At program point L2979(lines 2978 2980) the Hoare annotation is: true [2022-07-20 00:03:39,317 INFO L899 garLoopResultBuilder]: For program point L2814(lines 2814 2819) no Hoare annotation was computed. [2022-07-20 00:03:39,317 INFO L899 garLoopResultBuilder]: For program point L2781(lines 2781 2831) no Hoare annotation was computed. [2022-07-20 00:03:39,317 INFO L899 garLoopResultBuilder]: For program point L2649(lines 2649 2653) no Hoare annotation was computed. [2022-07-20 00:03:39,318 INFO L899 garLoopResultBuilder]: For program point L2649-2(lines 2628 2678) no Hoare annotation was computed. [2022-07-20 00:03:39,318 INFO L899 garLoopResultBuilder]: For program point L2583(line 2583) no Hoare annotation was computed. [2022-07-20 00:03:39,318 INFO L899 garLoopResultBuilder]: For program point L2484(line 2484) no Hoare annotation was computed. [2022-07-20 00:03:39,318 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) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-07-20 00:03:39,318 INFO L899 garLoopResultBuilder]: For program point L2782(line 2782) no Hoare annotation was computed. [2022-07-20 00:03:39,318 INFO L895 garLoopResultBuilder]: At program point L2650(line 2650) the Hoare annotation is: false [2022-07-20 00:03:39,318 INFO L899 garLoopResultBuilder]: For program point L2683(line 2683) no Hoare annotation was computed. [2022-07-20 00:03:39,318 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-07-20 00:03:39,318 INFO L899 garLoopResultBuilder]: For program point L2650-1(line 2650) no Hoare annotation was computed. [2022-07-20 00:03:39,318 INFO L899 garLoopResultBuilder]: For program point L2518(lines 2518 2521) no Hoare annotation was computed. [2022-07-20 00:03:39,319 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) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-07-20 00:03:39,319 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-07-20 00:03:39,319 INFO L899 garLoopResultBuilder]: For program point L2783(lines 2783 2787) no Hoare annotation was computed. [2022-07-20 00:03:39,319 INFO L899 garLoopResultBuilder]: For program point L2684(lines 2684 2718) no Hoare annotation was computed. [2022-07-20 00:03:39,319 INFO L899 garLoopResultBuilder]: For program point L2750-1(line 2750) no Hoare annotation was computed. [2022-07-20 00:03:39,319 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) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-07-20 00:03:39,319 INFO L899 garLoopResultBuilder]: For program point L2486-1(line 2486) no Hoare annotation was computed. [2022-07-20 00:03:39,319 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-07-20 00:03:39,319 INFO L899 garLoopResultBuilder]: For program point L2883-1(line 2883) no Hoare annotation was computed. [2022-07-20 00:03:39,320 INFO L895 garLoopResultBuilder]: At program point L2883(line 2883) the Hoare annotation is: false [2022-07-20 00:03:39,320 INFO L895 garLoopResultBuilder]: At program point L2784(line 2784) the Hoare annotation is: false [2022-07-20 00:03:39,320 INFO L899 garLoopResultBuilder]: For program point L2784-1(line 2784) no Hoare annotation was computed. [2022-07-20 00:03:39,320 INFO L895 garLoopResultBuilder]: At program point L2884(lines 2880 2886) the Hoare annotation is: false [2022-07-20 00:03:39,320 INFO L899 garLoopResultBuilder]: For program point L2686(lines 2686 2715) no Hoare annotation was computed. [2022-07-20 00:03:39,320 INFO L899 garLoopResultBuilder]: For program point L2554(lines 2554 2557) no Hoare annotation was computed. [2022-07-20 00:03:39,320 INFO L899 garLoopResultBuilder]: For program point L2488(lines 2488 2496) no Hoare annotation was computed. [2022-07-20 00:03:39,320 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) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-07-20 00:03:39,320 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) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-07-20 00:03:39,321 INFO L899 garLoopResultBuilder]: For program point L2720(line 2720) no Hoare annotation was computed. [2022-07-20 00:03:39,321 INFO L899 garLoopResultBuilder]: For program point L2687(line 2687) no Hoare annotation was computed. [2022-07-20 00:03:39,321 INFO L899 garLoopResultBuilder]: For program point L2489(lines 2489 2492) no Hoare annotation was computed. [2022-07-20 00:03:39,321 INFO L899 garLoopResultBuilder]: For program point L2489-2(lines 2489 2492) no Hoare annotation was computed. [2022-07-20 00:03:39,321 INFO L899 garLoopResultBuilder]: For program point L2688(lines 2688 2693) no Hoare annotation was computed. [2022-07-20 00:03:39,321 INFO L899 garLoopResultBuilder]: For program point L2721(lines 2721 2776) no Hoare annotation was computed. [2022-07-20 00:03:39,321 INFO L899 garLoopResultBuilder]: For program point L2655-1(line 2655) no Hoare annotation was computed. [2022-07-20 00:03:39,321 INFO L895 garLoopResultBuilder]: At program point L2655(line 2655) the Hoare annotation is: false [2022-07-20 00:03:39,321 INFO L895 garLoopResultBuilder]: At program point L2986(lines 2985 2987) the Hoare annotation is: false [2022-07-20 00:03:39,321 INFO L899 garLoopResultBuilder]: For program point L2821(line 2821) no Hoare annotation was computed. [2022-07-20 00:03:39,322 INFO L899 garLoopResultBuilder]: For program point L2755(line 2755) no Hoare annotation was computed. [2022-07-20 00:03:39,322 INFO L899 garLoopResultBuilder]: For program point L2689-1(line 2689) no Hoare annotation was computed. [2022-07-20 00:03:39,322 INFO L895 garLoopResultBuilder]: At program point L2689(line 2689) the Hoare annotation is: (and (= ~ldv_spin~0 0) (<= (+ ~nwriters_stress~0 1) 0)) [2022-07-20 00:03:39,322 INFO L899 garLoopResultBuilder]: For program point L2524-1(lines 2425 2585) no Hoare annotation was computed. [2022-07-20 00:03:39,322 INFO L895 garLoopResultBuilder]: At program point L3053(lines 3052 3054) the Hoare annotation is: false [2022-07-20 00:03:39,322 INFO L899 garLoopResultBuilder]: For program point L2822(lines 2822 2827) no Hoare annotation was computed. [2022-07-20 00:03:39,322 INFO L899 garLoopResultBuilder]: For program point L2756(lines 2756 2761) no Hoare annotation was computed. [2022-07-20 00:03:39,322 INFO L899 garLoopResultBuilder]: For program point L2789(line 2789) no Hoare annotation was computed. [2022-07-20 00:03:39,322 INFO L899 garLoopResultBuilder]: For program point L2723(lines 2723 2773) no Hoare annotation was computed. [2022-07-20 00:03:39,322 INFO L899 garLoopResultBuilder]: For program point L2624(lines 2624 2838) no Hoare annotation was computed. [2022-07-20 00:03:39,323 INFO L899 garLoopResultBuilder]: For program point L2558(lines 2558 2561) no Hoare annotation was computed. [2022-07-20 00:03:39,323 INFO L899 garLoopResultBuilder]: For program point L2790(lines 2790 2794) no Hoare annotation was computed. [2022-07-20 00:03:39,323 INFO L899 garLoopResultBuilder]: For program point L2724(line 2724) no Hoare annotation was computed. [2022-07-20 00:03:39,323 INFO L899 garLoopResultBuilder]: For program point L2790-2(lines 2781 2831) no Hoare annotation was computed. [2022-07-20 00:03:39,323 INFO L899 garLoopResultBuilder]: For program point L2625(line 2625) no Hoare annotation was computed. [2022-07-20 00:03:39,323 INFO L899 garLoopResultBuilder]: For program point L2526(lines 2526 2529) no Hoare annotation was computed. [2022-07-20 00:03:39,323 INFO L899 garLoopResultBuilder]: For program point L2791-1(line 2791) no Hoare annotation was computed. [2022-07-20 00:03:39,323 INFO L895 garLoopResultBuilder]: At program point L2791(line 2791) the Hoare annotation is: false [2022-07-20 00:03:39,323 INFO L899 garLoopResultBuilder]: For program point L2725(lines 2725 2729) no Hoare annotation was computed. [2022-07-20 00:03:39,323 INFO L899 garLoopResultBuilder]: For program point L2626(lines 2626 2681) no Hoare annotation was computed. [2022-07-20 00:03:39,324 INFO L895 garLoopResultBuilder]: At program point L2990(lines 2989 2991) the Hoare annotation is: false [2022-07-20 00:03:39,324 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-07-20 00:03:39,324 INFO L899 garLoopResultBuilder]: For program point L2660(line 2660) no Hoare annotation was computed. [2022-07-20 00:03:39,324 INFO L899 garLoopResultBuilder]: For program point L2726-1(line 2726) no Hoare annotation was computed. [2022-07-20 00:03:39,324 INFO L899 garLoopResultBuilder]: For program point L2628(lines 2628 2678) no Hoare annotation was computed. [2022-07-20 00:03:39,324 INFO L899 garLoopResultBuilder]: For program point L2661(lines 2661 2666) no Hoare annotation was computed. [2022-07-20 00:03:39,324 INFO L899 garLoopResultBuilder]: For program point L2695(line 2695) no Hoare annotation was computed. [2022-07-20 00:03:39,324 INFO L899 garLoopResultBuilder]: For program point L2629(line 2629) no Hoare annotation was computed. [2022-07-20 00:03:39,324 INFO L895 garLoopResultBuilder]: At program point L2563(lines 2425 2585) the Hoare annotation is: false [2022-07-20 00:03:39,324 INFO L895 garLoopResultBuilder]: At program point L2464(lines 2456 2472) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ ~nwriters_stress~0 1) 0)) [2022-07-20 00:03:39,325 INFO L899 garLoopResultBuilder]: For program point L2431(lines 2431 2435) no Hoare annotation was computed. [2022-07-20 00:03:39,325 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-20 00:03:39,325 INFO L899 garLoopResultBuilder]: For program point L2431-2(lines 2425 2585) no Hoare annotation was computed. [2022-07-20 00:03:39,325 INFO L899 garLoopResultBuilder]: For program point L2696(lines 2696 2711) no Hoare annotation was computed. [2022-07-20 00:03:39,325 INFO L899 garLoopResultBuilder]: For program point L2630(lines 2630 2634) no Hoare annotation was computed. [2022-07-20 00:03:39,325 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-07-20 00:03:39,325 INFO L895 garLoopResultBuilder]: At program point L2796(line 2796) the Hoare annotation is: false [2022-07-20 00:03:39,325 INFO L899 garLoopResultBuilder]: For program point L2829(line 2829) no Hoare annotation was computed. [2022-07-20 00:03:39,325 INFO L899 garLoopResultBuilder]: For program point L2763(line 2763) no Hoare annotation was computed. [2022-07-20 00:03:39,326 INFO L899 garLoopResultBuilder]: For program point L2796-1(line 2796) no Hoare annotation was computed. [2022-07-20 00:03:39,326 INFO L899 garLoopResultBuilder]: For program point L2631-1(line 2631) no Hoare annotation was computed. [2022-07-20 00:03:39,326 INFO L895 garLoopResultBuilder]: At program point L2631(line 2631) the Hoare annotation is: false [2022-07-20 00:03:39,326 INFO L895 garLoopResultBuilder]: At program point L2565(lines 2425 2585) the Hoare annotation is: false [2022-07-20 00:03:39,326 INFO L895 garLoopResultBuilder]: At program point L2466(lines 2456 2472) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ ~nwriters_stress~0 1) 0)) [2022-07-20 00:03:39,326 INFO L899 garLoopResultBuilder]: For program point L2532-1(lines 2532 2539) no Hoare annotation was computed. [2022-07-20 00:03:39,326 INFO L895 garLoopResultBuilder]: At program point L3061(lines 3060 3062) the Hoare annotation is: false [2022-07-20 00:03:39,326 INFO L902 garLoopResultBuilder]: At program point L2830(line 2830) the Hoare annotation is: true [2022-07-20 00:03:39,326 INFO L899 garLoopResultBuilder]: For program point L2764(lines 2764 2769) no Hoare annotation was computed. [2022-07-20 00:03:39,326 INFO L899 garLoopResultBuilder]: For program point L2698(lines 2698 2704) no Hoare annotation was computed. [2022-07-20 00:03:39,327 INFO L899 garLoopResultBuilder]: For program point L2731(line 2731) no Hoare annotation was computed. [2022-07-20 00:03:39,327 INFO L899 garLoopResultBuilder]: For program point L2698-2(lines 2696 2710) no Hoare annotation was computed. [2022-07-20 00:03:39,327 INFO L899 garLoopResultBuilder]: For program point L2732(lines 2732 2736) no Hoare annotation was computed. [2022-07-20 00:03:39,327 INFO L899 garLoopResultBuilder]: For program point L2732-2(lines 2723 2773) no Hoare annotation was computed. [2022-07-20 00:03:39,327 INFO L899 garLoopResultBuilder]: For program point L2534(lines 2534 2537) no Hoare annotation was computed. [2022-07-20 00:03:39,327 INFO L899 garLoopResultBuilder]: For program point L2733-1(line 2733) no Hoare annotation was computed. [2022-07-20 00:03:39,327 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-07-20 00:03:39,327 INFO L899 garLoopResultBuilder]: For program point L2568(lines 2568 2578) no Hoare annotation was computed. [2022-07-20 00:03:39,327 INFO L895 garLoopResultBuilder]: At program point L2568-2(lines 2568 2578) the Hoare annotation is: false [2022-07-20 00:03:39,327 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-20 00:03:39,328 INFO L895 garLoopResultBuilder]: At program point L2998(lines 2997 2999) the Hoare annotation is: false [2022-07-20 00:03:39,328 INFO L899 garLoopResultBuilder]: For program point L2668(line 2668) no Hoare annotation was computed. [2022-07-20 00:03:39,328 INFO L899 garLoopResultBuilder]: For program point L2569-1(lines 2569 2572) no Hoare annotation was computed. [2022-07-20 00:03:39,328 INFO L895 garLoopResultBuilder]: At program point L2569(lines 2569 2572) the Hoare annotation is: false [2022-07-20 00:03:39,328 INFO L895 garLoopResultBuilder]: At program point L2470(line 2470) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ ~nwriters_stress~0 1) 0)) [2022-07-20 00:03:39,328 INFO L895 garLoopResultBuilder]: At program point L2503(lines 2425 2585) the Hoare annotation is: false [2022-07-20 00:03:39,328 INFO L899 garLoopResultBuilder]: For program point L2470-1(line 2470) no Hoare annotation was computed. [2022-07-20 00:03:39,328 INFO L899 garLoopResultBuilder]: For program point L2801(line 2801) no Hoare annotation was computed. [2022-07-20 00:03:39,328 INFO L899 garLoopResultBuilder]: For program point L2636(line 2636) no Hoare annotation was computed. [2022-07-20 00:03:39,328 INFO L899 garLoopResultBuilder]: For program point L2669(lines 2669 2674) no Hoare annotation was computed. [2022-07-20 00:03:39,328 INFO L899 garLoopResultBuilder]: For program point L2802(lines 2802 2806) no Hoare annotation was computed. [2022-07-20 00:03:39,329 INFO L899 garLoopResultBuilder]: For program point L2802-2(lines 2781 2831) no Hoare annotation was computed. [2022-07-20 00:03:39,329 INFO L899 garLoopResultBuilder]: For program point L2637(lines 2637 2641) no Hoare annotation was computed. [2022-07-20 00:03:39,329 INFO L899 garLoopResultBuilder]: For program point L2637-2(lines 2628 2678) no Hoare annotation was computed. [2022-07-20 00:03:39,329 INFO L895 garLoopResultBuilder]: At program point L2505(lines 2425 2585) the Hoare annotation is: false [2022-07-20 00:03:39,329 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-20 00:03:39,329 INFO L899 garLoopResultBuilder]: For program point L2836(line 2836) no Hoare annotation was computed. [2022-07-20 00:03:39,329 INFO L899 garLoopResultBuilder]: For program point L2803-1(line 2803) no Hoare annotation was computed. [2022-07-20 00:03:39,329 INFO L895 garLoopResultBuilder]: At program point L2803(line 2803) the Hoare annotation is: false [2022-07-20 00:03:39,329 INFO L895 garLoopResultBuilder]: At program point L2638(line 2638) the Hoare annotation is: false [2022-07-20 00:03:39,329 INFO L899 garLoopResultBuilder]: For program point L2638-1(line 2638) no Hoare annotation was computed. [2022-07-20 00:03:39,330 INFO L895 garLoopResultBuilder]: At program point L3068(lines 3067 3069) the Hoare annotation is: false [2022-07-20 00:03:39,330 INFO L895 garLoopResultBuilder]: At program point L3002(lines 3001 3003) the Hoare annotation is: false [2022-07-20 00:03:39,330 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-07-20 00:03:39,330 INFO L902 garLoopResultBuilder]: At program point L2837(line 2837) the Hoare annotation is: true [2022-07-20 00:03:39,330 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-07-20 00:03:39,330 INFO L899 garLoopResultBuilder]: For program point L2771(line 2771) no Hoare annotation was computed. [2022-07-20 00:03:39,330 INFO L899 garLoopResultBuilder]: For program point L2738-1(line 2738) no Hoare annotation was computed. [2022-07-20 00:03:39,330 INFO L899 garLoopResultBuilder]: For program point L2573(lines 2573 2576) no Hoare annotation was computed. [2022-07-20 00:03:39,330 INFO L899 garLoopResultBuilder]: For program point L2474(lines 2474 2477) no Hoare annotation was computed. [2022-07-20 00:03:39,330 INFO L899 garLoopResultBuilder]: For program point L2474-2(lines 2425 2585) no Hoare annotation was computed. [2022-07-20 00:03:39,331 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) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-07-20 00:03:39,331 INFO L902 garLoopResultBuilder]: At program point L2772(line 2772) the Hoare annotation is: true [2022-07-20 00:03:39,331 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_~firsterr~0#1| 12) 0) (<= (+ ~nwriters_stress~0 1) 0)) [2022-07-20 00:03:39,331 INFO L899 garLoopResultBuilder]: For program point L2508(lines 2508 2515) no Hoare annotation was computed. [2022-07-20 00:03:39,331 INFO L899 garLoopResultBuilder]: For program point L2475-1(line 2475) no Hoare annotation was computed. [2022-07-20 00:03:39,331 INFO L899 garLoopResultBuilder]: For program point L2508-2(lines 2425 2585) no Hoare annotation was computed. [2022-07-20 00:03:39,331 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) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-07-20 00:03:39,331 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-07-20 00:03:39,331 INFO L902 garLoopResultBuilder]: At program point L2707(lines 2609 2844) the Hoare annotation is: true [2022-07-20 00:03:39,332 INFO L899 garLoopResultBuilder]: For program point L2542(lines 2542 2550) no Hoare annotation was computed. [2022-07-20 00:03:39,332 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-20 00:03:39,332 INFO L899 garLoopResultBuilder]: For program point L2510(lines 2510 2513) no Hoare annotation was computed. [2022-07-20 00:03:39,332 INFO L899 garLoopResultBuilder]: For program point L2543(lines 2543 2546) no Hoare annotation was computed. [2022-07-20 00:03:39,332 INFO L899 garLoopResultBuilder]: For program point L2543-2(lines 2543 2546) no Hoare annotation was computed. [2022-07-20 00:03:39,332 INFO L895 garLoopResultBuilder]: At program point L3072(lines 3071 3073) the Hoare annotation is: false [2022-07-20 00:03:39,332 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-07-20 00:03:39,332 INFO L895 garLoopResultBuilder]: At program point L2808(line 2808) the Hoare annotation is: false [2022-07-20 00:03:39,332 INFO L899 garLoopResultBuilder]: For program point L2808-1(line 2808) no Hoare annotation was computed. [2022-07-20 00:03:39,332 INFO L899 garLoopResultBuilder]: For program point L2676(line 2676) no Hoare annotation was computed. [2022-07-20 00:03:39,333 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-07-20 00:03:39,333 INFO L899 garLoopResultBuilder]: For program point L2643-1(line 2643) no Hoare annotation was computed. [2022-07-20 00:03:39,333 INFO L895 garLoopResultBuilder]: At program point L2643(line 2643) the Hoare annotation is: false [2022-07-20 00:03:39,333 INFO L899 garLoopResultBuilder]: For program point L2610-1(line 2610) no Hoare annotation was computed. [2022-07-20 00:03:39,333 INFO L899 garLoopResultBuilder]: For program point L2445(lines 2445 2448) no Hoare annotation was computed. [2022-07-20 00:03:39,333 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) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-07-20 00:03:39,333 INFO L899 garLoopResultBuilder]: For program point L2743(line 2743) no Hoare annotation was computed. [2022-07-20 00:03:39,333 INFO L902 garLoopResultBuilder]: At program point L2677(line 2677) the Hoare annotation is: true [2022-07-20 00:03:39,333 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-07-20 00:03:39,333 INFO L899 garLoopResultBuilder]: For program point ldv_check_alloc_flagsEXIT(lines 2889 2898) no Hoare annotation was computed. [2022-07-20 00:03:39,334 INFO L899 garLoopResultBuilder]: For program point L2892(lines 2892 2895) no Hoare annotation was computed. [2022-07-20 00:03:39,334 INFO L899 garLoopResultBuilder]: For program point L2894-1(lines 2889 2898) no Hoare annotation was computed. [2022-07-20 00:03:39,334 INFO L902 garLoopResultBuilder]: At program point ldv_check_alloc_flagsENTRY(lines 2889 2898) the Hoare annotation is: true [2022-07-20 00:03:39,336 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 00:03:39,338 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-20 00:03:39,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 12:03:39 BoogieIcfgContainer [2022-07-20 00:03:39,373 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-20 00:03:39,374 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-20 00:03:39,374 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-20 00:03:39,374 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-20 00:03:39,375 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 12:00:00" (3/4) ... [2022-07-20 00:03:39,377 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-20 00:03:39,381 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _torture_stop_kthread [2022-07-20 00:03:39,382 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2022-07-20 00:03:39,382 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_lock_busted_write_delay [2022-07-20 00:03:39,382 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_lock_spin_write_unlock_irq [2022-07-20 00:03:39,382 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __const_udelay [2022-07-20 00:03:39,382 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2022-07-20 00:03:39,382 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_lock_busted_write_lock [2022-07-20 00:03:39,382 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kmalloc [2022-07-20 00:03:39,382 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_random [2022-07-20 00:03:39,382 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2022-07-20 00:03:39,383 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure lock_torture_stats_print [2022-07-20 00:03:39,383 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_lock_busted_write_unlock [2022-07-20 00:03:39,383 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure lock_torture_print_module_parms [2022-07-20 00:03:39,383 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_delay [2022-07-20 00:03:39,383 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure lock_torture_cleanup [2022-07-20 00:03:39,383 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_init_end [2022-07-20 00:03:39,383 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-20 00:03:39,383 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_spin_unlock [2022-07-20 00:03:39,383 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_spin_lock [2022-07-20 00:03:39,383 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_lock_irq [2022-07-20 00:03:39,383 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-07-20 00:03:39,384 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _torture_create_kthread [2022-07-20 00:03:39,384 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_lock [2022-07-20 00:03:39,384 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~~TO~VOID [2022-07-20 00:03:39,384 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2022-07-20 00:03:39,384 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_unlock [2022-07-20 00:03:39,384 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_check_alloc_flags [2022-07-20 00:03:39,402 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 126 nodes and edges [2022-07-20 00:03:39,403 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 39 nodes and edges [2022-07-20 00:03:39,404 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-07-20 00:03:39,405 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-20 00:03:39,406 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-20 00:03:39,407 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-20 00:03:39,408 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-20 00:03:39,457 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-07-20 00:03:39,458 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-07-20 00:03:39,458 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-07-20 00:03:39,459 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-07-20 00:03:39,516 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-20 00:03:39,516 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-20 00:03:39,517 INFO L158 Benchmark]: Toolchain (without parser) took 221022.64ms. Allocated memory was 96.5MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 48.6MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 446.9MB. Max. memory is 16.1GB. [2022-07-20 00:03:39,517 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory is still 69.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 00:03:39,518 INFO L158 Benchmark]: CACSL2BoogieTranslator took 719.42ms. Allocated memory was 96.5MB in the beginning and 138.4MB in the end (delta: 41.9MB). Free memory was 48.4MB in the beginning and 90.9MB in the end (delta: -42.4MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2022-07-20 00:03:39,518 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.12ms. Allocated memory is still 138.4MB. Free memory was 90.9MB in the beginning and 85.0MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-20 00:03:39,518 INFO L158 Benchmark]: Boogie Preprocessor took 74.19ms. Allocated memory is still 138.4MB. Free memory was 85.0MB in the beginning and 80.2MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-20 00:03:39,519 INFO L158 Benchmark]: RCFGBuilder took 882.07ms. Allocated memory is still 138.4MB. Free memory was 80.2MB in the beginning and 75.5MB in the end (delta: 4.7MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2022-07-20 00:03:39,519 INFO L158 Benchmark]: TraceAbstraction took 219143.96ms. Allocated memory was 138.4MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 74.9MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2022-07-20 00:03:39,520 INFO L158 Benchmark]: Witness Printer took 142.38ms. Allocated memory is still 2.1GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-20 00:03:39,522 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.15ms. Allocated memory is still 96.5MB. Free memory is still 69.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 719.42ms. Allocated memory was 96.5MB in the beginning and 138.4MB in the end (delta: 41.9MB). Free memory was 48.4MB in the beginning and 90.9MB in the end (delta: -42.4MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.12ms. Allocated memory is still 138.4MB. Free memory was 90.9MB in the beginning and 85.0MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.19ms. Allocated memory is still 138.4MB. Free memory was 85.0MB in the beginning and 80.2MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 882.07ms. Allocated memory is still 138.4MB. Free memory was 80.2MB in the beginning and 75.5MB in the end (delta: 4.7MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. * TraceAbstraction took 219143.96ms. Allocated memory was 138.4MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 74.9MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 142.38ms. Allocated memory is still 2.1GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 16.0MB). 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, 348 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 219.1s, OverallIterations: 15, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 201.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10867 SdHoareTripleChecker+Valid, 7.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10445 mSDsluCounter, 19242 SdHoareTripleChecker+Invalid, 6.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11280 mSDsCounter, 4452 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7304 IncrementalHoareTripleChecker+Invalid, 11756 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4452 mSolverCounterUnsat, 7962 mSDtfsCounter, 7304 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 650 GetRequests, 525 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19472occurred in iteration=12, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 15 MinimizatonAttempts, 7240 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 139 LocationsWithAnnotation, 21749 PreInvPairs, 23013 NumberOfFragments, 1944 HoareAnnotationTreeSize, 21749 FomulaSimplifications, 8815990 FormulaSimplificationTreeSizeReduction, 197.6s HoareSimplificationTime, 139 FomulaSimplificationsInter, 1252254 FormulaSimplificationTreeSizeReductionInter, 3.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1696 NumberOfCodeBlocks, 1696 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1679 ConstructedInterpolants, 0 QuantifiedInterpolants, 3201 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2130 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 17 InterpolantComputations, 15 PerfectInterpolantSequences, 463/489 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 3071]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2862]: Loop Invariant Derived loop invariant: ((((((!(ldv_state_variable_1 == 0) || !(onoff_interval == 0)) || !(0 == lwsa)) || !(nwriters_stress + 1 <= 0)) || ldv_spin == 0) || !(ldv_state_variable_0 == 1)) || !(ldv_state_variable_2 == 0)) || !(lwsa == 0) - InvariantResult [Line: 1917]: Loop Invariant Derived loop invariant: ((((((!(ldv_state_variable_1 == 0) || !(onoff_interval == 0)) || !(0 == lwsa)) || !(nwriters_stress + 1 <= 0)) || ldv_spin == 0) || !(ldv_state_variable_0 == 1)) || !(ldv_state_variable_2 == 0)) || !(lwsa == 0) - InvariantResult [Line: 2956]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1875]: Loop Invariant Derived loop invariant: ((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 3060]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2425]: Loop Invariant Derived loop invariant: ((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 3067]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2959]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2096]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2142]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2965]: Loop Invariant Derived loop invariant: ((((((!(ldv_state_variable_1 == 0) || !(onoff_interval == 0)) || !(0 == lwsa)) || !(nwriters_stress + 1 <= 0)) || ldv_spin == 0) || !(ldv_state_variable_0 == 1)) || !(ldv_state_variable_2 == 0)) || !(lwsa == 0) - InvariantResult [Line: 2425]: Loop Invariant Derived loop invariant: ((ldv_state_variable_0 == 1 && ldv_spin == 0) && firsterr + 12 <= 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 1935]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2383]: Loop Invariant Derived loop invariant: (((!(ldv_spin == 0) || !(nwriters_stress + 1 <= 0)) || !(ldv_state_variable_0 == 1)) || (writer_tasks == \old(writer_tasks) && \old(writer_tasks) == writer_tasks)) && ((!(ldv_spin == 0) || !(nwriters_stress + 1 <= 0)) || (\old(unknown-#length-unknown) == unknown-#length-unknown && \old(\valid) == \valid)) - InvariantResult [Line: 2997]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3005]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) || (((((onoff_interval == 0 && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && nwriters_stress + 1 <= 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 3030]: Loop Invariant Derived loop invariant: (((!(ldv_spin == 0) || !(nwriters_stress + 1 <= 0)) || !(ldv_state_variable_0 == 1)) || (writer_tasks == \old(writer_tasks) && \old(writer_tasks) == writer_tasks)) && ((!(ldv_spin == 0) || !(nwriters_stress + 1 <= 0)) || (\old(unknown-#length-unknown) == unknown-#length-unknown && \old(\valid) == \valid)) - InvariantResult [Line: 2142]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2383]: Loop Invariant Derived loop invariant: (((!(ldv_spin == 0) || !(nwriters_stress + 1 <= 0)) || !(ldv_state_variable_0 == 1)) || (writer_tasks == \old(writer_tasks) && \old(writer_tasks) == writer_tasks)) && ((!(ldv_spin == 0) || !(nwriters_stress + 1 <= 0)) || (\old(unknown-#length-unknown) == unknown-#length-unknown && \old(\valid) == \valid)) - InvariantResult [Line: 1893]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2096]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2985]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2414]: Loop Invariant Derived loop invariant: ((ldv_state_variable_0 == 1 && \result + 16 <= 0) && nwriters_stress + 1 <= 0) || (((ldv_state_variable_0 == 1 && firsterr + 12 <= 0) && \result + 12 <= 0) && nwriters_stress + 1 <= 0) - InvariantResult [Line: 2425]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1909]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2425]: Loop Invariant Derived loop invariant: ((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 3034]: Loop Invariant Derived loop invariant: ((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 2854]: Loop Invariant Derived loop invariant: ((((((!(ldv_state_variable_1 == 0) || !(onoff_interval == 0)) || !(0 == lwsa)) || !(nwriters_stress + 1 <= 0)) || ldv_spin == 0) || !(ldv_state_variable_0 == 1)) || !(ldv_state_variable_2 == 0)) || !(lwsa == 0) - InvariantResult [Line: 2981]: Loop Invariant Derived loop invariant: ((((((onoff_interval == 0 && ldv_state_variable_2 == 0) && ldv_spin == 0) && 0 <= ref_cnt) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 2846]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2609]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) || (((((onoff_interval == 0 && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && nwriters_stress + 1 <= 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 2596]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2425]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2425]: Loop Invariant Derived loop invariant: ((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 3001]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2609]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2950]: Loop Invariant Derived loop invariant: ((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 2016]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2425]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1885]: Loop Invariant Derived loop invariant: ((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 2993]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) || (((((onoff_interval == 0 && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && nwriters_stress + 1 <= 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 2962]: Loop Invariant Derived loop invariant: ((((((!(ldv_state_variable_1 == 0) || !(onoff_interval == 0)) || !(0 == lwsa)) || !(nwriters_stress + 1 <= 0)) || ldv_spin == 0) || !(ldv_state_variable_0 == 1)) || !(ldv_state_variable_2 == 0)) || !(lwsa == 0) - InvariantResult [Line: 2456]: Loop Invariant Derived loop invariant: ldv_state_variable_0 == 1 && nwriters_stress + 1 <= 0 - InvariantResult [Line: 2265]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2880]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2978]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2989]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2274]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1940]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3052]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3048]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2456]: Loop Invariant Derived loop invariant: ldv_state_variable_0 == 1 && nwriters_stress + 1 <= 0 - InvariantResult [Line: 2274]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2425]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1899]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1925]: Loop Invariant Derived loop invariant: ((((((!(ldv_state_variable_1 == 0) || !(onoff_interval == 0)) || !(0 == lwsa)) || !(nwriters_stress + 1 <= 0)) || ldv_spin == 0) || !(ldv_state_variable_0 == 1)) || !(ldv_state_variable_2 == 0)) || !(lwsa == 0) RESULT: Ultimate proved your program to be correct! [2022-07-20 00:03:39,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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