./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 173e3943 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.1-dev-173e394 [2021-11-06 15:13:19,912 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 15:13:19,913 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 15:13:19,968 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 15:13:19,969 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 15:13:19,970 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 15:13:19,971 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 15:13:19,973 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 15:13:19,977 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 15:13:19,980 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 15:13:19,981 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 15:13:19,983 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 15:13:19,983 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 15:13:19,985 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 15:13:19,986 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 15:13:19,987 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 15:13:19,988 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 15:13:19,991 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 15:13:19,992 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 15:13:19,996 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 15:13:19,998 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 15:13:20,000 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 15:13:20,001 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 15:13:20,002 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 15:13:20,005 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 15:13:20,005 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 15:13:20,006 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 15:13:20,009 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 15:13:20,011 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 15:13:20,011 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 15:13:20,012 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 15:13:20,012 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 15:13:20,013 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 15:13:20,014 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 15:13:20,015 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 15:13:20,016 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 15:13:20,017 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 15:13:20,018 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 15:13:20,018 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 15:13:20,018 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 15:13:20,019 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 15:13:20,020 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-06 15:13:20,044 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 15:13:20,045 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 15:13:20,045 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 15:13:20,045 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 15:13:20,046 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 15:13:20,046 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 15:13:20,046 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 15:13:20,046 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 15:13:20,047 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 15:13:20,047 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 15:13:20,047 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 15:13:20,047 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 15:13:20,047 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 15:13:20,047 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 15:13:20,047 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 15:13:20,047 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 15:13:20,048 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 15:13:20,048 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 15:13:20,048 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 15:13:20,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 15:13:20,048 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 15:13:20,048 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 15:13:20,049 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 15:13:20,049 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 15:13:20,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 15:13:20,049 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 15:13:20,049 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 15:13:20,049 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 15:13:20,049 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 15:13:20,049 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 [2021-11-06 15:13:20,292 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 15:13:20,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 15:13:20,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 15:13:20,320 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 15:13:20,321 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 15:13:20,322 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 [2021-11-06 15:13:20,377 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5c1f21dc/b6d01dd52b144838a7967aa1042818e3/FLAG0e14b5bc6 [2021-11-06 15:13:20,967 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 15:13:20,968 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 [2021-11-06 15:13:20,999 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5c1f21dc/b6d01dd52b144838a7967aa1042818e3/FLAG0e14b5bc6 [2021-11-06 15:13:21,213 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5c1f21dc/b6d01dd52b144838a7967aa1042818e3 [2021-11-06 15:13:21,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 15:13:21,216 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 15:13:21,219 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 15:13:21,219 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 15:13:21,222 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 15:13:21,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 03:13:21" (1/1) ... [2021-11-06 15:13:21,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d228a7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:13:21, skipping insertion in model container [2021-11-06 15:13:21,224 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 03:13:21" (1/1) ... [2021-11-06 15:13:21,230 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 15:13:21,301 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 15:13:21,584 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1764] [2021-11-06 15:13:21,585 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1765-1766] [2021-11-06 15:13:21,686 WARN L228 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] [2021-11-06 15:13:21,872 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 15:13:21,891 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 15:13:21,936 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1764] [2021-11-06 15:13:21,938 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1765-1766] [2021-11-06 15:13:21,945 WARN L228 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] [2021-11-06 15:13:22,014 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 15:13:22,042 INFO L208 MainTranslator]: Completed translation [2021-11-06 15:13:22,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:13:22 WrapperNode [2021-11-06 15:13:22,043 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 15:13:22,044 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 15:13:22,044 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 15:13:22,044 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 15:13:22,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:13:22" (1/1) ... [2021-11-06 15:13:22,085 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:13:22" (1/1) ... [2021-11-06 15:13:22,174 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 15:13:22,175 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 15:13:22,175 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 15:13:22,175 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 15:13:22,182 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:13:22" (1/1) ... [2021-11-06 15:13:22,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:13:22" (1/1) ... [2021-11-06 15:13:22,191 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:13:22" (1/1) ... [2021-11-06 15:13:22,191 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:13:22" (1/1) ... [2021-11-06 15:13:22,221 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:13:22" (1/1) ... [2021-11-06 15:13:22,228 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:13:22" (1/1) ... [2021-11-06 15:13:22,233 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:13:22" (1/1) ... [2021-11-06 15:13:22,243 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 15:13:22,246 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 15:13:22,246 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 15:13:22,246 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 15:13:22,255 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:13:22" (1/1) ... [2021-11-06 15:13:22,261 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 15:13:22,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 15:13:22,284 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-06 15:13:22,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-06 15:13:22,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 15:13:22,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 15:13:22,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 15:13:22,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 15:13:22,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 15:13:22,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 15:13:22,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 15:13:22,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 15:13:22,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 15:13:22,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 15:13:22,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 15:13:23,794 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 15:13:23,794 INFO L299 CfgBuilder]: Removed 358 assume(true) statements. [2021-11-06 15:13:23,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 03:13:23 BoogieIcfgContainer [2021-11-06 15:13:23,797 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 15:13:23,798 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 15:13:23,798 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 15:13:23,801 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 15:13:23,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 03:13:21" (1/3) ... [2021-11-06 15:13:23,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328647ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 03:13:23, skipping insertion in model container [2021-11-06 15:13:23,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:13:22" (2/3) ... [2021-11-06 15:13:23,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328647ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 03:13:23, skipping insertion in model container [2021-11-06 15:13:23,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 03:13:23" (3/3) ... [2021-11-06 15:13:23,803 INFO L111 eAbstractionObserver]: Analyzing ICFG 43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2021-11-06 15:13:23,810 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 15:13:23,810 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-11-06 15:13:23,850 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 15:13:23,855 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-06 15:13:23,856 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-06 15:13:23,875 INFO L276 IsEmpty]: Start isEmpty. Operand has 350 states, 344 states have (on average 1.4709302325581395) internal successors, (506), 349 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:23,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-06 15:13:23,882 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:13:23,882 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 15:13:23,886 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 15:13:23,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:13:23,897 INFO L85 PathProgramCache]: Analyzing trace with hash 519222377, now seen corresponding path program 1 times [2021-11-06 15:13:23,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:13:23,905 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798248300] [2021-11-06 15:13:23,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:13:23,906 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:13:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:13:24,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 15:13:24,300 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:13:24,300 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798248300] [2021-11-06 15:13:24,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798248300] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:13:24,301 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:13:24,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 15:13:24,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903235579] [2021-11-06 15:13:24,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 15:13:24,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:13:24,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 15:13:24,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:13:24,327 INFO L87 Difference]: Start difference. First operand has 350 states, 344 states have (on average 1.4709302325581395) internal successors, (506), 349 states have internal predecessors, (506), 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) Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:24,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:13:24,969 INFO L93 Difference]: Finished difference Result 832 states and 1212 transitions. [2021-11-06 15:13:24,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 15:13:24,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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) Word has length 22 [2021-11-06 15:13:24,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:13:24,987 INFO L225 Difference]: With dead ends: 832 [2021-11-06 15:13:24,989 INFO L226 Difference]: Without dead ends: 445 [2021-11-06 15:13:24,993 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:13:25,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2021-11-06 15:13:25,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2021-11-06 15:13:25,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 440 states have (on average 1.4363636363636363) internal successors, (632), 444 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:25,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 632 transitions. [2021-11-06 15:13:25,072 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 632 transitions. Word has length 22 [2021-11-06 15:13:25,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:13:25,073 INFO L470 AbstractCegarLoop]: Abstraction has 445 states and 632 transitions. [2021-11-06 15:13:25,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:25,073 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 632 transitions. [2021-11-06 15:13:25,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-06 15:13:25,080 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:13:25,081 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 15:13:25,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 15:13:25,081 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 15:13:25,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:13:25,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1139587811, now seen corresponding path program 1 times [2021-11-06 15:13:25,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:13:25,085 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229887221] [2021-11-06 15:13:25,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:13:25,086 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:13:25,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:13:25,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 15:13:25,208 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:13:25,208 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229887221] [2021-11-06 15:13:25,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229887221] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:13:25,208 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:13:25,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 15:13:25,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874302350] [2021-11-06 15:13:25,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 15:13:25,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:13:25,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 15:13:25,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:13:25,211 INFO L87 Difference]: Start difference. First operand 445 states and 632 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:25,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:13:25,231 INFO L93 Difference]: Finished difference Result 872 states and 1243 transitions. [2021-11-06 15:13:25,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 15:13:25,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 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) Word has length 27 [2021-11-06 15:13:25,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:13:25,234 INFO L225 Difference]: With dead ends: 872 [2021-11-06 15:13:25,234 INFO L226 Difference]: Without dead ends: 445 [2021-11-06 15:13:25,236 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:13:25,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2021-11-06 15:13:25,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2021-11-06 15:13:25,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 440 states have (on average 1.434090909090909) internal successors, (631), 444 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:25,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 631 transitions. [2021-11-06 15:13:25,250 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 631 transitions. Word has length 27 [2021-11-06 15:13:25,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:13:25,250 INFO L470 AbstractCegarLoop]: Abstraction has 445 states and 631 transitions. [2021-11-06 15:13:25,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:25,250 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 631 transitions. [2021-11-06 15:13:25,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-06 15:13:25,255 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:13:25,255 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 15:13:25,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 15:13:25,255 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 15:13:25,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:13:25,257 INFO L85 PathProgramCache]: Analyzing trace with hash 236856078, now seen corresponding path program 1 times [2021-11-06 15:13:25,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:13:25,260 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657455506] [2021-11-06 15:13:25,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:13:25,261 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:13:25,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:13:25,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 15:13:25,350 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:13:25,350 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657455506] [2021-11-06 15:13:25,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657455506] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:13:25,351 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:13:25,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 15:13:25,351 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372468818] [2021-11-06 15:13:25,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 15:13:25,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:13:25,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 15:13:25,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:13:25,353 INFO L87 Difference]: Start difference. First operand 445 states and 631 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:25,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:13:25,409 INFO L93 Difference]: Finished difference Result 839 states and 1208 transitions. [2021-11-06 15:13:25,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 15:13:25,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 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) Word has length 30 [2021-11-06 15:13:25,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:13:25,414 INFO L225 Difference]: With dead ends: 839 [2021-11-06 15:13:25,414 INFO L226 Difference]: Without dead ends: 819 [2021-11-06 15:13:25,414 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:13:25,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2021-11-06 15:13:25,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 819. [2021-11-06 15:13:25,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 814 states have (on average 1.457002457002457) internal successors, (1186), 818 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:25,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1186 transitions. [2021-11-06 15:13:25,444 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1186 transitions. Word has length 30 [2021-11-06 15:13:25,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:13:25,445 INFO L470 AbstractCegarLoop]: Abstraction has 819 states and 1186 transitions. [2021-11-06 15:13:25,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:25,445 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1186 transitions. [2021-11-06 15:13:25,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-06 15:13:25,447 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:13:25,448 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-11-06 15:13:25,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-06 15:13:25,448 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 15:13:25,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:13:25,450 INFO L85 PathProgramCache]: Analyzing trace with hash -2121048348, now seen corresponding path program 1 times [2021-11-06 15:13:25,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:13:25,450 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788156626] [2021-11-06 15:13:25,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:13:25,451 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:13:25,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:13:25,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 15:13:25,533 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:13:25,533 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788156626] [2021-11-06 15:13:25,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788156626] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:13:25,533 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:13:25,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 15:13:25,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629335566] [2021-11-06 15:13:25,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 15:13:25,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:13:25,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 15:13:25,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:13:25,536 INFO L87 Difference]: Start difference. First operand 819 states and 1186 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:25,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:13:25,625 INFO L93 Difference]: Finished difference Result 2267 states and 3290 transitions. [2021-11-06 15:13:25,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 15:13:25,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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) Word has length 37 [2021-11-06 15:13:25,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:13:25,632 INFO L225 Difference]: With dead ends: 2267 [2021-11-06 15:13:25,632 INFO L226 Difference]: Without dead ends: 1466 [2021-11-06 15:13:25,634 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:13:25,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2021-11-06 15:13:25,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1446. [2021-11-06 15:13:25,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1446 states, 1441 states have (on average 1.4600971547536432) internal successors, (2104), 1445 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:25,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 2104 transitions. [2021-11-06 15:13:25,677 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 2104 transitions. Word has length 37 [2021-11-06 15:13:25,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:13:25,677 INFO L470 AbstractCegarLoop]: Abstraction has 1446 states and 2104 transitions. [2021-11-06 15:13:25,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:25,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 2104 transitions. [2021-11-06 15:13:25,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-06 15:13:25,683 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:13:25,683 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-11-06 15:13:25,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-06 15:13:25,683 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 15:13:25,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:13:25,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1129102007, now seen corresponding path program 1 times [2021-11-06 15:13:25,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:13:25,684 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960987430] [2021-11-06 15:13:25,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:13:25,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:13:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:13:25,765 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 15:13:25,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:13:25,766 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960987430] [2021-11-06 15:13:25,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960987430] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:13:25,769 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:13:25,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 15:13:25,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51676861] [2021-11-06 15:13:25,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 15:13:25,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:13:25,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 15:13:25,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:13:25,771 INFO L87 Difference]: Start difference. First operand 1446 states and 2104 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:25,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:13:25,882 INFO L93 Difference]: Finished difference Result 4000 states and 5824 transitions. [2021-11-06 15:13:25,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 15:13:25,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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) Word has length 41 [2021-11-06 15:13:25,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:13:25,893 INFO L225 Difference]: With dead ends: 4000 [2021-11-06 15:13:25,893 INFO L226 Difference]: Without dead ends: 2572 [2021-11-06 15:13:25,896 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:13:25,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2021-11-06 15:13:25,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 2552. [2021-11-06 15:13:25,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 2547 states have (on average 1.458971338829996) internal successors, (3716), 2551 states have internal predecessors, (3716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:26,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 3716 transitions. [2021-11-06 15:13:26,002 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 3716 transitions. Word has length 41 [2021-11-06 15:13:26,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:13:26,002 INFO L470 AbstractCegarLoop]: Abstraction has 2552 states and 3716 transitions. [2021-11-06 15:13:26,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:26,003 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 3716 transitions. [2021-11-06 15:13:26,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-06 15:13:26,005 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:13:26,005 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-11-06 15:13:26,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-06 15:13:26,006 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 15:13:26,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:13:26,006 INFO L85 PathProgramCache]: Analyzing trace with hash -457313738, now seen corresponding path program 1 times [2021-11-06 15:13:26,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:13:26,007 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473974992] [2021-11-06 15:13:26,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:13:26,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:13:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:13:26,093 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 15:13:26,093 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:13:26,093 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473974992] [2021-11-06 15:13:26,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473974992] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:13:26,094 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:13:26,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 15:13:26,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028690487] [2021-11-06 15:13:26,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 15:13:26,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:13:26,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 15:13:26,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:13:26,100 INFO L87 Difference]: Start difference. First operand 2552 states and 3716 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:26,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:13:26,212 INFO L93 Difference]: Finished difference Result 6504 states and 9538 transitions. [2021-11-06 15:13:26,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 15:13:26,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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) Word has length 42 [2021-11-06 15:13:26,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:13:26,228 INFO L225 Difference]: With dead ends: 6504 [2021-11-06 15:13:26,228 INFO L226 Difference]: Without dead ends: 3970 [2021-11-06 15:13:26,232 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:13:26,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3970 states. [2021-11-06 15:13:26,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3970 to 2560. [2021-11-06 15:13:26,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2560 states, 2555 states have (on average 1.4575342465753425) internal successors, (3724), 2559 states have internal predecessors, (3724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:26,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2560 states and 3724 transitions. [2021-11-06 15:13:26,377 INFO L78 Accepts]: Start accepts. Automaton has 2560 states and 3724 transitions. Word has length 42 [2021-11-06 15:13:26,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:13:26,377 INFO L470 AbstractCegarLoop]: Abstraction has 2560 states and 3724 transitions. [2021-11-06 15:13:26,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:26,378 INFO L276 IsEmpty]: Start isEmpty. Operand 2560 states and 3724 transitions. [2021-11-06 15:13:26,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-06 15:13:26,380 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:13:26,380 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-11-06 15:13:26,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-06 15:13:26,380 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 15:13:26,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:13:26,381 INFO L85 PathProgramCache]: Analyzing trace with hash -316765128, now seen corresponding path program 1 times [2021-11-06 15:13:26,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:13:26,381 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780979908] [2021-11-06 15:13:26,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:13:26,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:13:26,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:13:26,442 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 15:13:26,443 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:13:26,443 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780979908] [2021-11-06 15:13:26,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780979908] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:13:26,443 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:13:26,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 15:13:26,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436559653] [2021-11-06 15:13:26,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 15:13:26,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:13:26,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 15:13:26,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 15:13:26,445 INFO L87 Difference]: Start difference. First operand 2560 states and 3724 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:27,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:13:27,268 INFO L93 Difference]: Finished difference Result 5126 states and 7459 transitions. [2021-11-06 15:13:27,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 15:13:27,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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) Word has length 42 [2021-11-06 15:13:27,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:13:27,280 INFO L225 Difference]: With dead ends: 5126 [2021-11-06 15:13:27,280 INFO L226 Difference]: Without dead ends: 2536 [2021-11-06 15:13:27,284 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 15:13:27,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2536 states. [2021-11-06 15:13:27,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2536 to 2528. [2021-11-06 15:13:27,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2528 states, 2523 states have (on average 1.453824811732065) internal successors, (3668), 2527 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:27,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2528 states to 2528 states and 3668 transitions. [2021-11-06 15:13:27,398 INFO L78 Accepts]: Start accepts. Automaton has 2528 states and 3668 transitions. Word has length 42 [2021-11-06 15:13:27,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:13:27,398 INFO L470 AbstractCegarLoop]: Abstraction has 2528 states and 3668 transitions. [2021-11-06 15:13:27,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:27,398 INFO L276 IsEmpty]: Start isEmpty. Operand 2528 states and 3668 transitions. [2021-11-06 15:13:27,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-06 15:13:27,400 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:13:27,401 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 15:13:27,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-06 15:13:27,401 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 15:13:27,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:13:27,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1266781576, now seen corresponding path program 1 times [2021-11-06 15:13:27,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:13:27,402 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112117720] [2021-11-06 15:13:27,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:13:27,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:13:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:13:27,464 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 15:13:27,464 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:13:27,465 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112117720] [2021-11-06 15:13:27,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112117720] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:13:27,465 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:13:27,465 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 15:13:27,465 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120397187] [2021-11-06 15:13:27,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 15:13:27,466 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:13:27,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 15:13:27,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:13:27,467 INFO L87 Difference]: Start difference. First operand 2528 states and 3668 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:27,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:13:27,880 INFO L93 Difference]: Finished difference Result 6258 states and 9126 transitions. [2021-11-06 15:13:27,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 15:13:27,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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) Word has length 65 [2021-11-06 15:13:27,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:13:27,894 INFO L225 Difference]: With dead ends: 6258 [2021-11-06 15:13:27,894 INFO L226 Difference]: Without dead ends: 3748 [2021-11-06 15:13:27,898 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:13:27,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3748 states. [2021-11-06 15:13:28,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3748 to 3724. [2021-11-06 15:13:28,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3724 states, 3719 states have (on average 1.451465447700995) internal successors, (5398), 3723 states have internal predecessors, (5398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:28,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3724 states to 3724 states and 5398 transitions. [2021-11-06 15:13:28,034 INFO L78 Accepts]: Start accepts. Automaton has 3724 states and 5398 transitions. Word has length 65 [2021-11-06 15:13:28,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:13:28,035 INFO L470 AbstractCegarLoop]: Abstraction has 3724 states and 5398 transitions. [2021-11-06 15:13:28,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:28,035 INFO L276 IsEmpty]: Start isEmpty. Operand 3724 states and 5398 transitions. [2021-11-06 15:13:28,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-06 15:13:28,037 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:13:28,038 INFO L513 BasicCegarLoop]: trace histogram [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, 1] [2021-11-06 15:13:28,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-06 15:13:28,038 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 15:13:28,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:13:28,039 INFO L85 PathProgramCache]: Analyzing trace with hash 736484461, now seen corresponding path program 1 times [2021-11-06 15:13:28,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:13:28,039 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087049798] [2021-11-06 15:13:28,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:13:28,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:13:28,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:13:28,108 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 15:13:28,108 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:13:28,108 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087049798] [2021-11-06 15:13:28,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087049798] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:13:28,109 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:13:28,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 15:13:28,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632497739] [2021-11-06 15:13:28,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 15:13:28,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:13:28,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 15:13:28,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:13:28,112 INFO L87 Difference]: Start difference. First operand 3724 states and 5398 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:28,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:13:28,512 INFO L93 Difference]: Finished difference Result 9229 states and 13444 transitions. [2021-11-06 15:13:28,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 15:13:28,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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) Word has length 69 [2021-11-06 15:13:28,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:13:28,532 INFO L225 Difference]: With dead ends: 9229 [2021-11-06 15:13:28,532 INFO L226 Difference]: Without dead ends: 5523 [2021-11-06 15:13:28,537 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:13:28,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5523 states. [2021-11-06 15:13:28,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5523 to 5497. [2021-11-06 15:13:28,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5497 states, 5492 states have (on average 1.4482884195193009) internal successors, (7954), 5496 states have internal predecessors, (7954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:28,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5497 states to 5497 states and 7954 transitions. [2021-11-06 15:13:28,699 INFO L78 Accepts]: Start accepts. Automaton has 5497 states and 7954 transitions. Word has length 69 [2021-11-06 15:13:28,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:13:28,702 INFO L470 AbstractCegarLoop]: Abstraction has 5497 states and 7954 transitions. [2021-11-06 15:13:28,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:28,702 INFO L276 IsEmpty]: Start isEmpty. Operand 5497 states and 7954 transitions. [2021-11-06 15:13:28,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-06 15:13:28,705 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:13:28,732 INFO L513 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 15:13:28,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-06 15:13:28,732 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 15:13:28,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:13:28,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1469644628, now seen corresponding path program 1 times [2021-11-06 15:13:28,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:13:28,733 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200927469] [2021-11-06 15:13:28,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:13:28,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:13:28,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:13:28,826 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-06 15:13:28,827 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:13:28,827 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200927469] [2021-11-06 15:13:28,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200927469] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 15:13:28,827 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959343762] [2021-11-06 15:13:28,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:13:28,828 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 15:13:28,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 15:13:28,829 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 15:13:28,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-06 15:13:29,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:13:29,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 958 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 15:13:29,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 15:13:29,345 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-06 15:13:29,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959343762] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:13:29,346 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-06 15:13:29,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2021-11-06 15:13:29,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672929894] [2021-11-06 15:13:29,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 15:13:29,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:13:29,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 15:13:29,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-06 15:13:29,348 INFO L87 Difference]: Start difference. First operand 5497 states and 7954 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:29,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:13:29,884 INFO L93 Difference]: Finished difference Result 11734 states and 16923 transitions. [2021-11-06 15:13:29,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 15:13:29,885 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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) Word has length 75 [2021-11-06 15:13:29,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:13:29,904 INFO L225 Difference]: With dead ends: 11734 [2021-11-06 15:13:29,904 INFO L226 Difference]: Without dead ends: 5562 [2021-11-06 15:13:29,913 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-06 15:13:29,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5562 states. [2021-11-06 15:13:30,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5562 to 5440. [2021-11-06 15:13:30,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5440 states, 5435 states have (on average 1.4437902483900644) internal successors, (7847), 5439 states have internal predecessors, (7847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:30,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5440 states to 5440 states and 7847 transitions. [2021-11-06 15:13:30,104 INFO L78 Accepts]: Start accepts. Automaton has 5440 states and 7847 transitions. Word has length 75 [2021-11-06 15:13:30,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:13:30,104 INFO L470 AbstractCegarLoop]: Abstraction has 5440 states and 7847 transitions. [2021-11-06 15:13:30,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:30,105 INFO L276 IsEmpty]: Start isEmpty. Operand 5440 states and 7847 transitions. [2021-11-06 15:13:30,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-06 15:13:30,107 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:13:30,107 INFO L513 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 15:13:30,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-06 15:13:30,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-06 15:13:30,328 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 15:13:30,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:13:30,328 INFO L85 PathProgramCache]: Analyzing trace with hash 9935809, now seen corresponding path program 1 times [2021-11-06 15:13:30,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:13:30,328 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434721616] [2021-11-06 15:13:30,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:13:30,328 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:13:30,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:13:30,424 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-06 15:13:30,424 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:13:30,425 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434721616] [2021-11-06 15:13:30,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434721616] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:13:30,425 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:13:30,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 15:13:30,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582017264] [2021-11-06 15:13:30,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 15:13:30,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:13:30,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 15:13:30,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:13:30,427 INFO L87 Difference]: Start difference. First operand 5440 states and 7847 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:30,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:13:30,540 INFO L93 Difference]: Finished difference Result 10826 states and 15619 transitions. [2021-11-06 15:13:30,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 15:13:30,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 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) Word has length 77 [2021-11-06 15:13:30,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:13:30,553 INFO L225 Difference]: With dead ends: 10826 [2021-11-06 15:13:30,553 INFO L226 Difference]: Without dead ends: 5404 [2021-11-06 15:13:30,561 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:13:30,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5404 states. [2021-11-06 15:13:30,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5404 to 5404. [2021-11-06 15:13:30,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5404 states, 5399 states have (on average 1.4400814965734394) internal successors, (7775), 5403 states have internal predecessors, (7775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:30,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5404 states to 5404 states and 7775 transitions. [2021-11-06 15:13:30,735 INFO L78 Accepts]: Start accepts. Automaton has 5404 states and 7775 transitions. Word has length 77 [2021-11-06 15:13:30,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:13:30,735 INFO L470 AbstractCegarLoop]: Abstraction has 5404 states and 7775 transitions. [2021-11-06 15:13:30,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:30,736 INFO L276 IsEmpty]: Start isEmpty. Operand 5404 states and 7775 transitions. [2021-11-06 15:13:30,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-06 15:13:30,738 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:13:30,738 INFO L513 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 15:13:30,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-06 15:13:30,739 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 15:13:30,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:13:30,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1410017757, now seen corresponding path program 1 times [2021-11-06 15:13:30,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:13:30,740 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948415401] [2021-11-06 15:13:30,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:13:30,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:13:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:13:30,815 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-06 15:13:30,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:13:30,815 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948415401] [2021-11-06 15:13:30,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948415401] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 15:13:30,816 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398851051] [2021-11-06 15:13:30,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:13:30,816 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 15:13:30,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 15:13:30,817 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 15:13:30,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-06 15:13:31,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:13:31,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 970 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 15:13:31,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 15:13:31,336 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-06 15:13:31,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398851051] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:13:31,337 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-06 15:13:31,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-11-06 15:13:31,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397175573] [2021-11-06 15:13:31,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 15:13:31,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:13:31,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 15:13:31,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 15:13:31,338 INFO L87 Difference]: Start difference. First operand 5404 states and 7775 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:32,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:13:32,200 INFO L93 Difference]: Finished difference Result 16164 states and 23270 transitions. [2021-11-06 15:13:32,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 15:13:32,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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) Word has length 78 [2021-11-06 15:13:32,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:13:32,242 INFO L225 Difference]: With dead ends: 16164 [2021-11-06 15:13:32,243 INFO L226 Difference]: Without dead ends: 16152 [2021-11-06 15:13:32,251 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 15:13:32,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16152 states. [2021-11-06 15:13:32,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16152 to 15962. [2021-11-06 15:13:32,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15962 states, 15957 states have (on average 1.4450084602368867) internal successors, (23058), 15961 states have internal predecessors, (23058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:32,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15962 states to 15962 states and 23058 transitions. [2021-11-06 15:13:32,821 INFO L78 Accepts]: Start accepts. Automaton has 15962 states and 23058 transitions. Word has length 78 [2021-11-06 15:13:32,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:13:32,822 INFO L470 AbstractCegarLoop]: Abstraction has 15962 states and 23058 transitions. [2021-11-06 15:13:32,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:32,823 INFO L276 IsEmpty]: Start isEmpty. Operand 15962 states and 23058 transitions. [2021-11-06 15:13:32,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-06 15:13:32,830 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:13:32,830 INFO L513 BasicCegarLoop]: trace histogram [4, 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] [2021-11-06 15:13:32,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-11-06 15:13:33,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-06 15:13:33,044 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 15:13:33,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:13:33,044 INFO L85 PathProgramCache]: Analyzing trace with hash 552854658, now seen corresponding path program 1 times [2021-11-06 15:13:33,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:13:33,044 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887094139] [2021-11-06 15:13:33,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:13:33,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:13:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:13:33,112 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-06 15:13:33,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:13:33,113 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887094139] [2021-11-06 15:13:33,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887094139] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:13:33,113 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:13:33,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 15:13:33,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769049315] [2021-11-06 15:13:33,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 15:13:33,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:13:33,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 15:13:33,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:13:33,115 INFO L87 Difference]: Start difference. First operand 15962 states and 23058 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:33,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:13:33,900 INFO L93 Difference]: Finished difference Result 20871 states and 30413 transitions. [2021-11-06 15:13:33,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 15:13:33,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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) Word has length 86 [2021-11-06 15:13:33,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:13:33,911 INFO L225 Difference]: With dead ends: 20871 [2021-11-06 15:13:33,911 INFO L226 Difference]: Without dead ends: 4785 [2021-11-06 15:13:33,929 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:13:33,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4785 states. [2021-11-06 15:13:34,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4785 to 4785. [2021-11-06 15:13:34,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4785 states, 4784 states have (on average 1.473871237458194) internal successors, (7051), 4784 states have internal predecessors, (7051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:34,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4785 states to 4785 states and 7051 transitions. [2021-11-06 15:13:34,043 INFO L78 Accepts]: Start accepts. Automaton has 4785 states and 7051 transitions. Word has length 86 [2021-11-06 15:13:34,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:13:34,044 INFO L470 AbstractCegarLoop]: Abstraction has 4785 states and 7051 transitions. [2021-11-06 15:13:34,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:34,044 INFO L276 IsEmpty]: Start isEmpty. Operand 4785 states and 7051 transitions. [2021-11-06 15:13:34,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-06 15:13:34,051 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:13:34,051 INFO L513 BasicCegarLoop]: trace histogram [5, 3, 3, 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] [2021-11-06 15:13:34,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-06 15:13:34,051 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 15:13:34,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:13:34,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1293494006, now seen corresponding path program 1 times [2021-11-06 15:13:34,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:13:34,052 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501479712] [2021-11-06 15:13:34,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:13:34,053 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:13:34,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:13:34,193 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-06 15:13:34,193 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:13:34,193 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501479712] [2021-11-06 15:13:34,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501479712] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:13:34,194 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:13:34,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 15:13:34,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974569537] [2021-11-06 15:13:34,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 15:13:34,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:13:34,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 15:13:34,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:13:34,195 INFO L87 Difference]: Start difference. First operand 4785 states and 7051 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:34,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:13:34,428 INFO L93 Difference]: Finished difference Result 14310 states and 21099 transitions. [2021-11-06 15:13:34,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 15:13:34,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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) Word has length 87 [2021-11-06 15:13:34,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:13:34,447 INFO L225 Difference]: With dead ends: 14310 [2021-11-06 15:13:34,447 INFO L226 Difference]: Without dead ends: 9543 [2021-11-06 15:13:34,456 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:13:34,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9543 states. [2021-11-06 15:13:34,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9543 to 4788. [2021-11-06 15:13:34,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4788 states, 4787 states have (on average 1.4735742636306663) internal successors, (7054), 4787 states have internal predecessors, (7054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:34,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4788 states to 4788 states and 7054 transitions. [2021-11-06 15:13:34,643 INFO L78 Accepts]: Start accepts. Automaton has 4788 states and 7054 transitions. Word has length 87 [2021-11-06 15:13:34,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:13:34,643 INFO L470 AbstractCegarLoop]: Abstraction has 4788 states and 7054 transitions. [2021-11-06 15:13:34,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:34,644 INFO L276 IsEmpty]: Start isEmpty. Operand 4788 states and 7054 transitions. [2021-11-06 15:13:34,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-06 15:13:34,650 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:13:34,651 INFO L513 BasicCegarLoop]: trace histogram [5, 3, 3, 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] [2021-11-06 15:13:34,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-06 15:13:34,651 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 15:13:34,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:13:34,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1610575735, now seen corresponding path program 1 times [2021-11-06 15:13:34,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:13:34,654 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85195507] [2021-11-06 15:13:34,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:13:34,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:13:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:13:34,796 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-06 15:13:34,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:13:34,796 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85195507] [2021-11-06 15:13:34,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85195507] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:13:34,797 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:13:34,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 15:13:34,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254189159] [2021-11-06 15:13:34,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 15:13:34,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:13:34,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 15:13:34,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 15:13:34,799 INFO L87 Difference]: Start difference. First operand 4788 states and 7054 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:34,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:13:34,865 INFO L93 Difference]: Finished difference Result 5158 states and 7559 transitions. [2021-11-06 15:13:34,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 15:13:34,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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) Word has length 89 [2021-11-06 15:13:34,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:13:34,866 INFO L225 Difference]: With dead ends: 5158 [2021-11-06 15:13:34,866 INFO L226 Difference]: Without dead ends: 0 [2021-11-06 15:13:34,872 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 15:13:34,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-06 15:13:34,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-06 15:13:34,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:34,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-06 15:13:34,873 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 89 [2021-11-06 15:13:34,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:13:34,874 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-06 15:13:34,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:13:34,874 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-06 15:13:34,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-06 15:13:34,876 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 15:13:34,877 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 15:13:34,877 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 15:13:34,877 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 15:13:34,877 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 15:13:34,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-06 15:13:34,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-06 15:13:34,891 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:34,900 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:34,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:34,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:34,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:34,918 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:34,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:34,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:34,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:34,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:34,946 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:34,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:34,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:34,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:34,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:34,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:34,956 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:34,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:34,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:34,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:34,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:34,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:34,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:34,997 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,005 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,006 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,006 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,007 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,013 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,021 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,034 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,037 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,038 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,038 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,042 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,054 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,055 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,063 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,071 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,077 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,079 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,079 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,083 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,086 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,090 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,090 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,091 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,091 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,092 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,095 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,113 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,116 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,117 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,117 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,122 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,139 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,149 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,150 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,156 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,163 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,163 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,167 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,178 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,195 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,198 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,198 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,226 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,227 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,231 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,240 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,240 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,247 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,248 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,248 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,248 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,249 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,274 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,284 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,287 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:35,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 15:13:36,863 INFO L860 garLoopResultBuilder]: At program point L2876(lines 2871 2878) the Hoare annotation is: true [2021-11-06 15:13:36,864 INFO L853 garLoopResultBuilder]: At program point L2876-2(lines 2871 2878) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) (= ~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) (= |ULTIMATE.start_kmalloc_#res.base| 0)) [2021-11-06 15:13:36,864 INFO L853 garLoopResultBuilder]: At program point L2876-1(lines 2871 2878) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) (= ~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) (= |ULTIMATE.start_kmalloc_#res.base| 0)) [2021-11-06 15:13:36,864 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 2013) no Hoare annotation was computed. [2021-11-06 15:13:36,864 INFO L857 garLoopResultBuilder]: For program point L2744(lines 2744 2748) no Hoare annotation was computed. [2021-11-06 15:13:36,864 INFO L853 garLoopResultBuilder]: At program point L2876-3(lines 2871 2878) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ 12 ULTIMATE.start_lock_torture_init_~firsterr~0) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-06 15:13:36,864 INFO L857 garLoopResultBuilder]: For program point L2744-2(lines 2723 2773) no Hoare annotation was computed. [2021-11-06 15:13:36,864 INFO L857 garLoopResultBuilder]: For program point L2282(lines 2282 2285) no Hoare annotation was computed. [2021-11-06 15:13:36,864 INFO L857 garLoopResultBuilder]: For program point L2282-2(lines 2282 2285) no Hoare annotation was computed. [2021-11-06 15:13:36,865 INFO L857 garLoopResultBuilder]: For program point L2150(lines 2150 2153) no Hoare annotation was computed. [2021-11-06 15:13:36,865 INFO L857 garLoopResultBuilder]: For program point L2282-3(lines 2282 2285) no Hoare annotation was computed. [2021-11-06 15:13:36,865 INFO L857 garLoopResultBuilder]: For program point L2282-6(lines 2282 2285) no Hoare annotation was computed. [2021-11-06 15:13:36,865 INFO L853 garLoopResultBuilder]: At program point L2084(lines 2081 2086) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2021-11-06 15:13:36,865 INFO L857 garLoopResultBuilder]: For program point L2150-2(lines 2150 2153) no Hoare annotation was computed. [2021-11-06 15:13:36,865 INFO L857 garLoopResultBuilder]: For program point L2150-1(lines 2150 2153) no Hoare annotation was computed. [2021-11-06 15:13:36,865 INFO L857 garLoopResultBuilder]: For program point L2282-5(lines 2282 2285) no Hoare annotation was computed. [2021-11-06 15:13:36,865 INFO L857 garLoopResultBuilder]: For program point L2282-8(lines 2282 2285) no Hoare annotation was computed. [2021-11-06 15:13:36,865 INFO L857 garLoopResultBuilder]: For program point L2150-3(lines 2150 2153) no Hoare annotation was computed. [2021-11-06 15:13:36,865 INFO L853 garLoopResultBuilder]: At program point L2151-1(lines 2142 2154) the Hoare annotation is: false [2021-11-06 15:13:36,865 INFO L853 garLoopResultBuilder]: At program point L2151(lines 2142 2154) the Hoare annotation is: false [2021-11-06 15:13:36,866 INFO L853 garLoopResultBuilder]: At program point L2151-3(lines 2142 2154) the Hoare annotation is: false [2021-11-06 15:13:36,866 INFO L853 garLoopResultBuilder]: At program point L2151-2(lines 2142 2154) the Hoare annotation is: false [2021-11-06 15:13:36,866 INFO L860 garLoopResultBuilder]: At program point L2019(lines 2018 2021) the Hoare annotation is: true [2021-11-06 15:13:36,866 INFO L860 garLoopResultBuilder]: At program point L2019-1(lines 2018 2021) the Hoare annotation is: true [2021-11-06 15:13:36,866 INFO L860 garLoopResultBuilder]: At program point L2019-2(lines 2018 2021) the Hoare annotation is: true [2021-11-06 15:13:36,866 INFO L860 garLoopResultBuilder]: At program point L2019-3(lines 2018 2021) the Hoare annotation is: true [2021-11-06 15:13:36,866 INFO L860 garLoopResultBuilder]: At program point L2019-4(lines 2018 2021) the Hoare annotation is: true [2021-11-06 15:13:36,866 INFO L857 garLoopResultBuilder]: For program point L2813(line 2813) no Hoare annotation was computed. [2021-11-06 15:13:36,866 INFO L857 garLoopResultBuilder]: For program point L3078(lines 3078 3080) no Hoare annotation was computed. [2021-11-06 15:13:36,866 INFO L857 garLoopResultBuilder]: For program point L3078-2(lines 3078 3080) no Hoare annotation was computed. [2021-11-06 15:13:36,866 INFO L860 garLoopResultBuilder]: At program point L3078-1(lines 1 3080) the Hoare annotation is: true [2021-11-06 15:13:36,866 INFO L857 garLoopResultBuilder]: For program point L3078-4(lines 3078 3080) no Hoare annotation was computed. [2021-11-06 15:13:36,866 INFO L853 garLoopResultBuilder]: At program point L3078-3(lines 1 3080) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) (= ~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) (= |ULTIMATE.start_kmalloc_#res.base| 0)) [2021-11-06 15:13:36,867 INFO L853 garLoopResultBuilder]: At program point L3078-5(lines 1 3080) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ 12 ULTIMATE.start_lock_torture_init_~firsterr~0) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-06 15:13:36,867 INFO L857 garLoopResultBuilder]: For program point L2814(lines 2814 2819) no Hoare annotation was computed. [2021-11-06 15:13:36,867 INFO L857 garLoopResultBuilder]: For program point L1956(lines 1956 1958) no Hoare annotation was computed. [2021-11-06 15:13:36,867 INFO L857 garLoopResultBuilder]: For program point L1956-1(lines 1956 1958) no Hoare annotation was computed. [2021-11-06 15:13:36,867 INFO L857 garLoopResultBuilder]: For program point L1956-2(lines 1956 1958) no Hoare annotation was computed. [2021-11-06 15:13:36,867 INFO L853 garLoopResultBuilder]: At program point L1890(lines 1885 1892) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-06 15:13:36,867 INFO L857 garLoopResultBuilder]: For program point L1956-3(lines 1956 1958) no Hoare annotation was computed. [2021-11-06 15:13:36,867 INFO L857 garLoopResultBuilder]: For program point L1956-4(lines 1956 1958) no Hoare annotation was computed. [2021-11-06 15:13:36,867 INFO L857 garLoopResultBuilder]: For program point L1956-5(lines 1956 1958) no Hoare annotation was computed. [2021-11-06 15:13:36,867 INFO L857 garLoopResultBuilder]: For program point L1956-6(lines 1956 1958) no Hoare annotation was computed. [2021-11-06 15:13:36,867 INFO L857 garLoopResultBuilder]: For program point L2683(line 2683) no Hoare annotation was computed. [2021-11-06 15:13:36,867 INFO L857 garLoopResultBuilder]: For program point L2287(lines 2287 2290) no Hoare annotation was computed. [2021-11-06 15:13:36,867 INFO L857 garLoopResultBuilder]: For program point L2287-3(lines 2287 2290) no Hoare annotation was computed. [2021-11-06 15:13:36,868 INFO L857 garLoopResultBuilder]: For program point L2287-2(lines 2287 2290) no Hoare annotation was computed. [2021-11-06 15:13:36,868 INFO L857 garLoopResultBuilder]: For program point L2287-5(lines 2287 2290) no Hoare annotation was computed. [2021-11-06 15:13:36,868 INFO L857 garLoopResultBuilder]: For program point L2287-6(lines 2287 2290) no Hoare annotation was computed. [2021-11-06 15:13:36,868 INFO L857 garLoopResultBuilder]: For program point L2287-8(lines 2287 2290) no Hoare annotation was computed. [2021-11-06 15:13:36,868 INFO L857 garLoopResultBuilder]: For program point L1957(line 1957) no Hoare annotation was computed. [2021-11-06 15:13:36,868 INFO L857 garLoopResultBuilder]: For program point L1957-2(line 1957) no Hoare annotation was computed. [2021-11-06 15:13:36,868 INFO L857 garLoopResultBuilder]: For program point L1957-4(line 1957) no Hoare annotation was computed. [2021-11-06 15:13:36,868 INFO L857 garLoopResultBuilder]: For program point L1957-6(line 1957) no Hoare annotation was computed. [2021-11-06 15:13:36,868 INFO L857 garLoopResultBuilder]: For program point L2684(lines 2684 2718) no Hoare annotation was computed. [2021-11-06 15:13:36,868 INFO L857 garLoopResultBuilder]: For program point L1957-8(line 1957) no Hoare annotation was computed. [2021-11-06 15:13:36,868 INFO L857 garLoopResultBuilder]: For program point L1957-10(line 1957) no Hoare annotation was computed. [2021-11-06 15:13:36,868 INFO L857 garLoopResultBuilder]: For program point L1957-12(line 1957) no Hoare annotation was computed. [2021-11-06 15:13:36,868 INFO L853 garLoopResultBuilder]: At program point L2157-1(lines 2130 2163) the Hoare annotation is: false [2021-11-06 15:13:36,868 INFO L857 garLoopResultBuilder]: For program point L2157(lines 2157 2160) no Hoare annotation was computed. [2021-11-06 15:13:36,869 INFO L853 garLoopResultBuilder]: At program point L2157-3(lines 2130 2163) the Hoare annotation is: false [2021-11-06 15:13:36,869 INFO L857 garLoopResultBuilder]: For program point L2157-2(lines 2157 2160) no Hoare annotation was computed. [2021-11-06 15:13:36,869 INFO L853 garLoopResultBuilder]: At program point L2157-5(lines 2130 2163) the Hoare annotation is: false [2021-11-06 15:13:36,869 INFO L857 garLoopResultBuilder]: For program point L2157-4(lines 2157 2160) no Hoare annotation was computed. [2021-11-06 15:13:36,869 INFO L853 garLoopResultBuilder]: At program point L2157-7(lines 2130 2163) the Hoare annotation is: false [2021-11-06 15:13:36,869 INFO L857 garLoopResultBuilder]: For program point L2157-6(lines 2157 2160) no Hoare annotation was computed. [2021-11-06 15:13:36,869 INFO L853 garLoopResultBuilder]: At program point L2884(lines 2880 2886) the Hoare annotation is: false [2021-11-06 15:13:36,869 INFO L857 garLoopResultBuilder]: For program point L2686(lines 2686 2715) no Hoare annotation was computed. [2021-11-06 15:13:36,869 INFO L857 garLoopResultBuilder]: For program point L2488(lines 2488 2496) no Hoare annotation was computed. [2021-11-06 15:13:36,869 INFO L853 garLoopResultBuilder]: At program point L2951(lines 2950 2952) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-06 15:13:36,869 INFO L857 garLoopResultBuilder]: For program point L2687(line 2687) no Hoare annotation was computed. [2021-11-06 15:13:36,869 INFO L857 garLoopResultBuilder]: For program point L2489(lines 2489 2492) no Hoare annotation was computed. [2021-11-06 15:13:36,869 INFO L857 garLoopResultBuilder]: For program point L2489-2(lines 2489 2492) no Hoare annotation was computed. [2021-11-06 15:13:36,870 INFO L857 garLoopResultBuilder]: For program point L2291(lines 2291 2294) no Hoare annotation was computed. [2021-11-06 15:13:36,870 INFO L857 garLoopResultBuilder]: For program point L2291-3(lines 2291 2294) no Hoare annotation was computed. [2021-11-06 15:13:36,870 INFO L857 garLoopResultBuilder]: For program point L2291-2(lines 2291 2294) no Hoare annotation was computed. [2021-11-06 15:13:36,870 INFO L857 garLoopResultBuilder]: For program point L2291-5(lines 2291 2294) no Hoare annotation was computed. [2021-11-06 15:13:36,870 INFO L857 garLoopResultBuilder]: For program point L2291-6(lines 2291 2294) no Hoare annotation was computed. [2021-11-06 15:13:36,870 INFO L857 garLoopResultBuilder]: For program point L2291-8(lines 2291 2294) no Hoare annotation was computed. [2021-11-06 15:13:36,870 INFO L857 garLoopResultBuilder]: For program point L2688(lines 2688 2693) no Hoare annotation was computed. [2021-11-06 15:13:36,870 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 2013) no Hoare annotation was computed. [2021-11-06 15:13:36,870 INFO L860 garLoopResultBuilder]: At program point L1896(lines 1893 1898) the Hoare annotation is: true [2021-11-06 15:13:36,870 INFO L853 garLoopResultBuilder]: At program point L1896-1(lines 1893 1898) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) (= ~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) (= |ULTIMATE.start_kmalloc_#res.base| 0)) [2021-11-06 15:13:36,870 INFO L853 garLoopResultBuilder]: At program point L1896-2(lines 1893 1898) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ 12 ULTIMATE.start_lock_torture_init_~firsterr~0) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-06 15:13:36,870 INFO L857 garLoopResultBuilder]: For program point L2821(line 2821) no Hoare annotation was computed. [2021-11-06 15:13:36,870 INFO L857 garLoopResultBuilder]: For program point L2755(line 2755) no Hoare annotation was computed. [2021-11-06 15:13:36,871 INFO L853 garLoopResultBuilder]: At program point L2954(lines 1 3080) the Hoare annotation is: false [2021-11-06 15:13:36,871 INFO L853 garLoopResultBuilder]: At program point L2954-2(lines 1 3080) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2021-11-06 15:13:36,871 INFO L853 garLoopResultBuilder]: At program point L2954-1(lines 1 3080) the Hoare annotation is: false [2021-11-06 15:13:36,873 INFO L853 garLoopResultBuilder]: At program point L2954-4(lines 1 3080) the Hoare annotation is: false [2021-11-06 15:13:36,873 INFO L857 garLoopResultBuilder]: For program point L2822(lines 2822 2827) no Hoare annotation was computed. [2021-11-06 15:13:36,873 INFO L853 garLoopResultBuilder]: At program point L2954-3(lines 1 3080) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2021-11-06 15:13:36,873 INFO L857 garLoopResultBuilder]: For program point L2756(lines 2756 2761) no Hoare annotation was computed. [2021-11-06 15:13:36,873 INFO L853 garLoopResultBuilder]: At program point L2954-5(lines 1 3080) the Hoare annotation is: false [2021-11-06 15:13:36,873 INFO L857 garLoopResultBuilder]: For program point L2624(lines 2624 2838) no Hoare annotation was computed. [2021-11-06 15:13:36,873 INFO L857 garLoopResultBuilder]: For program point L2558(lines 2558 2561) no Hoare annotation was computed. [2021-11-06 15:13:36,873 INFO L857 garLoopResultBuilder]: For program point L2096(lines 2096 2109) no Hoare annotation was computed. [2021-11-06 15:13:36,873 INFO L853 garLoopResultBuilder]: At program point L2096-2(lines 2087 2112) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2021-11-06 15:13:36,873 INFO L857 garLoopResultBuilder]: For program point L2096-3(lines 2096 2109) no Hoare annotation was computed. [2021-11-06 15:13:36,874 INFO L853 garLoopResultBuilder]: At program point L2096-5(lines 2087 2112) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2021-11-06 15:13:36,874 INFO L857 garLoopResultBuilder]: For program point L2625(line 2625) no Hoare annotation was computed. [2021-11-06 15:13:36,874 INFO L857 garLoopResultBuilder]: For program point L2626(lines 2626 2681) no Hoare annotation was computed. [2021-11-06 15:13:36,874 INFO L860 garLoopResultBuilder]: At program point L2296(lines 2274 2312) the Hoare annotation is: true [2021-11-06 15:13:36,874 INFO L853 garLoopResultBuilder]: At program point L2296-2(lines 2274 2312) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ 12 ULTIMATE.start_lock_torture_init_~firsterr~0) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-06 15:13:36,874 INFO L853 garLoopResultBuilder]: At program point L2296-1(lines 2274 2312) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) (= ~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) (= |ULTIMATE.start_kmalloc_#res.base| 0)) [2021-11-06 15:13:36,874 INFO L857 garLoopResultBuilder]: For program point L1966(lines 1966 1973) no Hoare annotation was computed. [2021-11-06 15:13:36,874 INFO L857 garLoopResultBuilder]: For program point L1966-1(lines 1966 1973) no Hoare annotation was computed. [2021-11-06 15:13:36,874 INFO L857 garLoopResultBuilder]: For program point L1966-2(lines 1966 1973) no Hoare annotation was computed. [2021-11-06 15:13:36,874 INFO L857 garLoopResultBuilder]: For program point L1966-3(lines 1966 1973) no Hoare annotation was computed. [2021-11-06 15:13:36,875 INFO L857 garLoopResultBuilder]: For program point L2892(lines 2892 2895) no Hoare annotation was computed. [2021-11-06 15:13:36,875 INFO L857 garLoopResultBuilder]: For program point L2892-2(lines 2892 2895) no Hoare annotation was computed. [2021-11-06 15:13:36,875 INFO L857 garLoopResultBuilder]: For program point L2892-4(lines 2892 2895) no Hoare annotation was computed. [2021-11-06 15:13:36,875 INFO L857 garLoopResultBuilder]: For program point L2892-6(lines 2892 2895) no Hoare annotation was computed. [2021-11-06 15:13:36,875 INFO L857 garLoopResultBuilder]: For program point L2628(lines 2628 2678) no Hoare annotation was computed. [2021-11-06 15:13:36,875 INFO L857 garLoopResultBuilder]: For program point L2892-8(lines 2892 2895) no Hoare annotation was computed. [2021-11-06 15:13:36,875 INFO L860 garLoopResultBuilder]: At program point L2298(lines 2274 2312) the Hoare annotation is: true [2021-11-06 15:13:36,875 INFO L853 garLoopResultBuilder]: At program point L2298-2(lines 2274 2312) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ 12 ULTIMATE.start_lock_torture_init_~firsterr~0) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-06 15:13:36,875 INFO L853 garLoopResultBuilder]: At program point L2298-1(lines 2274 2312) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) (= ~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) (= |ULTIMATE.start_kmalloc_#res.base| 0)) [2021-11-06 15:13:36,875 INFO L857 garLoopResultBuilder]: For program point L2695(line 2695) no Hoare annotation was computed. [2021-11-06 15:13:36,875 INFO L857 garLoopResultBuilder]: For program point L2629(line 2629) no Hoare annotation was computed. [2021-11-06 15:13:36,876 INFO L853 garLoopResultBuilder]: At program point L2563(lines 2425 2585) the Hoare annotation is: false [2021-11-06 15:13:36,876 INFO L857 garLoopResultBuilder]: For program point L2431(lines 2431 2435) no Hoare annotation was computed. [2021-11-06 15:13:36,876 INFO L857 garLoopResultBuilder]: For program point L2431-2(lines 2425 2585) no Hoare annotation was computed. [2021-11-06 15:13:36,876 INFO L853 garLoopResultBuilder]: At program point L2960(lines 2846 2853) the Hoare annotation is: false [2021-11-06 15:13:36,876 INFO L857 garLoopResultBuilder]: For program point L2696(lines 2696 2711) no Hoare annotation was computed. [2021-11-06 15:13:36,876 INFO L857 garLoopResultBuilder]: For program point L2630(lines 2630 2634) no Hoare annotation was computed. [2021-11-06 15:13:36,876 INFO L857 garLoopResultBuilder]: For program point L2829(line 2829) no Hoare annotation was computed. [2021-11-06 15:13:36,876 INFO L857 garLoopResultBuilder]: For program point L2763(line 2763) no Hoare annotation was computed. [2021-11-06 15:13:36,876 INFO L853 garLoopResultBuilder]: At program point L2565(lines 2425 2585) the Hoare annotation is: false [2021-11-06 15:13:36,876 INFO L857 garLoopResultBuilder]: For program point L2764(lines 2764 2769) no Hoare annotation was computed. [2021-11-06 15:13:36,876 INFO L857 garLoopResultBuilder]: For program point L2698(lines 2698 2704) no Hoare annotation was computed. [2021-11-06 15:13:36,876 INFO L857 garLoopResultBuilder]: For program point L2698-2(lines 2696 2710) no Hoare annotation was computed. [2021-11-06 15:13:36,877 INFO L860 garLoopResultBuilder]: At program point L2368-2(lines 1 3080) the Hoare annotation is: true [2021-11-06 15:13:36,877 INFO L853 garLoopResultBuilder]: At program point L2368-6(lines 2361 2370) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-06 15:13:36,877 INFO L857 garLoopResultBuilder]: For program point L2104(lines 2104 2107) no Hoare annotation was computed. [2021-11-06 15:13:36,877 INFO L853 garLoopResultBuilder]: At program point L2368-9(lines 1 3080) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ 12 ULTIMATE.start_lock_torture_init_~firsterr~0) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-06 15:13:36,877 INFO L857 garLoopResultBuilder]: For program point L2104-1(lines 2104 2107) no Hoare annotation was computed. [2021-11-06 15:13:36,877 INFO L860 garLoopResultBuilder]: At program point L1972(lines 1959 1975) the Hoare annotation is: true [2021-11-06 15:13:36,877 INFO L853 garLoopResultBuilder]: At program point L1972-1(lines 1959 1975) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-06 15:13:36,877 INFO L853 garLoopResultBuilder]: At program point L2963-1(lines 1 3080) the Hoare annotation is: false [2021-11-06 15:13:36,877 INFO L853 garLoopResultBuilder]: At program point L1972-2(lines 1959 1975) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-06 15:13:36,877 INFO L853 garLoopResultBuilder]: At program point L1972-3(lines 1959 1975) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ 12 ULTIMATE.start_lock_torture_init_~firsterr~0) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-06 15:13:36,878 INFO L853 garLoopResultBuilder]: At program point L2963-2(lines 1 3080) the Hoare annotation is: false [2021-11-06 15:13:36,878 INFO L853 garLoopResultBuilder]: At program point L2105-1(lines 2096 2108) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2021-11-06 15:13:36,878 INFO L853 garLoopResultBuilder]: At program point L2105(lines 2096 2108) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2021-11-06 15:13:36,878 INFO L857 garLoopResultBuilder]: For program point L2568(lines 2568 2578) no Hoare annotation was computed. [2021-11-06 15:13:36,878 INFO L853 garLoopResultBuilder]: At program point L2568-2(lines 1 3080) the Hoare annotation is: false [2021-11-06 15:13:36,878 INFO L857 garLoopResultBuilder]: For program point L2304(line 2304) no Hoare annotation was computed. [2021-11-06 15:13:36,878 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-06 15:13:36,878 INFO L857 garLoopResultBuilder]: For program point L2304-2(lines 2303 2305) no Hoare annotation was computed. [2021-11-06 15:13:36,878 INFO L857 garLoopResultBuilder]: For program point L2304-3(line 2304) no Hoare annotation was computed. [2021-11-06 15:13:36,878 INFO L857 garLoopResultBuilder]: For program point L2304-6(line 2304) no Hoare annotation was computed. [2021-11-06 15:13:36,878 INFO L857 garLoopResultBuilder]: For program point L2304-5(lines 2303 2305) no Hoare annotation was computed. [2021-11-06 15:13:36,878 INFO L857 garLoopResultBuilder]: For program point L2304-8(lines 2303 2305) no Hoare annotation was computed. [2021-11-06 15:13:36,879 INFO L853 garLoopResultBuilder]: At program point L3031-1(lines 3030 3032) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-06 15:13:36,879 INFO L853 garLoopResultBuilder]: At program point L3031(lines 3030 3032) the Hoare annotation is: (and (= ~ldv_spin~0 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-06 15:13:36,879 INFO L853 garLoopResultBuilder]: At program point L3031-2(lines 3030 3032) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ 12 ULTIMATE.start_lock_torture_init_~firsterr~0) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~ldv_spin~0 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-06 15:13:36,879 INFO L853 garLoopResultBuilder]: At program point L2503(lines 2425 2585) the Hoare annotation is: false [2021-11-06 15:13:36,879 INFO L857 garLoopResultBuilder]: For program point L2305-1(line 2305) no Hoare annotation was computed. [2021-11-06 15:13:36,879 INFO L857 garLoopResultBuilder]: For program point L2305-3(line 2305) no Hoare annotation was computed. [2021-11-06 15:13:36,879 INFO L857 garLoopResultBuilder]: For program point L2305-5(line 2305) no Hoare annotation was computed. [2021-11-06 15:13:36,879 INFO L853 garLoopResultBuilder]: At program point L2966(lines 2862 2869) the Hoare annotation is: false [2021-11-06 15:13:36,879 INFO L853 garLoopResultBuilder]: At program point L2966-2(lines 2862 2869) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-06 15:13:36,879 INFO L853 garLoopResultBuilder]: At program point L2966-1(lines 2862 2869) the Hoare annotation is: false [2021-11-06 15:13:36,879 INFO L857 garLoopResultBuilder]: For program point L2636(line 2636) no Hoare annotation was computed. [2021-11-06 15:13:36,880 INFO L857 garLoopResultBuilder]: For program point L2637(lines 2637 2641) no Hoare annotation was computed. [2021-11-06 15:13:36,880 INFO L857 garLoopResultBuilder]: For program point L2637-2(lines 2628 2678) no Hoare annotation was computed. [2021-11-06 15:13:36,880 INFO L853 garLoopResultBuilder]: At program point L2505(lines 2425 2585) the Hoare annotation is: false [2021-11-06 15:13:36,880 INFO L860 garLoopResultBuilder]: At program point L2307-1(lines 2265 2313) the Hoare annotation is: true [2021-11-06 15:13:36,880 INFO L857 garLoopResultBuilder]: For program point L2307(lines 2307 2310) no Hoare annotation was computed. [2021-11-06 15:13:36,880 INFO L853 garLoopResultBuilder]: At program point L2307-3(lines 2265 2313) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) (= ~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) (= |ULTIMATE.start_kmalloc_#res.base| 0)) [2021-11-06 15:13:36,880 INFO L857 garLoopResultBuilder]: For program point L2307-2(lines 2307 2310) no Hoare annotation was computed. [2021-11-06 15:13:36,880 INFO L853 garLoopResultBuilder]: At program point L2307-5(lines 2265 2313) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ 12 ULTIMATE.start_lock_torture_init_~firsterr~0) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-06 15:13:36,880 INFO L857 garLoopResultBuilder]: For program point L2307-4(lines 2307 2310) no Hoare annotation was computed. [2021-11-06 15:13:36,880 INFO L857 garLoopResultBuilder]: For program point L2836(line 2836) no Hoare annotation was computed. [2021-11-06 15:13:36,880 INFO L853 garLoopResultBuilder]: At program point L3035(lines 3034 3036) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-06 15:13:36,880 INFO L857 garLoopResultBuilder]: For program point L2771(line 2771) no Hoare annotation was computed. [2021-11-06 15:13:36,880 INFO L857 garLoopResultBuilder]: For program point L2573(lines 2573 2576) no Hoare annotation was computed. [2021-11-06 15:13:36,880 INFO L853 garLoopResultBuilder]: At program point L2970(lines 2969 2971) the Hoare annotation is: false [2021-11-06 15:13:36,881 INFO L853 garLoopResultBuilder]: At program point L2970-1(lines 2969 2971) the Hoare annotation is: false [2021-11-06 15:13:36,881 INFO L853 garLoopResultBuilder]: At program point L2574(lines 1 3080) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ 12 ULTIMATE.start_lock_torture_init_~firsterr~0) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~ldv_spin~0 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-06 15:13:36,881 INFO L857 garLoopResultBuilder]: For program point L2508(lines 2508 2515) no Hoare annotation was computed. [2021-11-06 15:13:36,881 INFO L857 garLoopResultBuilder]: For program point L2508-2(lines 2425 2585) no Hoare annotation was computed. [2021-11-06 15:13:36,881 INFO L853 garLoopResultBuilder]: At program point L2839(lines 2609 2844) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2021-11-06 15:13:36,881 INFO L860 garLoopResultBuilder]: At program point L2707(lines 1 3080) the Hoare annotation is: true [2021-11-06 15:13:36,881 INFO L853 garLoopResultBuilder]: At program point L2179(lines 2173 2181) the Hoare annotation is: false [2021-11-06 15:13:36,881 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-06 15:13:36,881 INFO L853 garLoopResultBuilder]: At program point L3038(lines 3037 3039) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-06 15:13:36,881 INFO L857 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2021-11-06 15:13:36,881 INFO L857 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2021-11-06 15:13:36,881 INFO L857 garLoopResultBuilder]: For program point L-1-3(line -1) no Hoare annotation was computed. [2021-11-06 15:13:36,881 INFO L857 garLoopResultBuilder]: For program point L-1-4(line -1) no Hoare annotation was computed. [2021-11-06 15:13:36,881 INFO L857 garLoopResultBuilder]: For program point L-1-5(line -1) no Hoare annotation was computed. [2021-11-06 15:13:36,881 INFO L857 garLoopResultBuilder]: For program point L-1-6(line -1) no Hoare annotation was computed. [2021-11-06 15:13:36,882 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2013) no Hoare annotation was computed. [2021-11-06 15:13:36,882 INFO L857 garLoopResultBuilder]: For program point L2510(lines 2510 2513) no Hoare annotation was computed. [2021-11-06 15:13:36,882 INFO L853 garLoopResultBuilder]: At program point L2973-1(lines 2972 2974) the Hoare annotation is: (and (= ~ldv_spin~0 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-06 15:13:36,882 INFO L853 garLoopResultBuilder]: At program point L2973(lines 2972 2974) the Hoare annotation is: (and (= ~ldv_spin~0 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-06 15:13:36,882 INFO L853 garLoopResultBuilder]: At program point L2973-3(lines 2972 2974) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-06 15:13:36,882 INFO L853 garLoopResultBuilder]: At program point L2973-2(lines 2972 2974) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-06 15:13:36,882 INFO L853 garLoopResultBuilder]: At program point L2973-5(lines 2972 2974) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ 12 ULTIMATE.start_lock_torture_init_~firsterr~0) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~ldv_spin~0 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-06 15:13:36,882 INFO L853 garLoopResultBuilder]: At program point L2973-4(lines 2972 2974) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ 12 ULTIMATE.start_lock_torture_init_~firsterr~0) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~ldv_spin~0 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-06 15:13:36,882 INFO L857 garLoopResultBuilder]: For program point L2445(lines 2445 2448) no Hoare annotation was computed. [2021-11-06 15:13:36,882 INFO L857 garLoopResultBuilder]: For program point L2379-1(lines 2379 2382) no Hoare annotation was computed. [2021-11-06 15:13:36,882 INFO L857 garLoopResultBuilder]: For program point L2379(lines 2379 2382) no Hoare annotation was computed. [2021-11-06 15:13:36,882 INFO L857 garLoopResultBuilder]: For program point L2379-2(lines 2379 2382) no Hoare annotation was computed. [2021-11-06 15:13:36,882 INFO L857 garLoopResultBuilder]: For program point L1983(lines 1983 1990) no Hoare annotation was computed. [2021-11-06 15:13:36,882 INFO L857 garLoopResultBuilder]: For program point L1983-1(lines 1983 1990) no Hoare annotation was computed. [2021-11-06 15:13:36,882 INFO L857 garLoopResultBuilder]: For program point L1983-2(lines 1983 1990) no Hoare annotation was computed. [2021-11-06 15:13:36,883 INFO L853 garLoopResultBuilder]: At program point L2116(lines 1 3080) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-06 15:13:36,883 INFO L853 garLoopResultBuilder]: At program point L2116-2(lines 2113 2118) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2021-11-06 15:13:36,883 INFO L853 garLoopResultBuilder]: At program point L2116-1(lines 2113 2118) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2021-11-06 15:13:36,883 INFO L860 garLoopResultBuilder]: At program point L2843(lines 2596 2845) the Hoare annotation is: true [2021-11-06 15:13:36,883 INFO L857 garLoopResultBuilder]: For program point L2778(line 2778) no Hoare annotation was computed. [2021-11-06 15:13:36,883 INFO L857 garLoopResultBuilder]: For program point L2779(lines 2779 2834) no Hoare annotation was computed. [2021-11-06 15:13:36,883 INFO L857 garLoopResultBuilder]: For program point L2713(line 2713) no Hoare annotation was computed. [2021-11-06 15:13:36,883 INFO L857 garLoopResultBuilder]: For program point L2383(lines 2383 2397) no Hoare annotation was computed. [2021-11-06 15:13:36,883 INFO L857 garLoopResultBuilder]: For program point L2383-3(lines 2383 2397) no Hoare annotation was computed. [2021-11-06 15:13:36,883 INFO L857 garLoopResultBuilder]: For program point L2383-2(lines 2383 2397) no Hoare annotation was computed. [2021-11-06 15:13:36,883 INFO L857 garLoopResultBuilder]: For program point L2383-5(lines 2383 2397) no Hoare annotation was computed. [2021-11-06 15:13:36,884 INFO L857 garLoopResultBuilder]: For program point L2383-6(lines 2383 2397) no Hoare annotation was computed. [2021-11-06 15:13:36,884 INFO L857 garLoopResultBuilder]: For program point L2383-8(lines 2383 2397) no Hoare annotation was computed. [2021-11-06 15:13:36,884 INFO L857 garLoopResultBuilder]: For program point L2648(line 2648) no Hoare annotation was computed. [2021-11-06 15:13:36,884 INFO L853 garLoopResultBuilder]: At program point L2450(lines 2425 2585) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-06 15:13:36,884 INFO L857 garLoopResultBuilder]: For program point L2516-1(lines 2425 2585) no Hoare annotation was computed. [2021-11-06 15:13:36,884 INFO L853 garLoopResultBuilder]: At program point L2186(lines 2182 2188) the Hoare annotation is: false [2021-11-06 15:13:36,884 INFO L853 garLoopResultBuilder]: At program point L2186-1(lines 2182 2188) the Hoare annotation is: false [2021-11-06 15:13:36,884 INFO L857 garLoopResultBuilder]: For program point L2781(lines 2781 2831) no Hoare annotation was computed. [2021-11-06 15:13:36,884 INFO L857 garLoopResultBuilder]: For program point L2649(lines 2649 2653) no Hoare annotation was computed. [2021-11-06 15:13:36,884 INFO L857 garLoopResultBuilder]: For program point L2649-2(lines 2628 2678) no Hoare annotation was computed. [2021-11-06 15:13:36,885 INFO L853 garLoopResultBuilder]: At program point L1989(lines 1976 1992) the Hoare annotation is: (and (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-06 15:13:36,885 INFO L853 garLoopResultBuilder]: At program point L1989-1(lines 1976 1992) the Hoare annotation is: (and (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-06 15:13:36,885 INFO L853 garLoopResultBuilder]: At program point L1989-2(lines 1976 1992) the Hoare annotation is: (and (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-06 15:13:36,885 INFO L857 garLoopResultBuilder]: For program point L2782(line 2782) no Hoare annotation was computed. [2021-11-06 15:13:36,885 INFO L853 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 (<= (+ 12 ULTIMATE.start_lock_torture_init_~firsterr~0) 0) (<= (+ |ULTIMATE.start_lock_torture_init_#res| 12) 0) .cse1) (and .cse0 .cse1 (<= (+ |ULTIMATE.start_lock_torture_init_#res| 16) 0)))) [2021-11-06 15:13:36,885 INFO L857 garLoopResultBuilder]: For program point L2518(lines 2518 2521) no Hoare annotation was computed. [2021-11-06 15:13:36,885 INFO L853 garLoopResultBuilder]: At program point L2452(lines 2425 2585) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-06 15:13:36,885 INFO L857 garLoopResultBuilder]: For program point L2783(lines 2783 2787) no Hoare annotation was computed. [2021-11-06 15:13:36,885 INFO L853 garLoopResultBuilder]: At program point L2982(lines 2981 2983) the Hoare annotation is: (and (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-06 15:13:36,886 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 2013) no Hoare annotation was computed. [2021-11-06 15:13:36,886 INFO L853 garLoopResultBuilder]: At program point L3049-1(lines 3048 3050) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) (= ~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) (= |ULTIMATE.start_kmalloc_#res.base| 0)) [2021-11-06 15:13:36,886 INFO L860 garLoopResultBuilder]: At program point L3049(lines 3048 3050) the Hoare annotation is: true [2021-11-06 15:13:36,886 INFO L853 garLoopResultBuilder]: At program point L3049-2(lines 3048 3050) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ 12 ULTIMATE.start_lock_torture_init_~firsterr~0) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-06 15:13:36,886 INFO L853 garLoopResultBuilder]: At program point L2455(lines 2425 2585) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-06 15:13:36,886 INFO L853 garLoopResultBuilder]: At program point L2389-1(lines 2383 2396) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-06 15:13:36,886 INFO L853 garLoopResultBuilder]: At program point L2389(lines 2383 2396) the Hoare annotation is: (and (= ~ldv_spin~0 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-06 15:13:36,886 INFO L857 garLoopResultBuilder]: For program point L2323-1(lines 2323 2327) no Hoare annotation was computed. [2021-11-06 15:13:36,886 INFO L857 garLoopResultBuilder]: For program point L2323(lines 2323 2327) no Hoare annotation was computed. [2021-11-06 15:13:36,887 INFO L853 garLoopResultBuilder]: At program point L2389-2(lines 2383 2396) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ 12 ULTIMATE.start_lock_torture_init_~firsterr~0) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~ldv_spin~0 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-06 15:13:36,887 INFO L857 garLoopResultBuilder]: For program point L2323-2(lines 2323 2327) no Hoare annotation was computed. [2021-11-06 15:13:36,887 INFO L857 garLoopResultBuilder]: For program point L2720(line 2720) no Hoare annotation was computed. [2021-11-06 15:13:36,887 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 2013) no Hoare annotation was computed. [2021-11-06 15:13:36,887 INFO L857 garLoopResultBuilder]: For program point L2721(lines 2721 2776) no Hoare annotation was computed. [2021-11-06 15:13:36,887 INFO L853 garLoopResultBuilder]: At program point L2391-1(lines 2383 2396) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-06 15:13:36,887 INFO L853 garLoopResultBuilder]: At program point L2391(lines 2383 2396) the Hoare annotation is: (and (= ~ldv_spin~0 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-06 15:13:36,887 INFO L853 garLoopResultBuilder]: At program point L2391-2(lines 2383 2396) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ 12 ULTIMATE.start_lock_torture_init_~firsterr~0) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~ldv_spin~0 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-06 15:13:36,887 INFO L853 garLoopResultBuilder]: At program point L2127(lines 2123 2129) the Hoare annotation is: false [2021-11-06 15:13:36,887 INFO L853 garLoopResultBuilder]: At program point L2986(lines 2985 2987) the Hoare annotation is: false [2021-11-06 15:13:36,888 INFO L857 garLoopResultBuilder]: For program point L2524-1(lines 2425 2585) no Hoare annotation was computed. [2021-11-06 15:13:36,888 INFO L853 garLoopResultBuilder]: At program point L3053(lines 3052 3054) the Hoare annotation is: false [2021-11-06 15:13:36,888 INFO L857 garLoopResultBuilder]: For program point L2789(line 2789) no Hoare annotation was computed. [2021-11-06 15:13:36,888 INFO L857 garLoopResultBuilder]: For program point L2723(lines 2723 2773) no Hoare annotation was computed. [2021-11-06 15:13:36,888 INFO L857 garLoopResultBuilder]: For program point L2790(lines 2790 2794) no Hoare annotation was computed. [2021-11-06 15:13:36,888 INFO L857 garLoopResultBuilder]: For program point L2724(line 2724) no Hoare annotation was computed. [2021-11-06 15:13:36,888 INFO L857 garLoopResultBuilder]: For program point L2790-2(lines 2781 2831) no Hoare annotation was computed. [2021-11-06 15:13:36,888 INFO L857 garLoopResultBuilder]: For program point L2526(lines 2526 2529) no Hoare annotation was computed. [2021-11-06 15:13:36,888 INFO L857 garLoopResultBuilder]: For program point L2725(lines 2725 2729) no Hoare annotation was computed. [2021-11-06 15:13:36,888 INFO L853 garLoopResultBuilder]: At program point L2990(lines 2989 2991) the Hoare annotation is: false [2021-11-06 15:13:36,888 INFO L857 garLoopResultBuilder]: For program point L2660(line 2660) no Hoare annotation was computed. [2021-11-06 15:13:36,888 INFO L853 garLoopResultBuilder]: At program point L3057-1(lines 3056 3058) the Hoare annotation is: false [2021-11-06 15:13:36,889 INFO L853 garLoopResultBuilder]: At program point L3057(lines 3056 3058) the Hoare annotation is: false [2021-11-06 15:13:36,889 INFO L853 garLoopResultBuilder]: At program point L3057-3(lines 3056 3058) the Hoare annotation is: false [2021-11-06 15:13:36,889 INFO L853 garLoopResultBuilder]: At program point L3057-2(lines 3056 3058) the Hoare annotation is: false [2021-11-06 15:13:36,889 INFO L853 garLoopResultBuilder]: At program point L3057-5(lines 3056 3058) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2021-11-06 15:13:36,889 INFO L853 garLoopResultBuilder]: At program point L3057-4(lines 3056 3058) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2021-11-06 15:13:36,889 INFO L853 garLoopResultBuilder]: At program point L3057-7(lines 3056 3058) the Hoare annotation is: false [2021-11-06 15:13:36,889 INFO L853 garLoopResultBuilder]: At program point L3057-6(lines 3056 3058) the Hoare annotation is: false [2021-11-06 15:13:36,889 INFO L853 garLoopResultBuilder]: At program point L3057-9(lines 3056 3058) the Hoare annotation is: false [2021-11-06 15:13:36,889 INFO L853 garLoopResultBuilder]: At program point L3057-8(lines 3056 3058) the Hoare annotation is: false [2021-11-06 15:13:36,889 INFO L857 garLoopResultBuilder]: For program point L2661(lines 2661 2666) no Hoare annotation was computed. [2021-11-06 15:13:36,890 INFO L853 garLoopResultBuilder]: At program point L2926(lines 2922 2928) the Hoare annotation is: false [2021-11-06 15:13:36,890 INFO L853 garLoopResultBuilder]: At program point L2926-1(lines 2922 2928) the Hoare annotation is: false [2021-11-06 15:13:36,890 INFO L853 garLoopResultBuilder]: At program point L2464(lines 2456 2472) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-06 15:13:36,890 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-06 15:13:36,890 INFO L853 garLoopResultBuilder]: At program point L2994(lines 2993 2995) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2021-11-06 15:13:36,890 INFO L860 garLoopResultBuilder]: At program point L1937(lines 1935 1938) the Hoare annotation is: true [2021-11-06 15:13:36,890 INFO L853 garLoopResultBuilder]: At program point L1937-1(lines 1935 1938) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-06 15:13:36,890 INFO L853 garLoopResultBuilder]: At program point L1937-2(lines 1935 1938) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-06 15:13:36,890 INFO L853 garLoopResultBuilder]: At program point L1937-3(lines 1935 1938) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ 12 ULTIMATE.start_lock_torture_init_~firsterr~0) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-06 15:13:36,890 INFO L853 garLoopResultBuilder]: At program point L2466(lines 2456 2472) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-06 15:13:36,891 INFO L857 garLoopResultBuilder]: For program point L2532-1(lines 2532 2539) no Hoare annotation was computed. [2021-11-06 15:13:36,891 INFO L853 garLoopResultBuilder]: At program point L3061(lines 3060 3062) the Hoare annotation is: false [2021-11-06 15:13:36,891 INFO L857 garLoopResultBuilder]: For program point L2731(line 2731) no Hoare annotation was computed. [2021-11-06 15:13:36,891 INFO L857 garLoopResultBuilder]: For program point L2401-1(lines 2401 2410) no Hoare annotation was computed. [2021-11-06 15:13:36,891 INFO L857 garLoopResultBuilder]: For program point L2401(lines 2401 2410) no Hoare annotation was computed. [2021-11-06 15:13:36,891 INFO L857 garLoopResultBuilder]: For program point L2401-2(lines 2401 2410) no Hoare annotation was computed. [2021-11-06 15:13:36,891 INFO L857 garLoopResultBuilder]: For program point L2732(lines 2732 2736) no Hoare annotation was computed. [2021-11-06 15:13:36,891 INFO L857 garLoopResultBuilder]: For program point L2732-2(lines 2723 2773) no Hoare annotation was computed. [2021-11-06 15:13:36,891 INFO L857 garLoopResultBuilder]: For program point L2534(lines 2534 2537) no Hoare annotation was computed. [2021-11-06 15:13:36,891 INFO L853 garLoopResultBuilder]: At program point L2998(lines 2997 2999) the Hoare annotation is: false [2021-11-06 15:13:36,891 INFO L857 garLoopResultBuilder]: For program point L2668(line 2668) no Hoare annotation was computed. [2021-11-06 15:13:36,891 INFO L853 garLoopResultBuilder]: At program point L2933-1(lines 2929 2935) the Hoare annotation is: false [2021-11-06 15:13:36,891 INFO L853 garLoopResultBuilder]: At program point L2933(lines 2929 2935) the Hoare annotation is: false [2021-11-06 15:13:36,892 INFO L853 garLoopResultBuilder]: At program point L2933-3(lines 2929 2935) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-06 15:13:36,892 INFO L853 garLoopResultBuilder]: At program point L2933-2(lines 2929 2935) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-06 15:13:36,892 INFO L853 garLoopResultBuilder]: At program point L2933-5(lines 2929 2935) the Hoare annotation is: false [2021-11-06 15:13:36,892 INFO L853 garLoopResultBuilder]: At program point L2933-4(lines 2929 2935) the Hoare annotation is: false [2021-11-06 15:13:36,892 INFO L857 garLoopResultBuilder]: For program point L2801(line 2801) no Hoare annotation was computed. [2021-11-06 15:13:36,892 INFO L857 garLoopResultBuilder]: For program point L2669(lines 2669 2674) no Hoare annotation was computed. [2021-11-06 15:13:36,892 INFO L857 garLoopResultBuilder]: For program point L2405-1(lines 2405 2409) no Hoare annotation was computed. [2021-11-06 15:13:36,892 INFO L857 garLoopResultBuilder]: For program point L2405(lines 2405 2409) no Hoare annotation was computed. [2021-11-06 15:13:36,892 INFO L857 garLoopResultBuilder]: For program point L2405-2(lines 2405 2409) no Hoare annotation was computed. [2021-11-06 15:13:36,893 INFO L860 garLoopResultBuilder]: At program point L2009(lines 2889 2898) the Hoare annotation is: true [2021-11-06 15:13:36,893 INFO L853 garLoopResultBuilder]: At program point L2009-1(lines 2889 2898) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-06 15:13:36,893 INFO L853 garLoopResultBuilder]: At program point L2009-2(lines 2889 2898) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-06 15:13:36,893 INFO L853 garLoopResultBuilder]: At program point L2009-3(lines 2889 2898) the Hoare annotation is: false [2021-11-06 15:13:36,893 INFO L853 garLoopResultBuilder]: At program point L2009-4(lines 2889 2898) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ 12 ULTIMATE.start_lock_torture_init_~firsterr~0) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-06 15:13:36,893 INFO L857 garLoopResultBuilder]: For program point L2802(lines 2802 2806) no Hoare annotation was computed. [2021-11-06 15:13:36,893 INFO L857 garLoopResultBuilder]: For program point L2802-2(lines 2781 2831) no Hoare annotation was computed. [2021-11-06 15:13:36,893 INFO L857 garLoopResultBuilder]: For program point L2142(lines 2142 2155) no Hoare annotation was computed. [2021-11-06 15:13:36,893 INFO L857 garLoopResultBuilder]: For program point L2142-2(lines 2142 2155) no Hoare annotation was computed. [2021-11-06 15:13:36,893 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-06 15:13:36,894 INFO L857 garLoopResultBuilder]: For program point L2142-3(lines 2142 2155) no Hoare annotation was computed. [2021-11-06 15:13:36,894 INFO L857 garLoopResultBuilder]: For program point L2142-6(lines 2142 2155) no Hoare annotation was computed. [2021-11-06 15:13:36,894 INFO L857 garLoopResultBuilder]: For program point L2142-5(lines 2142 2155) no Hoare annotation was computed. [2021-11-06 15:13:36,894 INFO L857 garLoopResultBuilder]: For program point L2142-8(lines 2142 2155) no Hoare annotation was computed. [2021-11-06 15:13:36,894 INFO L857 garLoopResultBuilder]: For program point L2142-9(lines 2142 2155) no Hoare annotation was computed. [2021-11-06 15:13:36,894 INFO L857 garLoopResultBuilder]: For program point L2142-11(lines 2142 2155) no Hoare annotation was computed. [2021-11-06 15:13:36,894 INFO L853 garLoopResultBuilder]: At program point L3068(lines 3067 3069) the Hoare annotation is: false [2021-11-06 15:13:36,894 INFO L853 garLoopResultBuilder]: At program point L3002(lines 3001 3003) the Hoare annotation is: false [2021-11-06 15:13:36,894 INFO L860 garLoopResultBuilder]: At program point L1945(lines 1940 1947) the Hoare annotation is: true [2021-11-06 15:13:36,894 INFO L853 garLoopResultBuilder]: At program point L1945-1(lines 1940 1947) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-06 15:13:36,894 INFO L853 garLoopResultBuilder]: At program point L1945-2(lines 1940 1947) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-06 15:13:36,895 INFO L853 garLoopResultBuilder]: At program point L1945-3(lines 1940 1947) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ 12 ULTIMATE.start_lock_torture_init_~firsterr~0) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-06 15:13:36,895 INFO L857 garLoopResultBuilder]: For program point L2474(lines 2474 2477) no Hoare annotation was computed. [2021-11-06 15:13:36,895 INFO L857 garLoopResultBuilder]: For program point L2474-2(lines 2425 2585) no Hoare annotation was computed. [2021-11-06 15:13:36,895 INFO L857 garLoopResultBuilder]: For program point L2012(line 2012) no Hoare annotation was computed. [2021-11-06 15:13:36,895 INFO L857 garLoopResultBuilder]: For program point L2012-1(line 2012) no Hoare annotation was computed. [2021-11-06 15:13:36,895 INFO L857 garLoopResultBuilder]: For program point L2012-2(line 2012) no Hoare annotation was computed. [2021-11-06 15:13:36,895 INFO L857 garLoopResultBuilder]: For program point L2012-3(line 2012) no Hoare annotation was computed. [2021-11-06 15:13:36,895 INFO L853 garLoopResultBuilder]: At program point L1880(lines 1875 1882) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-06 15:13:36,895 INFO L857 garLoopResultBuilder]: For program point L2012-4(line 2012) no Hoare annotation was computed. [2021-11-06 15:13:36,895 INFO L857 garLoopResultBuilder]: For program point L2542(lines 2542 2550) no Hoare annotation was computed. [2021-11-06 15:13:36,896 INFO L857 garLoopResultBuilder]: For program point L2543(lines 2543 2546) no Hoare annotation was computed. [2021-11-06 15:13:36,896 INFO L857 garLoopResultBuilder]: For program point L2543-2(lines 2543 2546) no Hoare annotation was computed. [2021-11-06 15:13:36,896 INFO L853 garLoopResultBuilder]: At program point L3072(lines 3071 3073) the Hoare annotation is: false [2021-11-06 15:13:36,896 INFO L853 garLoopResultBuilder]: At program point L3006(lines 3005 3007) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2021-11-06 15:13:36,896 INFO L857 garLoopResultBuilder]: For program point L2676(line 2676) no Hoare annotation was computed. [2021-11-06 15:13:36,896 INFO L857 garLoopResultBuilder]: For program point L2478-1(lines 2478 2483) no Hoare annotation was computed. [2021-11-06 15:13:36,896 INFO L857 garLoopResultBuilder]: For program point L2743(line 2743) no Hoare annotation was computed. [2021-11-06 15:13:36,899 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 15:13:36,900 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-06 15:13:36,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 03:13:36 BoogieIcfgContainer [2021-11-06 15:13:36,937 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-06 15:13:36,938 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-06 15:13:36,938 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-06 15:13:36,938 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-06 15:13:36,938 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 03:13:23" (3/4) ... [2021-11-06 15:13:36,941 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-06 15:13:36,983 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 161 nodes and edges [2021-11-06 15:13:36,985 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 63 nodes and edges [2021-11-06 15:13:36,987 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2021-11-06 15:13:36,989 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-11-06 15:13:36,991 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-06 15:13:36,993 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-06 15:13:36,994 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-06 15:13:37,041 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((ldv_state_variable_0 == 1 && 12 + firsterr <= 0) && \result + 12 <= 0) && nwriters_stress + 1 <= 0) || ((ldv_state_variable_0 == 1 && nwriters_stress + 1 <= 0) && \result + 16 <= 0) [2021-11-06 15:13:37,043 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && \result == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) && \result == 0 [2021-11-06 15:13:37,044 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && \result == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) && \result == 0 [2021-11-06 15:13:37,044 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && \result == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) && \result == 0 [2021-11-06 15:13:37,044 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && \result == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) && \result == 0 [2021-11-06 15:13:37,044 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && \result == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) && \result == 0 [2021-11-06 15:13:37,044 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && \result == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) && \result == 0 [2021-11-06 15:13:37,045 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && \result == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) && \result == 0 [2021-11-06 15:13:37,045 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && \result == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) && \result == 0 [2021-11-06 15:13:37,162 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-06 15:13:37,162 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-06 15:13:37,164 INFO L168 Benchmark]: Toolchain (without parser) took 15946.68 ms. Allocated memory was 92.3 MB in the beginning and 767.6 MB in the end (delta: 675.3 MB). Free memory was 61.4 MB in the beginning and 652.9 MB in the end (delta: -591.4 MB). Peak memory consumption was 355.6 MB. Max. memory is 16.1 GB. [2021-11-06 15:13:37,164 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 92.3 MB. Free memory was 49.9 MB in the beginning and 49.9 MB in the end (delta: 52.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-06 15:13:37,165 INFO L168 Benchmark]: CACSL2BoogieTranslator took 824.04 ms. Allocated memory was 92.3 MB in the beginning and 140.5 MB in the end (delta: 48.2 MB). Free memory was 61.2 MB in the beginning and 81.7 MB in the end (delta: -20.5 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.1 GB. [2021-11-06 15:13:37,165 INFO L168 Benchmark]: Boogie Procedure Inliner took 130.19 ms. Allocated memory is still 140.5 MB. Free memory was 81.7 MB in the beginning and 106.9 MB in the end (delta: -25.2 MB). Peak memory consumption was 10.9 MB. Max. memory is 16.1 GB. [2021-11-06 15:13:37,165 INFO L168 Benchmark]: Boogie Preprocessor took 70.71 ms. Allocated memory is still 140.5 MB. Free memory was 106.9 MB in the beginning and 99.3 MB in the end (delta: 7.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-06 15:13:37,165 INFO L168 Benchmark]: RCFGBuilder took 1550.73 ms. Allocated memory was 140.5 MB in the beginning and 199.2 MB in the end (delta: 58.7 MB). Free memory was 99.3 MB in the beginning and 145.6 MB in the end (delta: -46.3 MB). Peak memory consumption was 59.4 MB. Max. memory is 16.1 GB. [2021-11-06 15:13:37,166 INFO L168 Benchmark]: TraceAbstraction took 13138.99 ms. Allocated memory was 199.2 MB in the beginning and 513.8 MB in the end (delta: 314.6 MB). Free memory was 145.6 MB in the beginning and 130.7 MB in the end (delta: 14.9 MB). Peak memory consumption was 329.5 MB. Max. memory is 16.1 GB. [2021-11-06 15:13:37,166 INFO L168 Benchmark]: Witness Printer took 224.73 ms. Allocated memory was 513.8 MB in the beginning and 767.6 MB in the end (delta: 253.8 MB). Free memory was 130.7 MB in the beginning and 652.9 MB in the end (delta: -522.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-11-06 15:13:37,168 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.18 ms. Allocated memory is still 92.3 MB. Free memory was 49.9 MB in the beginning and 49.9 MB in the end (delta: 52.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 824.04 ms. Allocated memory was 92.3 MB in the beginning and 140.5 MB in the end (delta: 48.2 MB). Free memory was 61.2 MB in the beginning and 81.7 MB in the end (delta: -20.5 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 130.19 ms. Allocated memory is still 140.5 MB. Free memory was 81.7 MB in the beginning and 106.9 MB in the end (delta: -25.2 MB). Peak memory consumption was 10.9 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 70.71 ms. Allocated memory is still 140.5 MB. Free memory was 106.9 MB in the beginning and 99.3 MB in the end (delta: 7.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1550.73 ms. Allocated memory was 140.5 MB in the beginning and 199.2 MB in the end (delta: 58.7 MB). Free memory was 99.3 MB in the beginning and 145.6 MB in the end (delta: -46.3 MB). Peak memory consumption was 59.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 13138.99 ms. Allocated memory was 199.2 MB in the beginning and 513.8 MB in the end (delta: 314.6 MB). Free memory was 145.6 MB in the beginning and 130.7 MB in the end (delta: 14.9 MB). Peak memory consumption was 329.5 MB. Max. memory is 16.1 GB. * Witness Printer took 224.73 ms. Allocated memory was 513.8 MB in the beginning and 767.6 MB in the end (delta: 253.8 MB). Free memory was 130.7 MB in the beginning and 652.9 MB in the end (delta: -522.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * 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 - PositiveResult [Line: 2013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 2013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 2013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - 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 1 procedures, 350 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 13.0s, OverallIterations: 15, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.9s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 7527 SDtfs, 5157 SDslu, 6211 SDs, 0 SdLazy, 253 SolverSat, 72 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 203 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15962occurred in iteration=12, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 6575 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 149 LocationsWithAnnotation, 149 PreInvPairs, 699 NumberOfFragments, 2339 HoareAnnotationTreeSize, 149 FomulaSimplifications, 17502 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 149 FomulaSimplificationsInter, 1494 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1020 NumberOfCodeBlocks, 1020 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1003 ConstructedInterpolants, 0 QuantifiedInterpolants, 1745 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1928 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 17 InterpolantComputations, 15 PerfectInterpolantSequences, 198/224 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 5 specifications checked. All of them hold - InvariantResult [Line: 2889]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && 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: 1875]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && 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: 1893]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2274]: Loop Invariant Derived loop invariant: ((ldv_state_variable_0 == 1 && 12 + firsterr <= 0) && tmp___0 == 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 3067]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1959]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && 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: 1940]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && 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: 1893]: Loop Invariant Derived loop invariant: (((((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && \result == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) && \result == 0 - InvariantResult [Line: 2096]: 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: 1]: Loop Invariant Derived loop invariant: (((ldv_state_variable_0 == 1 && 12 + firsterr <= 0) && tmp___0 == 0) && ldv_spin == 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 2182]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3048]: Loop Invariant Derived loop invariant: (((((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && \result == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) && \result == 0 - InvariantResult [Line: 2274]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2929]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2383]: Loop Invariant Derived loop invariant: (((ldv_state_variable_0 == 1 && 12 + firsterr <= 0) && tmp___0 == 0) && ldv_spin == 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 2361]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && 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: 2414]: Loop Invariant Derived loop invariant: (((ldv_state_variable_0 == 1 && 12 + firsterr <= 0) && \result + 12 <= 0) && nwriters_stress + 1 <= 0) || ((ldv_state_variable_0 == 1 && nwriters_stress + 1 <= 0) && \result + 16 <= 0) - InvariantResult [Line: 2130]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2425]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && 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: 2889]: Loop Invariant Derived loop invariant: 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: 2173]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2113]: 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: 3056]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3056]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1976]: 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: 1]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && 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: 2383]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && 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: 2274]: Loop Invariant Derived loop invariant: (((((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && \result == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) && \result == 0 - InvariantResult [Line: 2383]: Loop Invariant Derived loop invariant: ldv_spin == 0 && nwriters_stress + 1 <= 0 - 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: 2929]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2130]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2425]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3001]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2929]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && 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: 2871]: Loop Invariant Derived loop invariant: ((ldv_state_variable_0 == 1 && 12 + firsterr <= 0) && tmp___0 == 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1935]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2113]: 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: 1]: Loop Invariant Derived loop invariant: (((((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && \result == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) && \result == 0 - InvariantResult [Line: 2425]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1885]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && 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: 1940]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && 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: 3030]: Loop Invariant Derived loop invariant: (((ldv_state_variable_0 == 1 && 12 + firsterr <= 0) && tmp___0 == 0) && ldv_spin == 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 2142]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2929]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && 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: 2456]: Loop Invariant Derived loop invariant: (ldv_state_variable_0 == 1 && tmp___0 == 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 2862]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2265]: Loop Invariant Derived loop invariant: (((((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && \result == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) && \result == 0 - InvariantResult [Line: 2383]: Loop Invariant Derived loop invariant: (((ldv_state_variable_0 == 1 && 12 + firsterr <= 0) && tmp___0 == 0) && ldv_spin == 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 2862]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2182]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2989]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1935]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && 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: 2972]: Loop Invariant Derived loop invariant: (((ldv_state_variable_0 == 1 && 12 + firsterr <= 0) && tmp___0 == 0) && ldv_spin == 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 3056]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3052]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2972]: Loop Invariant Derived loop invariant: ldv_spin == 0 && nwriters_stress + 1 <= 0 - InvariantResult [Line: 2425]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2969]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2142]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3071]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2142]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1893]: Loop Invariant Derived loop invariant: ((ldv_state_variable_0 == 1 && 12 + firsterr <= 0) && tmp___0 == 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 3030]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && 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: 2130]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: 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: 1]: Loop Invariant Derived loop invariant: ((ldv_state_variable_0 == 1 && 12 + firsterr <= 0) && tmp___0 == 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 2889]: Loop Invariant Derived loop invariant: ((ldv_state_variable_0 == 1 && 12 + firsterr <= 0) && tmp___0 == 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 2018]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2871]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2846]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3060]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3056]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2425]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && 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: 2871]: Loop Invariant Derived loop invariant: (((((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && \result == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) && \result == 0 - InvariantResult [Line: 3030]: Loop Invariant Derived loop invariant: ldv_spin == 0 && nwriters_stress + 1 <= 0 - InvariantResult [Line: 2265]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1935]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && 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: 1976]: 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: 2087]: 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: 2969]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2997]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2274]: Loop Invariant Derived loop invariant: (((((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && \result == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) && \result == 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: 3056]: 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: 1940]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2096]: 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: 3056]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2383]: Loop Invariant Derived loop invariant: ldv_spin == 0 && nwriters_stress + 1 <= 0 - InvariantResult [Line: 2018]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2889]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((ldv_state_variable_0 == 1 && 12 + firsterr <= 0) && tmp___0 == 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 2922]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2985]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2425]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2018]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: 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: 2130]: Loop Invariant Derived loop invariant: 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: 3056]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2142]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1959]: Loop Invariant Derived loop invariant: ((ldv_state_variable_0 == 1 && 12 + firsterr <= 0) && tmp___0 == 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 3056]: 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: 2862]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && 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: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1976]: 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: 2425]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && 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: 1940]: Loop Invariant Derived loop invariant: ((ldv_state_variable_0 == 1 && 12 + firsterr <= 0) && tmp___0 == 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 1959]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2972]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && 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: 2889]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && 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: 2265]: Loop Invariant Derived loop invariant: ((ldv_state_variable_0 == 1 && 12 + firsterr <= 0) && tmp___0 == 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 2950]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && 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: 3048]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1935]: Loop Invariant Derived loop invariant: ((ldv_state_variable_0 == 1 && 12 + firsterr <= 0) && tmp___0 == 0) && nwriters_stress + 1 <= 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: 2274]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2871]: Loop Invariant Derived loop invariant: (((((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && \result == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) && \result == 0 - InvariantResult [Line: 2018]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2972]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && 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: 2972]: Loop Invariant Derived loop invariant: (((ldv_state_variable_0 == 1 && 12 + firsterr <= 0) && tmp___0 == 0) && ldv_spin == 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 2880]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2383]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && 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: 3056]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2929]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2274]: Loop Invariant Derived loop invariant: ((ldv_state_variable_0 == 1 && 12 + firsterr <= 0) && tmp___0 == 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 3056]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2972]: Loop Invariant Derived loop invariant: ldv_spin == 0 && nwriters_stress + 1 <= 0 - InvariantResult [Line: 2922]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2018]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2081]: 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: 3037]: Loop Invariant Derived loop invariant: (ldv_state_variable_0 == 1 && tmp___0 == 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 3048]: Loop Invariant Derived loop invariant: ((ldv_state_variable_0 == 1 && 12 + firsterr <= 0) && tmp___0 == 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 2087]: 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: 2123]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2456]: Loop Invariant Derived loop invariant: (ldv_state_variable_0 == 1 && tmp___0 == 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 1959]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && 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: 2929]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2021-11-06 15:13:37,288 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