./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/pc_sfifo_1.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5fbdf5bf 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/AutomizerTermination.xml -i ../sv-benchmarks/c/systemc/pc_sfifo_1.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b60d0a2361544de13d982747fad9d912bc87905e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-31 04:18:09,839 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-31 04:18:09,850 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-31 04:18:09,878 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-31 04:18:09,879 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-31 04:18:09,879 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-31 04:18:09,880 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-31 04:18:09,882 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-31 04:18:09,883 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-31 04:18:09,884 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-31 04:18:09,884 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-31 04:18:09,885 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-31 04:18:09,885 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-31 04:18:09,886 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-31 04:18:09,887 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-31 04:18:09,888 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-31 04:18:09,888 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-31 04:18:09,889 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-31 04:18:09,890 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-31 04:18:09,891 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-31 04:18:09,892 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-31 04:18:09,893 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-31 04:18:09,894 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-31 04:18:09,894 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-31 04:18:09,896 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-31 04:18:09,897 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-31 04:18:09,897 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-31 04:18:09,897 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-31 04:18:09,898 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-31 04:18:09,898 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-31 04:18:09,899 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-31 04:18:09,899 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-31 04:18:09,900 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-31 04:18:09,900 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-31 04:18:09,901 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-31 04:18:09,901 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-31 04:18:09,902 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-31 04:18:09,902 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-31 04:18:09,902 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-31 04:18:09,903 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-31 04:18:09,903 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-31 04:18:09,904 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-31 04:18:09,925 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-31 04:18:09,925 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-31 04:18:09,925 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-31 04:18:09,925 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-31 04:18:09,926 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-31 04:18:09,926 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-31 04:18:09,926 INFO L138 SettingsManager]: * Use SBE=true [2021-08-31 04:18:09,926 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-31 04:18:09,926 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-31 04:18:09,926 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-31 04:18:09,926 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-31 04:18:09,927 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-31 04:18:09,927 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-31 04:18:09,927 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-31 04:18:09,927 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-31 04:18:09,927 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-31 04:18:09,927 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-31 04:18:09,927 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-31 04:18:09,927 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-31 04:18:09,927 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-31 04:18:09,927 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-31 04:18:09,928 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-31 04:18:09,928 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-31 04:18:09,928 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-31 04:18:09,928 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-31 04:18:09,928 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-31 04:18:09,928 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-31 04:18:09,928 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-31 04:18:09,928 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-31 04:18:09,928 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-31 04:18:09,929 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-31 04:18:09,929 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-31 04:18:09,929 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-31 04:18:09,929 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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(F end) ) 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b60d0a2361544de13d982747fad9d912bc87905e [2021-08-31 04:18:10,180 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-31 04:18:10,194 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-31 04:18:10,196 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-31 04:18:10,197 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-31 04:18:10,197 INFO L275 PluginConnector]: CDTParser initialized [2021-08-31 04:18:10,199 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_1.cil-1.c [2021-08-31 04:18:10,251 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87645666e/57c1216243ef4a8c89edbbea7c67da91/FLAG80bf5f12b [2021-08-31 04:18:10,635 INFO L306 CDTParser]: Found 1 translation units. [2021-08-31 04:18:10,635 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_1.cil-1.c [2021-08-31 04:18:10,643 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87645666e/57c1216243ef4a8c89edbbea7c67da91/FLAG80bf5f12b [2021-08-31 04:18:10,656 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87645666e/57c1216243ef4a8c89edbbea7c67da91 [2021-08-31 04:18:10,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-31 04:18:10,660 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-31 04:18:10,662 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-31 04:18:10,662 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-31 04:18:10,664 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-31 04:18:10,664 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 04:18:10" (1/1) ... [2021-08-31 04:18:10,665 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@388401cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:18:10, skipping insertion in model container [2021-08-31 04:18:10,665 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 04:18:10" (1/1) ... [2021-08-31 04:18:10,669 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-31 04:18:10,697 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-31 04:18:10,794 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/systemc/pc_sfifo_1.cil-1.c[337,350] [2021-08-31 04:18:10,833 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 04:18:10,845 INFO L203 MainTranslator]: Completed pre-run [2021-08-31 04:18:10,884 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/systemc/pc_sfifo_1.cil-1.c[337,350] [2021-08-31 04:18:10,909 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 04:18:10,927 INFO L208 MainTranslator]: Completed translation [2021-08-31 04:18:10,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:18:10 WrapperNode [2021-08-31 04:18:10,927 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-31 04:18:10,928 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-31 04:18:10,928 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-31 04:18:10,928 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-31 04:18:10,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:18:10" (1/1) ... [2021-08-31 04:18:10,942 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:18:10" (1/1) ... [2021-08-31 04:18:10,959 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-31 04:18:10,960 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-31 04:18:10,960 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-31 04:18:10,960 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-31 04:18:10,966 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:18:10" (1/1) ... [2021-08-31 04:18:10,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:18:10" (1/1) ... [2021-08-31 04:18:10,968 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:18:10" (1/1) ... [2021-08-31 04:18:10,969 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:18:10" (1/1) ... [2021-08-31 04:18:10,972 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:18:10" (1/1) ... [2021-08-31 04:18:10,983 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:18:10" (1/1) ... [2021-08-31 04:18:10,984 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:18:10" (1/1) ... [2021-08-31 04:18:10,987 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-31 04:18:10,988 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-31 04:18:10,988 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-31 04:18:10,988 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-31 04:18:10,988 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:18:10" (1/1) ... [2021-08-31 04:18:10,993 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:18:11,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:18:11,010 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:18:11,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-08-31 04:18:11,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-31 04:18:11,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-31 04:18:11,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-31 04:18:11,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-31 04:18:11,185 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-31 04:18:11,185 INFO L299 CfgBuilder]: Removed 44 assume(true) statements. [2021-08-31 04:18:11,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 04:18:11 BoogieIcfgContainer [2021-08-31 04:18:11,187 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-31 04:18:11,189 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-31 04:18:11,189 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-31 04:18:11,191 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-31 04:18:11,192 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 04:18:11,192 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 31.08 04:18:10" (1/3) ... [2021-08-31 04:18:11,193 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6ecd5ed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 04:18:11, skipping insertion in model container [2021-08-31 04:18:11,193 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 04:18:11,193 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:18:10" (2/3) ... [2021-08-31 04:18:11,193 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6ecd5ed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 04:18:11, skipping insertion in model container [2021-08-31 04:18:11,194 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 04:18:11,194 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 04:18:11" (3/3) ... [2021-08-31 04:18:11,195 INFO L389 chiAutomizerObserver]: Analyzing ICFG pc_sfifo_1.cil-1.c [2021-08-31 04:18:11,236 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-31 04:18:11,236 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-31 04:18:11,236 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-31 04:18:11,236 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-31 04:18:11,236 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-31 04:18:11,236 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-31 04:18:11,236 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-31 04:18:11,237 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-31 04:18:11,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 75 states, 74 states have (on average 1.554054054054054) internal successors, (115), 74 states have internal predecessors, (115), 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-08-31 04:18:11,269 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2021-08-31 04:18:11,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:18:11,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:18:11,275 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-08-31 04:18:11,275 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:18:11,275 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-31 04:18:11,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 75 states, 74 states have (on average 1.554054054054054) internal successors, (115), 74 states have internal predecessors, (115), 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-08-31 04:18:11,285 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2021-08-31 04:18:11,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:18:11,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:18:11,287 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-08-31 04:18:11,287 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:18:11,294 INFO L791 eck$LassoCheckResult]: Stem: 58#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 42#L-1true havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 49#L348true havoc start_simulation_#t~ret14, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 8#L198true assume !(1 == ~p_dw_i~0);~p_dw_st~0 := 2; 14#L198-2true assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 56#L315-1true [2021-08-31 04:18:11,294 INFO L793 eck$LassoCheckResult]: Loop: 56#L315-1true assume !false; 51#L316true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret10, eval_#t~nondet11, eval_#t~nondet12, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 71#L264true assume false; 31#L280true havoc stop_simulation_#res;havoc stop_simulation_#t~ret13, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 69#L216-1true assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 64#L228-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 70#L229-1true stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 48#L294true assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 26#L301true stop_simulation_#res := stop_simulation_~__retres2~0; 16#L302true start_simulation_#t~ret14 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 22#L322true assume !(0 != start_simulation_~tmp~3); 56#L315-1true [2021-08-31 04:18:11,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:11,298 INFO L82 PathProgramCache]: Analyzing trace with hash 28692871, now seen corresponding path program 1 times [2021-08-31 04:18:11,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:11,305 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612766637] [2021-08-31 04:18:11,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:11,306 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:11,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:11,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:18:11,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:18:11,486 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612766637] [2021-08-31 04:18:11,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612766637] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:18:11,487 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:18:11,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 04:18:11,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947742988] [2021-08-31 04:18:11,492 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 04:18:11,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:11,492 INFO L82 PathProgramCache]: Analyzing trace with hash -778318386, now seen corresponding path program 1 times [2021-08-31 04:18:11,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:11,493 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976827774] [2021-08-31 04:18:11,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:11,493 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:11,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:18:11,501 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:18:11,501 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976827774] [2021-08-31 04:18:11,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976827774] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:18:11,501 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:18:11,501 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-31 04:18:11,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098353438] [2021-08-31 04:18:11,502 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 04:18:11,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:18:11,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 04:18:11,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 04:18:11,523 INFO L87 Difference]: Start difference. First operand has 75 states, 74 states have (on average 1.554054054054054) internal successors, (115), 74 states have internal predecessors, (115), 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 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-08-31 04:18:11,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:18:11,694 INFO L93 Difference]: Finished difference Result 75 states and 103 transitions. [2021-08-31 04:18:11,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 04:18:11,709 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 103 transitions. [2021-08-31 04:18:11,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2021-08-31 04:18:11,712 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 68 states and 96 transitions. [2021-08-31 04:18:11,713 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2021-08-31 04:18:11,713 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2021-08-31 04:18:11,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 96 transitions. [2021-08-31 04:18:11,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:18:11,714 INFO L681 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2021-08-31 04:18:11,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 96 transitions. [2021-08-31 04:18:11,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-08-31 04:18:11,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 1.411764705882353) internal successors, (96), 67 states have internal predecessors, (96), 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-08-31 04:18:11,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2021-08-31 04:18:11,732 INFO L704 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2021-08-31 04:18:11,732 INFO L587 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2021-08-31 04:18:11,732 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-31 04:18:11,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 96 transitions. [2021-08-31 04:18:11,744 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2021-08-31 04:18:11,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:18:11,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:18:11,744 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-08-31 04:18:11,744 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:18:11,744 INFO L791 eck$LassoCheckResult]: Stem: 223#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 214#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 215#L348 havoc start_simulation_#t~ret14, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 169#L198 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 170#L198-2 assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 182#L315-1 [2021-08-31 04:18:11,744 INFO L793 eck$LassoCheckResult]: Loop: 182#L315-1 assume !false; 221#L316 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret10, eval_#t~nondet11, eval_#t~nondet12, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 171#L264 assume !false; 204#L240 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 205#L216 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 194#L228 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 195#L229 eval_#t~ret10 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret10;havoc eval_#t~ret10; 177#L244 assume !(0 != eval_~tmp___1~0); 179#L280 havoc stop_simulation_#res;havoc stop_simulation_#t~ret13, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 206#L216-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 219#L228-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 226#L229-1 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 220#L294 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 202#L301 stop_simulation_#res := stop_simulation_~__retres2~0; 185#L302 start_simulation_#t~ret14 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 186#L322 assume !(0 != start_simulation_~tmp~3); 182#L315-1 [2021-08-31 04:18:11,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:11,745 INFO L82 PathProgramCache]: Analyzing trace with hash 28692809, now seen corresponding path program 1 times [2021-08-31 04:18:11,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:11,745 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62865720] [2021-08-31 04:18:11,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:11,746 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:11,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:18:11,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:18:11,778 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62865720] [2021-08-31 04:18:11,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62865720] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:18:11,779 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:18:11,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-31 04:18:11,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121304919] [2021-08-31 04:18:11,779 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 04:18:11,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:11,779 INFO L82 PathProgramCache]: Analyzing trace with hash -852169887, now seen corresponding path program 1 times [2021-08-31 04:18:11,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:11,780 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194217419] [2021-08-31 04:18:11,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:11,780 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:11,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:11,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:18:11,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:18:11,805 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194217419] [2021-08-31 04:18:11,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194217419] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:18:11,805 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:18:11,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-31 04:18:11,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592833890] [2021-08-31 04:18:11,805 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 04:18:11,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:18:11,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 04:18:11,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 04:18:11,806 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. cyclomatic complexity: 29 Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-08-31 04:18:11,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:18:11,883 INFO L93 Difference]: Finished difference Result 68 states and 95 transitions. [2021-08-31 04:18:11,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 04:18:11,884 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 95 transitions. [2021-08-31 04:18:11,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2021-08-31 04:18:11,893 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 68 states and 95 transitions. [2021-08-31 04:18:11,895 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2021-08-31 04:18:11,895 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2021-08-31 04:18:11,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 95 transitions. [2021-08-31 04:18:11,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:18:11,896 INFO L681 BuchiCegarLoop]: Abstraction has 68 states and 95 transitions. [2021-08-31 04:18:11,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 95 transitions. [2021-08-31 04:18:11,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-08-31 04:18:11,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 67 states have internal predecessors, (95), 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-08-31 04:18:11,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 95 transitions. [2021-08-31 04:18:11,899 INFO L704 BuchiCegarLoop]: Abstraction has 68 states and 95 transitions. [2021-08-31 04:18:11,900 INFO L587 BuchiCegarLoop]: Abstraction has 68 states and 95 transitions. [2021-08-31 04:18:11,900 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-31 04:18:11,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 95 transitions. [2021-08-31 04:18:11,900 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2021-08-31 04:18:11,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:18:11,901 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:18:11,901 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-08-31 04:18:11,901 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:18:11,901 INFO L791 eck$LassoCheckResult]: Stem: 368#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 359#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 360#L348 havoc start_simulation_#t~ret14, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 314#L198 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 315#L198-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 327#L315-1 [2021-08-31 04:18:11,902 INFO L793 eck$LassoCheckResult]: Loop: 327#L315-1 assume !false; 366#L316 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret10, eval_#t~nondet11, eval_#t~nondet12, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 316#L264 assume !false; 349#L240 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 350#L216 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 339#L228 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 340#L229 eval_#t~ret10 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret10;havoc eval_#t~ret10; 324#L244 assume !(0 != eval_~tmp___1~0); 326#L280 havoc stop_simulation_#res;havoc stop_simulation_#t~ret13, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 351#L216-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 363#L228-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 371#L229-1 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 365#L294 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 344#L301 stop_simulation_#res := stop_simulation_~__retres2~0; 330#L302 start_simulation_#t~ret14 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 331#L322 assume !(0 != start_simulation_~tmp~3); 327#L315-1 [2021-08-31 04:18:11,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:11,902 INFO L82 PathProgramCache]: Analyzing trace with hash 28692807, now seen corresponding path program 1 times [2021-08-31 04:18:11,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:11,902 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802175101] [2021-08-31 04:18:11,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:11,903 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:11,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:11,915 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:18:11,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:11,937 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:18:11,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:11,939 INFO L82 PathProgramCache]: Analyzing trace with hash -852169887, now seen corresponding path program 2 times [2021-08-31 04:18:11,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:11,939 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244124973] [2021-08-31 04:18:11,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:11,940 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:11,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:18:11,973 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:18:11,973 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244124973] [2021-08-31 04:18:11,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244124973] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:18:11,974 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:18:11,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-31 04:18:11,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304728531] [2021-08-31 04:18:11,975 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 04:18:11,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:18:11,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-31 04:18:11,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-31 04:18:11,978 INFO L87 Difference]: Start difference. First operand 68 states and 95 transitions. cyclomatic complexity: 28 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-08-31 04:18:12,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:18:12,244 INFO L93 Difference]: Finished difference Result 134 states and 185 transitions. [2021-08-31 04:18:12,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-31 04:18:12,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 185 transitions. [2021-08-31 04:18:12,246 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 129 [2021-08-31 04:18:12,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 134 states and 185 transitions. [2021-08-31 04:18:12,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 134 [2021-08-31 04:18:12,248 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 134 [2021-08-31 04:18:12,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 185 transitions. [2021-08-31 04:18:12,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:18:12,248 INFO L681 BuchiCegarLoop]: Abstraction has 134 states and 185 transitions. [2021-08-31 04:18:12,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 185 transitions. [2021-08-31 04:18:12,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 71. [2021-08-31 04:18:12,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.380281690140845) internal successors, (98), 70 states have internal predecessors, (98), 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-08-31 04:18:12,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 98 transitions. [2021-08-31 04:18:12,252 INFO L704 BuchiCegarLoop]: Abstraction has 71 states and 98 transitions. [2021-08-31 04:18:12,252 INFO L587 BuchiCegarLoop]: Abstraction has 71 states and 98 transitions. [2021-08-31 04:18:12,253 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-31 04:18:12,253 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 98 transitions. [2021-08-31 04:18:12,253 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2021-08-31 04:18:12,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:18:12,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:18:12,254 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-08-31 04:18:12,254 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:18:12,254 INFO L791 eck$LassoCheckResult]: Stem: 586#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 577#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 578#L348 havoc start_simulation_#t~ret14, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 532#L198 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 533#L198-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 544#L315-1 [2021-08-31 04:18:12,254 INFO L793 eck$LassoCheckResult]: Loop: 544#L315-1 assume !false; 584#L316 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret10, eval_#t~nondet11, eval_#t~nondet12, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 534#L264 assume !false; 566#L240 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 567#L216 assume !(0 == ~p_dw_st~0); 576#L220 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 590#L228 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 592#L229 eval_#t~ret10 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret10;havoc eval_#t~ret10; 591#L244 assume !(0 != eval_~tmp___1~0); 568#L280 havoc stop_simulation_#res;havoc stop_simulation_#t~ret13, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 569#L216-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 582#L228-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 589#L229-1 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 583#L294 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 561#L301 stop_simulation_#res := stop_simulation_~__retres2~0; 547#L302 start_simulation_#t~ret14 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 548#L322 assume !(0 != start_simulation_~tmp~3); 544#L315-1 [2021-08-31 04:18:12,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:12,255 INFO L82 PathProgramCache]: Analyzing trace with hash 28692807, now seen corresponding path program 2 times [2021-08-31 04:18:12,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:12,255 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415640213] [2021-08-31 04:18:12,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:12,256 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:12,263 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:18:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:12,278 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:18:12,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:12,279 INFO L82 PathProgramCache]: Analyzing trace with hash 6171900, now seen corresponding path program 1 times [2021-08-31 04:18:12,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:12,279 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256832438] [2021-08-31 04:18:12,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:12,279 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:12,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:12,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:18:12,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:18:12,292 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256832438] [2021-08-31 04:18:12,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256832438] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:18:12,292 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:18:12,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 04:18:12,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38376223] [2021-08-31 04:18:12,293 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 04:18:12,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:18:12,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 04:18:12,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 04:18:12,294 INFO L87 Difference]: Start difference. First operand 71 states and 98 transitions. cyclomatic complexity: 28 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-08-31 04:18:12,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:18:12,413 INFO L93 Difference]: Finished difference Result 116 states and 156 transitions. [2021-08-31 04:18:12,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 04:18:12,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 156 transitions. [2021-08-31 04:18:12,416 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 109 [2021-08-31 04:18:12,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 116 states and 156 transitions. [2021-08-31 04:18:12,420 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2021-08-31 04:18:12,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2021-08-31 04:18:12,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 156 transitions. [2021-08-31 04:18:12,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:18:12,429 INFO L681 BuchiCegarLoop]: Abstraction has 116 states and 156 transitions. [2021-08-31 04:18:12,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 156 transitions. [2021-08-31 04:18:12,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2021-08-31 04:18:12,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 99 states have (on average 1.3333333333333333) internal successors, (132), 98 states have internal predecessors, (132), 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-08-31 04:18:12,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 132 transitions. [2021-08-31 04:18:12,434 INFO L704 BuchiCegarLoop]: Abstraction has 99 states and 132 transitions. [2021-08-31 04:18:12,434 INFO L587 BuchiCegarLoop]: Abstraction has 99 states and 132 transitions. [2021-08-31 04:18:12,434 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-31 04:18:12,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 132 transitions. [2021-08-31 04:18:12,434 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2021-08-31 04:18:12,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:18:12,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:18:12,435 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:18:12,435 INFO L843 BuchiCegarLoop]: Counterexample loop 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] [2021-08-31 04:18:12,435 INFO L791 eck$LassoCheckResult]: Stem: 781#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 771#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 772#L348 havoc start_simulation_#t~ret14, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 725#L198 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 726#L198-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 737#L315-1 assume !false; 797#L316 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret10, eval_#t~nondet11, eval_#t~nondet12, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 795#L264 [2021-08-31 04:18:12,435 INFO L793 eck$LassoCheckResult]: Loop: 795#L264 assume !false; 794#L240 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 793#L216 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 790#L228 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 789#L229 eval_#t~ret10 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret10;havoc eval_#t~ret10; 788#L244 assume 0 != eval_~tmp___1~0; 787#L244-1 assume !(0 == ~p_dw_st~0); 716#L249 assume 0 == ~c_dr_st~0;eval_~tmp___0~1 := eval_#t~nondet12;havoc eval_#t~nondet12; 728#L268 assume 0 != eval_~tmp___0~1;~c_dr_st~0 := 1;havoc do_read_c_~a~0;havoc do_read_c_~a~0; 754#L141 assume 0 == ~c_dr_pc~0; 724#L12-2 assume !false; 735#L153 assume !(1 == ~q_free~0); 736#L154-1 do_read_c_~a~0 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_read_ev~0 := 1;havoc immediate_notify_threads_#t~ret7, immediate_notify_threads_#t~ret8, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 813#L34-3 assume 1 == ~p_dw_pc~0; 811#L35-1 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 810#L45-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 809#L46-1 immediate_notify_threads_#t~ret7 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret7;havoc immediate_notify_threads_#t~ret7; 808#L76-3 assume 0 != immediate_notify_threads_~tmp~0;~p_dw_st~0 := 0; 732#L76-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 756#L53-3 assume 1 == ~c_dr_pc~0; 757#L54-1 assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 759#L64-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 783#L65-1 immediate_notify_threads_#t~ret8 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret8;havoc immediate_notify_threads_#t~ret8; 721#L84-3 assume 0 != immediate_notify_threads_~tmp___0~0;~c_dr_st~0 := 0; 722#L84-5 ~q_read_ev~0 := 2; 776#L174 assume ~p_last_write~0 == ~c_last_read~0; 799#L175 assume ~p_num_write~0 == ~c_num_read~0; 798#L12-2 assume !false; 796#L153 assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 1;~a_t~0 := do_read_c_~a~0; 795#L264 [2021-08-31 04:18:12,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:12,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1803984585, now seen corresponding path program 1 times [2021-08-31 04:18:12,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:12,436 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578097426] [2021-08-31 04:18:12,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:12,436 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:12,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:12,443 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:18:12,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:12,458 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:18:12,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:12,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1215725960, now seen corresponding path program 1 times [2021-08-31 04:18:12,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:12,458 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945530205] [2021-08-31 04:18:12,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:12,459 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:12,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-31 04:18:12,482 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:18:12,482 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945530205] [2021-08-31 04:18:12,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945530205] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:18:12,483 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:18:12,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 04:18:12,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294213244] [2021-08-31 04:18:12,483 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 04:18:12,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:18:12,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 04:18:12,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 04:18:12,484 INFO L87 Difference]: Start difference. First operand 99 states and 132 transitions. cyclomatic complexity: 34 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-08-31 04:18:12,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:18:12,609 INFO L93 Difference]: Finished difference Result 116 states and 154 transitions. [2021-08-31 04:18:12,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 04:18:12,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 154 transitions. [2021-08-31 04:18:12,613 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 109 [2021-08-31 04:18:12,613 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 116 states and 154 transitions. [2021-08-31 04:18:12,613 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2021-08-31 04:18:12,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2021-08-31 04:18:12,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 154 transitions. [2021-08-31 04:18:12,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:18:12,614 INFO L681 BuchiCegarLoop]: Abstraction has 116 states and 154 transitions. [2021-08-31 04:18:12,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 154 transitions. [2021-08-31 04:18:12,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2021-08-31 04:18:12,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 99 states have (on average 1.3131313131313131) internal successors, (130), 98 states have internal predecessors, (130), 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-08-31 04:18:12,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 130 transitions. [2021-08-31 04:18:12,626 INFO L704 BuchiCegarLoop]: Abstraction has 99 states and 130 transitions. [2021-08-31 04:18:12,626 INFO L587 BuchiCegarLoop]: Abstraction has 99 states and 130 transitions. [2021-08-31 04:18:12,626 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-31 04:18:12,626 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 130 transitions. [2021-08-31 04:18:12,626 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2021-08-31 04:18:12,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:18:12,626 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:18:12,627 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:18:12,627 INFO L843 BuchiCegarLoop]: Counterexample loop 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, 1, 1, 1] [2021-08-31 04:18:12,627 INFO L791 eck$LassoCheckResult]: Stem: 1003#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 994#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 995#L348 havoc start_simulation_#t~ret14, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 946#L198 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 947#L198-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 960#L315-1 assume !false; 1001#L316 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret10, eval_#t~nondet11, eval_#t~nondet12, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 958#L264 [2021-08-31 04:18:12,627 INFO L793 eck$LassoCheckResult]: Loop: 958#L264 assume !false; 983#L240 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 984#L216 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 993#L228 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1014#L229 eval_#t~ret10 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret10;havoc eval_#t~ret10; 1012#L244 assume 0 != eval_~tmp___1~0; 1010#L244-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet11;havoc eval_#t~nondet11; 970#L253 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet9; 971#L98 assume 0 == ~p_dw_pc~0; 988#L109-1 assume !false; 936#L110 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 937#L249 assume 0 == ~c_dr_st~0;eval_~tmp___0~1 := eval_#t~nondet12;havoc eval_#t~nondet12; 949#L268 assume 0 != eval_~tmp___0~1;~c_dr_st~0 := 1;havoc do_read_c_~a~0;havoc do_read_c_~a~0; 977#L141 assume !(0 == ~c_dr_pc~0); 950#L144 assume 1 == ~c_dr_pc~0; 951#L145 do_read_c_~a~0 := ~a_t~0; 1007#L154-1 do_read_c_~a~0 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_read_ev~0 := 1;havoc immediate_notify_threads_#t~ret7, immediate_notify_threads_#t~ret8, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1034#L34-3 assume 1 == ~p_dw_pc~0; 1032#L35-1 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 1031#L45-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1030#L46-1 immediate_notify_threads_#t~ret7 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret7;havoc immediate_notify_threads_#t~ret7; 1029#L76-3 assume 0 != immediate_notify_threads_~tmp~0;~p_dw_st~0 := 0; 954#L76-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 978#L53-3 assume 1 == ~c_dr_pc~0; 979#L54-1 assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 982#L64-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1005#L65-1 immediate_notify_threads_#t~ret8 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret8;havoc immediate_notify_threads_#t~ret8; 942#L84-3 assume 0 != immediate_notify_threads_~tmp___0~0;~c_dr_st~0 := 0; 943#L84-5 ~q_read_ev~0 := 2; 999#L174 assume ~p_last_write~0 == ~c_last_read~0; 944#L175 assume ~p_num_write~0 == ~c_num_read~0; 945#L12-2 assume !false; 957#L153 assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 1;~a_t~0 := do_read_c_~a~0; 958#L264 [2021-08-31 04:18:12,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:12,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1803984585, now seen corresponding path program 2 times [2021-08-31 04:18:12,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:12,628 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116347555] [2021-08-31 04:18:12,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:12,628 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:12,644 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:18:12,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:12,660 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:18:12,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:12,660 INFO L82 PathProgramCache]: Analyzing trace with hash -845499910, now seen corresponding path program 1 times [2021-08-31 04:18:12,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:12,660 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455984371] [2021-08-31 04:18:12,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:12,661 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:12,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:12,672 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:18:12,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:12,679 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:18:12,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:12,679 INFO L82 PathProgramCache]: Analyzing trace with hash -961475534, now seen corresponding path program 1 times [2021-08-31 04:18:12,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:12,680 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554462611] [2021-08-31 04:18:12,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:12,680 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:12,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:12,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:18:12,752 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:18:12,753 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554462611] [2021-08-31 04:18:12,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554462611] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:18:12,753 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:18:12,753 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-31 04:18:12,753 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754944965] [2021-08-31 04:18:13,096 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 04:18:13,097 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 04:18:13,097 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 04:18:13,097 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 04:18:13,097 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-31 04:18:13,098 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:18:13,098 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 04:18:13,098 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 04:18:13,098 INFO L133 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1.cil-1.c_Iteration6_Loop [2021-08-31 04:18:13,098 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 04:18:13,098 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 04:18:13,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:18:13,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:18:13,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:18:13,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:18:13,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:18:13,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:18:13,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:18:13,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:18:13,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:18:13,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:18:13,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:18:13,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:18:13,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:18:13,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:18:13,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:18:13,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:18:13,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:18:13,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:18:13,388 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 04:18:13,390 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-31 04:18:13,392 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:18:13,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:18:13,393 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:18:13,414 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 04:18:13,414 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 04:18:13,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-08-31 04:18:13,439 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-31 04:18:13,439 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_is_do_read_c_triggered_#res=1, ULTIMATE.start_immediate_notify_threads_~tmp___0~0=1, ULTIMATE.start_is_do_read_c_triggered_~__retres1~1=1} Honda state: {ULTIMATE.start_is_do_read_c_triggered_#res=1, ULTIMATE.start_immediate_notify_threads_~tmp___0~0=1, ULTIMATE.start_is_do_read_c_triggered_~__retres1~1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-31 04:18:13,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-08-31 04:18:13,476 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:18:13,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:18:13,478 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:18:13,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-08-31 04:18:13,483 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 04:18:13,483 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 04:18:13,500 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-31 04:18:13,500 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~ret10=0} Honda state: {ULTIMATE.start_eval_#t~ret10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-31 04:18:13,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-08-31 04:18:13,519 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:18:13,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:18:13,521 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:18:13,531 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 04:18:13,532 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 04:18:13,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-08-31 04:18:13,593 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-31 04:18:13,593 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___0~1=-1, ULTIMATE.start_eval_#t~nondet12=-1} Honda state: {ULTIMATE.start_eval_~tmp___0~1=-1, ULTIMATE.start_eval_#t~nondet12=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-31 04:18:13,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-08-31 04:18:13,653 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:18:13,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:18:13,664 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:18:13,669 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 04:18:13,669 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 04:18:13,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-08-31 04:18:13,693 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-31 04:18:13,693 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~q_read_ev~0=2} Honda state: {~q_read_ev~0=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-31 04:18:13,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-08-31 04:18:13,713 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:18:13,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:18:13,715 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:18:13,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-08-31 04:18:13,721 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 04:18:13,721 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 04:18:13,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-08-31 04:18:13,756 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:18:13,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:18:13,757 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:18:13,783 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-31 04:18:13,783 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 04:18:13,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-08-31 04:18:13,798 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-31 04:18:13,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-08-31 04:18:13,817 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 04:18:13,817 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 04:18:13,817 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 04:18:13,817 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 04:18:13,817 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 04:18:13,817 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:18:13,817 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 04:18:13,817 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 04:18:13,817 INFO L133 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1.cil-1.c_Iteration6_Loop [2021-08-31 04:18:13,817 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 04:18:13,817 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 04:18:13,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:18:13,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:18:13,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:18:13,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:18:13,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:18:13,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:18:13,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:18:13,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:18:13,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:18:13,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:18:13,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:18:13,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:18:13,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:18:13,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:18:13,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:18:13,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:18:13,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:18:13,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:18:14,077 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 04:18:14,080 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 04:18:14,081 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:18:14,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:18:14,082 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:18:14,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-08-31 04:18:14,086 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 04:18:14,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:18:14,094 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:18:14,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:18:14,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:18:14,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:18:14,097 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 04:18:14,097 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:18:14,113 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:18:14,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-08-31 04:18:14,135 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:18:14,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:18:14,137 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:18:14,143 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 04:18:14,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:18:14,150 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:18:14,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:18:14,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:18:14,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:18:14,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 04:18:14,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:18:14,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-08-31 04:18:14,156 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:18:14,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-08-31 04:18:14,175 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:18:14,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:18:14,176 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:18:14,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-08-31 04:18:14,179 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 04:18:14,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:18:14,186 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:18:14,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:18:14,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:18:14,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:18:14,188 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 04:18:14,188 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:18:14,199 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:18:14,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-08-31 04:18:14,221 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:18:14,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:18:14,224 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:18:14,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-08-31 04:18:14,234 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 04:18:14,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:18:14,241 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:18:14,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:18:14,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:18:14,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:18:14,242 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 04:18:14,242 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:18:14,257 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-31 04:18:14,259 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-08-31 04:18:14,259 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-08-31 04:18:14,260 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:18:14,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:18:14,261 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:18:14,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-08-31 04:18:14,263 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-31 04:18:14,263 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-31 04:18:14,263 INFO L513 LassoAnalysis]: Proved termination. [2021-08-31 04:18:14,263 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~q_free~0) = -2*~q_free~0 + 1 Supporting invariants [] [2021-08-31 04:18:14,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-08-31 04:18:14,283 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-08-31 04:18:14,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:14,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-31 04:18:14,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 04:18:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:14,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-31 04:18:14,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 04:18:14,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:18:14,569 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2021-08-31 04:18:14,570 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 99 states and 130 transitions. cyclomatic complexity: 32 Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-08-31 04:18:14,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-08-31 04:18:14,790 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 99 states and 130 transitions. cyclomatic complexity: 32. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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) Result 307 states and 398 transitions. Complement of second has 7 states. [2021-08-31 04:18:14,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-08-31 04:18:14,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-08-31 04:18:14,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2021-08-31 04:18:14,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 111 transitions. Stem has 7 letters. Loop has 33 letters. [2021-08-31 04:18:14,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 04:18:14,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 111 transitions. Stem has 40 letters. Loop has 33 letters. [2021-08-31 04:18:14,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 04:18:14,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 111 transitions. Stem has 7 letters. Loop has 66 letters. [2021-08-31 04:18:14,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 04:18:14,801 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 307 states and 398 transitions. [2021-08-31 04:18:14,804 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 144 [2021-08-31 04:18:14,806 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 307 states to 259 states and 334 transitions. [2021-08-31 04:18:14,806 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 194 [2021-08-31 04:18:14,807 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 199 [2021-08-31 04:18:14,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 259 states and 334 transitions. [2021-08-31 04:18:14,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 04:18:14,807 INFO L681 BuchiCegarLoop]: Abstraction has 259 states and 334 transitions. [2021-08-31 04:18:14,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states and 334 transitions. [2021-08-31 04:18:14,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 213. [2021-08-31 04:18:14,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 213 states have (on average 1.295774647887324) internal successors, (276), 212 states have internal predecessors, (276), 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-08-31 04:18:14,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 276 transitions. [2021-08-31 04:18:14,817 INFO L704 BuchiCegarLoop]: Abstraction has 213 states and 276 transitions. [2021-08-31 04:18:14,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:18:14,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-31 04:18:14,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-31 04:18:14,817 INFO L87 Difference]: Start difference. First operand 213 states and 276 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 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-08-31 04:18:15,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:18:15,075 INFO L93 Difference]: Finished difference Result 208 states and 261 transitions. [2021-08-31 04:18:15,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-31 04:18:15,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 208 states and 261 transitions. [2021-08-31 04:18:15,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 178 [2021-08-31 04:18:15,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 208 states to 197 states and 249 transitions. [2021-08-31 04:18:15,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 197 [2021-08-31 04:18:15,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 197 [2021-08-31 04:18:15,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 197 states and 249 transitions. [2021-08-31 04:18:15,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:18:15,079 INFO L681 BuchiCegarLoop]: Abstraction has 197 states and 249 transitions. [2021-08-31 04:18:15,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states and 249 transitions. [2021-08-31 04:18:15,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 122. [2021-08-31 04:18:15,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 122 states have (on average 1.2868852459016393) internal successors, (157), 121 states have internal predecessors, (157), 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-08-31 04:18:15,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 157 transitions. [2021-08-31 04:18:15,081 INFO L704 BuchiCegarLoop]: Abstraction has 122 states and 157 transitions. [2021-08-31 04:18:15,081 INFO L587 BuchiCegarLoop]: Abstraction has 122 states and 157 transitions. [2021-08-31 04:18:15,081 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-31 04:18:15,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 157 transitions. [2021-08-31 04:18:15,082 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 115 [2021-08-31 04:18:15,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:18:15,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:18:15,083 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:18:15,083 INFO L843 BuchiCegarLoop]: Counterexample loop 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:18:15,083 INFO L791 eck$LassoCheckResult]: Stem: 1991#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 1981#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 1982#L348 havoc start_simulation_#t~ret14, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 1933#L198 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 1934#L198-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 1946#L315-1 assume !false; 2035#L316 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret10, eval_#t~nondet11, eval_#t~nondet12, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 2033#L264 [2021-08-31 04:18:15,083 INFO L793 eck$LassoCheckResult]: Loop: 2033#L264 assume !false; 2032#L240 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2006#L216 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 1958#L228 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1959#L229 eval_#t~ret10 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret10;havoc eval_#t~ret10; 2001#L244 assume 0 != eval_~tmp___1~0; 2000#L244-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet11;havoc eval_#t~nondet11; 1956#L253 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet9; 1957#L98 assume !(0 == ~p_dw_pc~0); 1979#L101 assume 1 == ~p_dw_pc~0; 1925#L111 ~q_buf_0~0 := do_write_p_#t~nondet9;havoc do_write_p_#t~nondet9;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;havoc immediate_notify_threads_#t~ret7, immediate_notify_threads_#t~ret8, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1962#L34 assume 1 == ~p_dw_pc~0; 1975#L35 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 1983#L45 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1947#L46 immediate_notify_threads_#t~ret7 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret7;havoc immediate_notify_threads_#t~ret7; 1948#L76 assume 0 != immediate_notify_threads_~tmp~0;~p_dw_st~0 := 0; 1992#L76-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1977#L53 assume 1 == ~c_dr_pc~0; 1926#L54 assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 1927#L64 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1960#L65 immediate_notify_threads_#t~ret8 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret8;havoc immediate_notify_threads_#t~ret8; 1990#L84 assume 0 != immediate_notify_threads_~tmp___0~0;~c_dr_st~0 := 0; 1973#L84-2 ~q_write_ev~0 := 2; 1974#L109-1 assume !false; 2007#L110 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 2008#L249 assume 0 == ~c_dr_st~0;eval_~tmp___0~1 := eval_#t~nondet12;havoc eval_#t~nondet12; 2013#L268 assume 0 != eval_~tmp___0~1;~c_dr_st~0 := 1;havoc do_read_c_~a~0;havoc do_read_c_~a~0; 2011#L141 assume 0 == ~c_dr_pc~0; 2010#L12-2 assume !false; 2009#L153 assume !(1 == ~q_free~0); 1989#L154-1 do_read_c_~a~0 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_read_ev~0 := 1;havoc immediate_notify_threads_#t~ret7, immediate_notify_threads_#t~ret8, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1953#L34-3 assume !(1 == ~p_dw_pc~0); 1954#L34-5 is_do_write_p_triggered_~__retres1~0 := 0; 1951#L45-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1952#L46-1 immediate_notify_threads_#t~ret7 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret7;havoc immediate_notify_threads_#t~ret7; 1940#L76-3 assume 0 != immediate_notify_threads_~tmp~0;~p_dw_st~0 := 0; 1942#L76-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 2045#L53-3 assume 1 == ~c_dr_pc~0; 2043#L54-1 assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 2042#L64-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 2041#L65-1 immediate_notify_threads_#t~ret8 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret8;havoc immediate_notify_threads_#t~ret8; 2040#L84-3 assume 0 != immediate_notify_threads_~tmp___0~0;~c_dr_st~0 := 0; 2039#L84-5 ~q_read_ev~0 := 2; 2038#L174 assume ~p_last_write~0 == ~c_last_read~0; 2037#L175 assume ~p_num_write~0 == ~c_num_read~0; 2036#L12-2 assume !false; 2034#L153 assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 1;~a_t~0 := do_read_c_~a~0; 2033#L264 [2021-08-31 04:18:15,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:15,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1803984585, now seen corresponding path program 3 times [2021-08-31 04:18:15,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:15,083 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335638571] [2021-08-31 04:18:15,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:15,084 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:15,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:15,088 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:18:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:15,094 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:18:15,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:15,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1537922739, now seen corresponding path program 1 times [2021-08-31 04:18:15,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:15,095 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871797846] [2021-08-31 04:18:15,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:15,095 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:15,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-31 04:18:15,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:18:15,115 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871797846] [2021-08-31 04:18:15,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871797846] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:18:15,115 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:18:15,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-31 04:18:15,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816964234] [2021-08-31 04:18:15,116 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 04:18:15,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:18:15,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-31 04:18:15,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-31 04:18:15,116 INFO L87 Difference]: Start difference. First operand 122 states and 157 transitions. cyclomatic complexity: 36 Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-08-31 04:18:15,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:18:15,292 INFO L93 Difference]: Finished difference Result 239 states and 305 transitions. [2021-08-31 04:18:15,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-31 04:18:15,293 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 239 states and 305 transitions. [2021-08-31 04:18:15,294 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 186 [2021-08-31 04:18:15,295 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 239 states to 239 states and 305 transitions. [2021-08-31 04:18:15,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 239 [2021-08-31 04:18:15,296 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 239 [2021-08-31 04:18:15,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 239 states and 305 transitions. [2021-08-31 04:18:15,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:18:15,296 INFO L681 BuchiCegarLoop]: Abstraction has 239 states and 305 transitions. [2021-08-31 04:18:15,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states and 305 transitions. [2021-08-31 04:18:15,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 175. [2021-08-31 04:18:15,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 175 states have (on average 1.2685714285714285) internal successors, (222), 174 states have internal predecessors, (222), 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-08-31 04:18:15,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 222 transitions. [2021-08-31 04:18:15,299 INFO L704 BuchiCegarLoop]: Abstraction has 175 states and 222 transitions. [2021-08-31 04:18:15,299 INFO L587 BuchiCegarLoop]: Abstraction has 175 states and 222 transitions. [2021-08-31 04:18:15,299 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-31 04:18:15,299 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 175 states and 222 transitions. [2021-08-31 04:18:15,300 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 155 [2021-08-31 04:18:15,300 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:18:15,300 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:18:15,300 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:18:15,300 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:18:15,300 INFO L791 eck$LassoCheckResult]: Stem: 2379#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 2363#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 2364#L348 havoc start_simulation_#t~ret14, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 2304#L198 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 2305#L198-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 2318#L315-1 assume !false; 2373#L316 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret10, eval_#t~nondet11, eval_#t~nondet12, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 2374#L264 assume !false; 2390#L240 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2452#L216 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 2453#L228 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2415#L229 eval_#t~ret10 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret10;havoc eval_#t~ret10; 2416#L244 assume 0 != eval_~tmp___1~0; 2396#L244-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet11;havoc eval_#t~nondet11; 2397#L253 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet9; 2359#L98 assume !(0 == ~p_dw_pc~0); 2361#L101 assume 1 == ~p_dw_pc~0; 2410#L111 [2021-08-31 04:18:15,300 INFO L793 eck$LassoCheckResult]: Loop: 2410#L111 ~q_buf_0~0 := do_write_p_#t~nondet9;havoc do_write_p_#t~nondet9;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;havoc immediate_notify_threads_#t~ret7, immediate_notify_threads_#t~ret8, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 2469#L34 assume 1 == ~p_dw_pc~0; 2376#L35 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 2366#L45 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 2468#L46 immediate_notify_threads_#t~ret7 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret7;havoc immediate_notify_threads_#t~ret7; 2394#L76 assume 0 != immediate_notify_threads_~tmp~0;~p_dw_st~0 := 0; 2383#L76-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 2356#L53 assume !(1 == ~c_dr_pc~0); 2357#L53-2 is_do_read_c_triggered_~__retres1~1 := 0; 2332#L64 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 2333#L65 immediate_notify_threads_#t~ret8 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret8;havoc immediate_notify_threads_#t~ret8; 2395#L84 assume 0 != immediate_notify_threads_~tmp___0~0;~c_dr_st~0 := 0; 2422#L84-2 ~q_write_ev~0 := 2; 2417#L109-1 assume !false; 2409#L110 assume !(0 == ~q_free~0); 2410#L111 [2021-08-31 04:18:15,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:15,301 INFO L82 PathProgramCache]: Analyzing trace with hash 560336285, now seen corresponding path program 1 times [2021-08-31 04:18:15,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:15,301 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203573337] [2021-08-31 04:18:15,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:15,301 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:15,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:18:15,327 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:18:15,327 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203573337] [2021-08-31 04:18:15,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203573337] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:18:15,328 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:18:15,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 04:18:15,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539901565] [2021-08-31 04:18:15,330 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 04:18:15,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:15,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1691490411, now seen corresponding path program 1 times [2021-08-31 04:18:15,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:15,331 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122729570] [2021-08-31 04:18:15,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:15,331 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:15,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:18:15,344 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:18:15,344 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122729570] [2021-08-31 04:18:15,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122729570] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:18:15,345 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:18:15,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-08-31 04:18:15,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405773638] [2021-08-31 04:18:15,345 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 04:18:15,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:18:15,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 04:18:15,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 04:18:15,351 INFO L87 Difference]: Start difference. First operand 175 states and 222 transitions. cyclomatic complexity: 50 Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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-08-31 04:18:15,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:18:15,444 INFO L93 Difference]: Finished difference Result 177 states and 221 transitions. [2021-08-31 04:18:15,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 04:18:15,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 177 states and 221 transitions. [2021-08-31 04:18:15,446 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 141 [2021-08-31 04:18:15,447 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 177 states to 177 states and 221 transitions. [2021-08-31 04:18:15,447 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 177 [2021-08-31 04:18:15,447 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 177 [2021-08-31 04:18:15,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 177 states and 221 transitions. [2021-08-31 04:18:15,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:18:15,447 INFO L681 BuchiCegarLoop]: Abstraction has 177 states and 221 transitions. [2021-08-31 04:18:15,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states and 221 transitions. [2021-08-31 04:18:15,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2021-08-31 04:18:15,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 175 states have (on average 1.2514285714285713) internal successors, (219), 174 states have internal predecessors, (219), 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-08-31 04:18:15,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 219 transitions. [2021-08-31 04:18:15,450 INFO L704 BuchiCegarLoop]: Abstraction has 175 states and 219 transitions. [2021-08-31 04:18:15,450 INFO L587 BuchiCegarLoop]: Abstraction has 175 states and 219 transitions. [2021-08-31 04:18:15,450 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-31 04:18:15,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 175 states and 219 transitions. [2021-08-31 04:18:15,451 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 139 [2021-08-31 04:18:15,451 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:18:15,451 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:18:15,452 INFO L842 BuchiCegarLoop]: Counterexample stem 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] [2021-08-31 04:18:15,452 INFO L843 BuchiCegarLoop]: Counterexample loop 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:18:15,452 INFO L791 eck$LassoCheckResult]: Stem: 2738#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 2723#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 2724#L348 havoc start_simulation_#t~ret14, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 2663#L198 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 2664#L198-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 2678#L315-1 assume !false; 2817#L316 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret10, eval_#t~nondet11, eval_#t~nondet12, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 2815#L264 assume !false; 2813#L240 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2812#L216 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 2791#L228 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2762#L229 eval_#t~ret10 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret10;havoc eval_#t~ret10; 2763#L244 assume 0 != eval_~tmp___1~0; 2758#L244-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet11;havoc eval_#t~nondet11; 2759#L253 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet9; 2719#L98 assume !(0 == ~p_dw_pc~0); 2721#L101 assume 1 == ~p_dw_pc~0; 2739#L111 ~q_buf_0~0 := do_write_p_#t~nondet9;havoc do_write_p_#t~nondet9;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;havoc immediate_notify_threads_#t~ret7, immediate_notify_threads_#t~ret8, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 2782#L34 assume 1 == ~p_dw_pc~0; 2736#L35 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 2726#L45 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 2781#L46 immediate_notify_threads_#t~ret7 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret7;havoc immediate_notify_threads_#t~ret7; 2756#L76 assume !(0 != immediate_notify_threads_~tmp~0); 2740#L76-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 2716#L53 assume 1 == ~c_dr_pc~0; 2658#L54 [2021-08-31 04:18:15,452 INFO L793 eck$LassoCheckResult]: Loop: 2658#L54 assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 2659#L64 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 2757#L65 immediate_notify_threads_#t~ret8 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret8;havoc immediate_notify_threads_#t~ret8; 2737#L84 assume 0 != immediate_notify_threads_~tmp___0~0;~c_dr_st~0 := 0; 2712#L84-2 ~q_write_ev~0 := 2; 2713#L109-1 assume !false; 2656#L110 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 2657#L249 assume 0 == ~c_dr_st~0;eval_~tmp___0~1 := eval_#t~nondet12;havoc eval_#t~nondet12; 2697#L268 assume 0 != eval_~tmp___0~1;~c_dr_st~0 := 1;havoc do_read_c_~a~0;havoc do_read_c_~a~0; 2699#L141 assume !(0 == ~c_dr_pc~0); 2732#L144 assume 1 == ~c_dr_pc~0; 2672#L145 do_read_c_~a~0 := ~a_t~0; 2735#L154-1 do_read_c_~a~0 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_read_ev~0 := 1;havoc immediate_notify_threads_#t~ret7, immediate_notify_threads_#t~ret8, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 2685#L34-3 assume !(1 == ~p_dw_pc~0); 2686#L34-5 is_do_write_p_triggered_~__retres1~0 := 0; 2683#L45-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 2684#L46-1 immediate_notify_threads_#t~ret7 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret7;havoc immediate_notify_threads_#t~ret7; 2668#L76-3 assume 0 != immediate_notify_threads_~tmp~0;~p_dw_st~0 := 0; 2670#L76-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 2700#L53-3 assume 1 == ~c_dr_pc~0; 2701#L54-1 assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 2745#L64-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 2746#L65-1 immediate_notify_threads_#t~ret8 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret8;havoc immediate_notify_threads_#t~ret8; 2654#L84-3 assume 0 != immediate_notify_threads_~tmp___0~0;~c_dr_st~0 := 0; 2655#L84-5 ~q_read_ev~0 := 2; 2802#L174 assume ~p_last_write~0 == ~c_last_read~0; 2661#L175 assume ~p_num_write~0 == ~c_num_read~0; 2662#L12-2 assume !false; 2674#L153 assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 1;~a_t~0 := do_read_c_~a~0; 2675#L264 assume !false; 2816#L240 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2814#L216 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 2787#L228 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2786#L229 eval_#t~ret10 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret10;havoc eval_#t~ret10; 2760#L244 assume 0 != eval_~tmp___1~0; 2761#L244-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet11;havoc eval_#t~nondet11; 2688#L253 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet9; 2689#L98 assume !(0 == ~p_dw_pc~0); 2783#L101 assume 1 == ~p_dw_pc~0; 2695#L111 ~q_buf_0~0 := do_write_p_#t~nondet9;havoc do_write_p_#t~nondet9;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;havoc immediate_notify_threads_#t~ret7, immediate_notify_threads_#t~ret8, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 2696#L34 assume 1 == ~p_dw_pc~0; 2714#L35 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 2755#L45 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 2679#L46 immediate_notify_threads_#t~ret7 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret7;havoc immediate_notify_threads_#t~ret7; 2680#L76 assume 0 != immediate_notify_threads_~tmp~0;~p_dw_st~0 := 0; 2780#L76-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 2779#L53 assume 1 == ~c_dr_pc~0; 2658#L54 [2021-08-31 04:18:15,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:15,453 INFO L82 PathProgramCache]: Analyzing trace with hash 86738256, now seen corresponding path program 1 times [2021-08-31 04:18:15,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:15,453 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044233407] [2021-08-31 04:18:15,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:15,453 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:15,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:18:15,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:18:15,472 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044233407] [2021-08-31 04:18:15,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044233407] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:18:15,472 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:18:15,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 04:18:15,472 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095312897] [2021-08-31 04:18:15,472 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 04:18:15,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:15,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1986815764, now seen corresponding path program 1 times [2021-08-31 04:18:15,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:15,473 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354918389] [2021-08-31 04:18:15,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:15,473 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:15,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:15,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:18:15,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:18:15,498 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354918389] [2021-08-31 04:18:15,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354918389] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:18:15,498 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:18:15,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 04:18:15,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540198883] [2021-08-31 04:18:15,498 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 04:18:15,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:18:15,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 04:18:15,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 04:18:15,500 INFO L87 Difference]: Start difference. First operand 175 states and 219 transitions. cyclomatic complexity: 46 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-08-31 04:18:15,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:18:15,589 INFO L93 Difference]: Finished difference Result 181 states and 223 transitions. [2021-08-31 04:18:15,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 04:18:15,590 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 181 states and 223 transitions. [2021-08-31 04:18:15,591 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 139 [2021-08-31 04:18:15,592 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 181 states to 181 states and 223 transitions. [2021-08-31 04:18:15,592 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 181 [2021-08-31 04:18:15,592 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 181 [2021-08-31 04:18:15,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 181 states and 223 transitions. [2021-08-31 04:18:15,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:18:15,600 INFO L681 BuchiCegarLoop]: Abstraction has 181 states and 223 transitions. [2021-08-31 04:18:15,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states and 223 transitions. [2021-08-31 04:18:15,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 173. [2021-08-31 04:18:15,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 173 states have (on average 1.23121387283237) internal successors, (213), 172 states have internal predecessors, (213), 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-08-31 04:18:15,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 213 transitions. [2021-08-31 04:18:15,602 INFO L704 BuchiCegarLoop]: Abstraction has 173 states and 213 transitions. [2021-08-31 04:18:15,603 INFO L587 BuchiCegarLoop]: Abstraction has 173 states and 213 transitions. [2021-08-31 04:18:15,603 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-08-31 04:18:15,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 173 states and 213 transitions. [2021-08-31 04:18:15,603 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 139 [2021-08-31 04:18:15,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:18:15,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:18:15,605 INFO L842 BuchiCegarLoop]: Counterexample stem 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] [2021-08-31 04:18:15,605 INFO L843 BuchiCegarLoop]: Counterexample loop 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:18:15,605 INFO L791 eck$LassoCheckResult]: Stem: 3088#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 3074#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 3075#L348 havoc start_simulation_#t~ret14, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 3026#L198 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 3027#L198-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 3039#L315-1 assume !false; 3123#L316 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret10, eval_#t~nondet11, eval_#t~nondet12, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 3119#L264 assume !false; 3111#L240 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3109#L216 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 3107#L228 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3104#L229 eval_#t~ret10 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret10;havoc eval_#t~ret10; 3102#L244 assume 0 != eval_~tmp___1~0; 3101#L244-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet11;havoc eval_#t~nondet11; 3049#L253 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet9; 3050#L98 assume 0 == ~p_dw_pc~0; 3072#L109-1 assume !false; 3105#L110 assume !(0 == ~q_free~0); 3103#L111 ~q_buf_0~0 := do_write_p_#t~nondet9;havoc do_write_p_#t~nondet9;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;havoc immediate_notify_threads_#t~ret7, immediate_notify_threads_#t~ret8, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 3069#L34 assume !(1 == ~p_dw_pc~0); 3070#L34-2 is_do_write_p_triggered_~__retres1~0 := 0; 3150#L45 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 3148#L46 immediate_notify_threads_#t~ret7 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret7;havoc immediate_notify_threads_#t~ret7; 3145#L76 assume !(0 != immediate_notify_threads_~tmp~0); 3143#L76-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 3141#L53 assume 1 == ~c_dr_pc~0; 3019#L54 [2021-08-31 04:18:15,607 INFO L793 eck$LassoCheckResult]: Loop: 3019#L54 assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 3020#L64 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 3053#L65 immediate_notify_threads_#t~ret8 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret8;havoc immediate_notify_threads_#t~ret8; 3087#L84 assume 0 != immediate_notify_threads_~tmp___0~0;~c_dr_st~0 := 0; 3067#L84-2 ~q_write_ev~0 := 2; 3068#L109-1 assume !false; 3017#L110 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 3018#L249 assume 0 == ~c_dr_st~0;eval_~tmp___0~1 := eval_#t~nondet12;havoc eval_#t~nondet12; 3029#L268 assume 0 != eval_~tmp___0~1;~c_dr_st~0 := 1;havoc do_read_c_~a~0;havoc do_read_c_~a~0; 3057#L141 assume !(0 == ~c_dr_pc~0); 3082#L144 assume 1 == ~c_dr_pc~0; 3031#L145 do_read_c_~a~0 := ~a_t~0; 3084#L154-1 do_read_c_~a~0 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_read_ev~0 := 1;havoc immediate_notify_threads_#t~ret7, immediate_notify_threads_#t~ret8, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 3046#L34-3 assume !(1 == ~p_dw_pc~0); 3047#L34-5 is_do_write_p_triggered_~__retres1~0 := 0; 3044#L45-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 3045#L46-1 immediate_notify_threads_#t~ret7 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret7;havoc immediate_notify_threads_#t~ret7; 3032#L76-3 assume 0 != immediate_notify_threads_~tmp~0;~p_dw_st~0 := 0; 3034#L76-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 3149#L53-3 assume 1 == ~c_dr_pc~0; 3146#L54-1 assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 3144#L64-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 3142#L65-1 immediate_notify_threads_#t~ret8 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret8;havoc immediate_notify_threads_#t~ret8; 3140#L84-3 assume 0 != immediate_notify_threads_~tmp___0~0;~c_dr_st~0 := 0; 3138#L84-5 ~q_read_ev~0 := 2; 3136#L174 assume ~p_last_write~0 == ~c_last_read~0; 3134#L175 assume ~p_num_write~0 == ~c_num_read~0; 3132#L12-2 assume !false; 3130#L153 assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 1;~a_t~0 := do_read_c_~a~0; 3128#L264 assume !false; 3125#L240 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3121#L216 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 3113#L228 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3110#L229 eval_#t~ret10 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret10;havoc eval_#t~ret10; 3108#L244 assume 0 != eval_~tmp___1~0; 3106#L244-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet11;havoc eval_#t~nondet11; 3099#L253 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet9; 3098#L98 assume !(0 == ~p_dw_pc~0); 3089#L101 assume 1 == ~p_dw_pc~0; 3055#L111 ~q_buf_0~0 := do_write_p_#t~nondet9;havoc do_write_p_#t~nondet9;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;havoc immediate_notify_threads_#t~ret7, immediate_notify_threads_#t~ret8, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 3056#L34 assume !(1 == ~p_dw_pc~0); 3076#L34-2 is_do_write_p_triggered_~__retres1~0 := 0; 3077#L45 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 3040#L46 immediate_notify_threads_#t~ret7 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret7;havoc immediate_notify_threads_#t~ret7; 3041#L76 assume 0 != immediate_notify_threads_~tmp~0;~p_dw_st~0 := 0; 3091#L76-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 3071#L53 assume 1 == ~c_dr_pc~0; 3019#L54 [2021-08-31 04:18:15,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:15,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1703409253, now seen corresponding path program 1 times [2021-08-31 04:18:15,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:15,607 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26124455] [2021-08-31 04:18:15,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:15,608 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:15,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:15,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:18:15,649 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:18:15,650 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26124455] [2021-08-31 04:18:15,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26124455] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:18:15,650 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:18:15,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-31 04:18:15,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489984314] [2021-08-31 04:18:15,650 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 04:18:15,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:15,651 INFO L82 PathProgramCache]: Analyzing trace with hash 102517613, now seen corresponding path program 1 times [2021-08-31 04:18:15,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:15,651 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458684050] [2021-08-31 04:18:15,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:15,652 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:15,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:18:15,683 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:18:15,683 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458684050] [2021-08-31 04:18:15,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458684050] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:18:15,684 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:18:15,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 04:18:15,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605656346] [2021-08-31 04:18:15,684 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 04:18:15,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:18:15,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-31 04:18:15,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-08-31 04:18:15,685 INFO L87 Difference]: Start difference. First operand 173 states and 213 transitions. cyclomatic complexity: 42 Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 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-08-31 04:18:15,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:18:15,956 INFO L93 Difference]: Finished difference Result 319 states and 383 transitions. [2021-08-31 04:18:15,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-31 04:18:15,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 319 states and 383 transitions. [2021-08-31 04:18:15,958 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 222 [2021-08-31 04:18:15,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 319 states to 319 states and 383 transitions. [2021-08-31 04:18:15,959 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 319 [2021-08-31 04:18:15,959 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 319 [2021-08-31 04:18:15,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 319 states and 383 transitions. [2021-08-31 04:18:15,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:18:15,960 INFO L681 BuchiCegarLoop]: Abstraction has 319 states and 383 transitions. [2021-08-31 04:18:15,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states and 383 transitions. [2021-08-31 04:18:15,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 217. [2021-08-31 04:18:15,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 217 states have (on average 1.2211981566820276) internal successors, (265), 216 states have internal predecessors, (265), 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-08-31 04:18:15,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 265 transitions. [2021-08-31 04:18:15,962 INFO L704 BuchiCegarLoop]: Abstraction has 217 states and 265 transitions. [2021-08-31 04:18:15,963 INFO L587 BuchiCegarLoop]: Abstraction has 217 states and 265 transitions. [2021-08-31 04:18:15,963 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-08-31 04:18:15,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 217 states and 265 transitions. [2021-08-31 04:18:15,963 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 183 [2021-08-31 04:18:15,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:18:15,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:18:15,964 INFO L842 BuchiCegarLoop]: Counterexample stem 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] [2021-08-31 04:18:15,964 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:18:15,964 INFO L791 eck$LassoCheckResult]: Stem: 3601#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 3588#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 3589#L348 havoc start_simulation_#t~ret14, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 3535#L198 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 3536#L198-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 3548#L315-1 assume !false; 3648#L316 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret10, eval_#t~nondet11, eval_#t~nondet12, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 3645#L264 assume !false; 3641#L240 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3638#L216 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 3630#L228 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3629#L229 eval_#t~ret10 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret10;havoc eval_#t~ret10; 3628#L244 assume 0 != eval_~tmp___1~0; 3626#L244-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet11;havoc eval_#t~nondet11; 3624#L253 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet9; 3584#L98 assume 0 == ~p_dw_pc~0; 3585#L109-1 assume !false; 3633#L110 assume !(0 == ~q_free~0); 3564#L111 ~q_buf_0~0 := do_write_p_#t~nondet9;havoc do_write_p_#t~nondet9;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;havoc immediate_notify_threads_#t~ret7, immediate_notify_threads_#t~ret8, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 3565#L34 assume !(1 == ~p_dw_pc~0); 3580#L34-2 is_do_write_p_triggered_~__retres1~0 := 0; 3627#L45 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 3625#L46 immediate_notify_threads_#t~ret7 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret7;havoc immediate_notify_threads_#t~ret7; 3617#L76 assume !(0 != immediate_notify_threads_~tmp~0); 3607#L76-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 3581#L53 assume !(1 == ~c_dr_pc~0); 3582#L53-2 is_do_read_c_triggered_~__retres1~1 := 0; 3586#L64 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 3618#L65 immediate_notify_threads_#t~ret8 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret8;havoc immediate_notify_threads_#t~ret8; 3619#L84 assume !(0 != immediate_notify_threads_~tmp___0~0); 3577#L84-2 ~q_write_ev~0 := 2; 3578#L109-1 assume !false; 3526#L110 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 3527#L249 [2021-08-31 04:18:15,964 INFO L793 eck$LassoCheckResult]: Loop: 3527#L249 assume !(0 == ~c_dr_st~0); 3537#L264 assume !false; 3573#L240 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3574#L216 assume !(0 == ~p_dw_st~0); 3587#L220 assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; 3616#L228 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3735#L229 eval_#t~ret10 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret10;havoc eval_#t~ret10; 3696#L244 assume 0 != eval_~tmp___1~0; 3579#L244-1 assume !(0 == ~p_dw_st~0); 3527#L249 [2021-08-31 04:18:15,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:15,964 INFO L82 PathProgramCache]: Analyzing trace with hash 825120445, now seen corresponding path program 1 times [2021-08-31 04:18:15,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:15,964 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013646457] [2021-08-31 04:18:15,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:15,965 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:15,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:15,969 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:18:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:15,976 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:18:15,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:15,977 INFO L82 PathProgramCache]: Analyzing trace with hash 313858188, now seen corresponding path program 1 times [2021-08-31 04:18:15,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:15,977 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310247727] [2021-08-31 04:18:15,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:15,977 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:15,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:15,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:18:15,983 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:18:15,983 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310247727] [2021-08-31 04:18:15,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310247727] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:18:15,983 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:18:15,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-31 04:18:15,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790739885] [2021-08-31 04:18:15,983 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 04:18:15,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:18:15,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 04:18:15,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 04:18:15,984 INFO L87 Difference]: Start difference. First operand 217 states and 265 transitions. cyclomatic complexity: 50 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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-08-31 04:18:16,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:18:16,067 INFO L93 Difference]: Finished difference Result 245 states and 285 transitions. [2021-08-31 04:18:16,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 04:18:16,067 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 245 states and 285 transitions. [2021-08-31 04:18:16,069 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 186 [2021-08-31 04:18:16,069 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 245 states to 245 states and 285 transitions. [2021-08-31 04:18:16,070 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 245 [2021-08-31 04:18:16,070 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 245 [2021-08-31 04:18:16,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 245 states and 285 transitions. [2021-08-31 04:18:16,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:18:16,070 INFO L681 BuchiCegarLoop]: Abstraction has 245 states and 285 transitions. [2021-08-31 04:18:16,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states and 285 transitions. [2021-08-31 04:18:16,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 172. [2021-08-31 04:18:16,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 172 states have (on average 1.197674418604651) internal successors, (206), 171 states have internal predecessors, (206), 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-08-31 04:18:16,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 206 transitions. [2021-08-31 04:18:16,072 INFO L704 BuchiCegarLoop]: Abstraction has 172 states and 206 transitions. [2021-08-31 04:18:16,073 INFO L587 BuchiCegarLoop]: Abstraction has 172 states and 206 transitions. [2021-08-31 04:18:16,073 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-08-31 04:18:16,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 172 states and 206 transitions. [2021-08-31 04:18:16,073 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 121 [2021-08-31 04:18:16,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:18:16,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:18:16,074 INFO L842 BuchiCegarLoop]: Counterexample stem 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] [2021-08-31 04:18:16,074 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:18:16,074 INFO L791 eck$LassoCheckResult]: Stem: 4069#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 4055#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 4056#L348 havoc start_simulation_#t~ret14, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 4003#L198 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 4004#L198-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 4015#L315-1 assume !false; 4120#L316 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret10, eval_#t~nondet11, eval_#t~nondet12, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 4118#L264 assume !false; 4116#L240 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 4114#L216 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 4112#L228 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 4111#L229 eval_#t~ret10 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret10;havoc eval_#t~ret10; 4110#L244 assume 0 != eval_~tmp___1~0; 4108#L244-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet11;havoc eval_#t~nondet11; 4025#L253 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet9; 4026#L98 assume 0 == ~p_dw_pc~0; 4053#L109-1 assume !false; 4142#L110 assume !(0 == ~q_free~0); 4032#L111 ~q_buf_0~0 := do_write_p_#t~nondet9;havoc do_write_p_#t~nondet9;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;havoc immediate_notify_threads_#t~ret7, immediate_notify_threads_#t~ret8, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 4033#L34 assume !(1 == ~p_dw_pc~0); 4050#L34-2 is_do_write_p_triggered_~__retres1~0 := 0; 4123#L45 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 4122#L46 immediate_notify_threads_#t~ret7 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret7;havoc immediate_notify_threads_#t~ret7; 4081#L76 assume !(0 != immediate_notify_threads_~tmp~0); 4074#L76-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 4051#L53 assume !(1 == ~c_dr_pc~0); 4052#L53-2 is_do_read_c_triggered_~__retres1~1 := 0; 4029#L64 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 4030#L65 immediate_notify_threads_#t~ret8 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret8;havoc immediate_notify_threads_#t~ret8; 4067#L84 assume !(0 != immediate_notify_threads_~tmp___0~0); 4068#L84-2 ~q_write_ev~0 := 2; 4146#L109-1 assume !false; 4144#L110 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 4143#L249 [2021-08-31 04:18:16,074 INFO L793 eck$LassoCheckResult]: Loop: 4143#L249 assume 0 == ~c_dr_st~0;eval_~tmp___0~1 := eval_#t~nondet12;havoc eval_#t~nondet12; 4034#L268 assume !(0 != eval_~tmp___0~1); 4035#L264 assume !false; 4152#L240 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 4151#L216 assume !(0 == ~p_dw_st~0); 4150#L220 assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; 4149#L228 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 4148#L229 eval_#t~ret10 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret10;havoc eval_#t~ret10; 4147#L244 assume 0 != eval_~tmp___1~0; 4145#L244-1 assume !(0 == ~p_dw_st~0); 4143#L249 [2021-08-31 04:18:16,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:16,079 INFO L82 PathProgramCache]: Analyzing trace with hash 825120445, now seen corresponding path program 2 times [2021-08-31 04:18:16,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:16,079 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364253521] [2021-08-31 04:18:16,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:16,080 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:16,087 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:18:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:16,100 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:18:16,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:16,100 INFO L82 PathProgramCache]: Analyzing trace with hash -750519281, now seen corresponding path program 1 times [2021-08-31 04:18:16,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:16,100 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371838187] [2021-08-31 04:18:16,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:16,101 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:16,103 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:18:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:16,106 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:18:16,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:16,107 INFO L82 PathProgramCache]: Analyzing trace with hash 250746827, now seen corresponding path program 1 times [2021-08-31 04:18:16,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:16,107 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896127498] [2021-08-31 04:18:16,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:16,107 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:16,115 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:18:16,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:16,130 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:18:16,843 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoopBenchmark.prettyprintBenchmarkData(BuchiCegarLoopBenchmark.java:178) at de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData.toString(StatisticsData.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerTimingBenchmark.toString(BuchiAutomizerTimingBenchmark.java:44) at de.uni_freiburg.informatik.ultimate.core.lib.results.StatisticsResult.getLongDescription(StatisticsResult.java:58) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.reportResult(BuchiAutomizerObserver.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:161) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:398) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-08-31 04:18:16,847 INFO L158 Benchmark]: Toolchain (without parser) took 6186.52ms. Allocated memory was 58.7MB in the beginning and 107.0MB in the end (delta: 48.2MB). Free memory was 37.8MB in the beginning and 53.4MB in the end (delta: -15.5MB). Peak memory consumption was 55.1MB. Max. memory is 16.1GB. [2021-08-31 04:18:16,848 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 58.7MB. Free memory was 41.3MB in the beginning and 41.3MB in the end (delta: 46.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 04:18:16,848 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.85ms. Allocated memory is still 58.7MB. Free memory was 37.7MB in the beginning and 41.2MB in the end (delta: -3.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-08-31 04:18:16,849 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.47ms. Allocated memory is still 58.7MB. Free memory was 41.2MB in the beginning and 39.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 04:18:16,849 INFO L158 Benchmark]: Boogie Preprocessor took 27.22ms. Allocated memory is still 58.7MB. Free memory was 39.1MB in the beginning and 37.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 04:18:16,849 INFO L158 Benchmark]: RCFGBuilder took 199.12ms. Allocated memory was 58.7MB in the beginning and 73.4MB in the end (delta: 14.7MB). Free memory was 37.6MB in the beginning and 55.5MB in the end (delta: -18.0MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2021-08-31 04:18:16,849 INFO L158 Benchmark]: BuchiAutomizer took 5657.09ms. Allocated memory was 73.4MB in the beginning and 107.0MB in the end (delta: 33.6MB). Free memory was 55.5MB in the beginning and 53.4MB in the end (delta: 2.2MB). Peak memory consumption was 58.3MB. Max. memory is 16.1GB. [2021-08-31 04:18:16,851 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.19ms. Allocated memory is still 58.7MB. Free memory was 41.3MB in the beginning and 41.3MB in the end (delta: 46.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.85ms. Allocated memory is still 58.7MB. Free memory was 37.7MB in the beginning and 41.2MB in the end (delta: -3.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.47ms. Allocated memory is still 58.7MB. Free memory was 41.2MB in the beginning and 39.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.22ms. Allocated memory is still 58.7MB. Free memory was 39.1MB in the beginning and 37.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 199.12ms. Allocated memory was 58.7MB in the beginning and 73.4MB in the end (delta: 14.7MB). Free memory was 37.6MB in the beginning and 55.5MB in the end (delta: -18.0MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 5657.09ms. Allocated memory was 73.4MB in the beginning and 107.0MB in the end (delta: 33.6MB). Free memory was 55.5MB in the beginning and 53.4MB in the end (delta: 2.2MB). Peak memory consumption was 58.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (11 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function 1 + -2 * q_free and consists of 4 locations. 11 modules have a trivial ranking function, the largest among these consists of 7 locations. The remainder module has 172 locations. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6): de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoopBenchmark.prettyprintBenchmarkData(BuchiCegarLoopBenchmark.java:178) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-08-31 04:18:16,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...