./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 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt --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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-12 23:59:07,892 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-12 23:59:07,902 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-12 23:59:07,965 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-12 23:59:07,966 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-12 23:59:07,971 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-12 23:59:07,974 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-12 23:59:07,979 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-12 23:59:07,982 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-12 23:59:07,990 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-12 23:59:07,991 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-12 23:59:07,993 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-12 23:59:07,994 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-12 23:59:07,997 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-12 23:59:07,999 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-12 23:59:08,005 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-12 23:59:08,008 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-12 23:59:08,010 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-12 23:59:08,013 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-12 23:59:08,019 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-12 23:59:08,022 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-12 23:59:08,024 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-12 23:59:08,028 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-12 23:59:08,029 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-12 23:59:08,036 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-12 23:59:08,036 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-12 23:59:08,037 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-12 23:59:08,039 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-12 23:59:08,040 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-12 23:59:08,041 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-12 23:59:08,042 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-12 23:59:08,043 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-12 23:59:08,045 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-12 23:59:08,046 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-12 23:59:08,048 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-12 23:59:08,049 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-12 23:59:08,050 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-12 23:59:08,050 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-12 23:59:08,050 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-12 23:59:08,051 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-12 23:59:08,052 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-12 23:59:08,053 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-10-12 23:59:08,103 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-12 23:59:08,103 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-12 23:59:08,104 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-12 23:59:08,104 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-12 23:59:08,106 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-12 23:59:08,106 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-12 23:59:08,106 INFO L138 SettingsManager]: * Use SBE=true [2021-10-12 23:59:08,107 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-10-12 23:59:08,107 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-10-12 23:59:08,107 INFO L138 SettingsManager]: * Use old map elimination=false [2021-10-12 23:59:08,108 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-10-12 23:59:08,108 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-10-12 23:59:08,109 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-10-12 23:59:08,109 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-12 23:59:08,109 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-12 23:59:08,109 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-12 23:59:08,110 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-12 23:59:08,110 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-12 23:59:08,110 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-12 23:59:08,110 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-10-12 23:59:08,110 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-10-12 23:59:08,111 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-10-12 23:59:08,111 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-12 23:59:08,111 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-12 23:59:08,111 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-10-12 23:59:08,111 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-12 23:59:08,113 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-10-12 23:59:08,113 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-12 23:59:08,114 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-12 23:59:08,114 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-12 23:59:08,114 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-12 23:59:08,114 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-12 23:59:08,116 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-10-12 23:59:08,117 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt 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-10-12 23:59:08,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-12 23:59:08,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-12 23:59:08,504 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-12 23:59:08,505 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-12 23:59:08,507 INFO L275 PluginConnector]: CDTParser initialized [2021-10-12 23:59:08,508 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-1.c [2021-10-12 23:59:08,609 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/data/71746b3b2/39590c57e29e4057aaaa8267995c6104/FLAGb07051c55 [2021-10-12 23:59:09,092 INFO L306 CDTParser]: Found 1 translation units. [2021-10-12 23:59:09,094 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/sv-benchmarks/c/systemc/pc_sfifo_1.cil-1.c [2021-10-12 23:59:09,103 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/data/71746b3b2/39590c57e29e4057aaaa8267995c6104/FLAGb07051c55 [2021-10-12 23:59:09,439 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/data/71746b3b2/39590c57e29e4057aaaa8267995c6104 [2021-10-12 23:59:09,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-12 23:59:09,447 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-12 23:59:09,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-12 23:59:09,450 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-12 23:59:09,453 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-12 23:59:09,454 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:59:09" (1/1) ... [2021-10-12 23:59:09,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23ac76c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:09, skipping insertion in model container [2021-10-12 23:59:09,458 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:59:09" (1/1) ... [2021-10-12 23:59:09,465 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-12 23:59:09,502 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-12 23:59:09,658 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/sv-benchmarks/c/systemc/pc_sfifo_1.cil-1.c[337,350] [2021-10-12 23:59:09,696 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-12 23:59:09,706 INFO L203 MainTranslator]: Completed pre-run [2021-10-12 23:59:09,717 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/sv-benchmarks/c/systemc/pc_sfifo_1.cil-1.c[337,350] [2021-10-12 23:59:09,740 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-12 23:59:09,755 INFO L208 MainTranslator]: Completed translation [2021-10-12 23:59:09,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:09 WrapperNode [2021-10-12 23:59:09,756 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-12 23:59:09,757 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-12 23:59:09,758 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-12 23:59:09,758 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-12 23:59:09,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:09" (1/1) ... [2021-10-12 23:59:09,786 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:09" (1/1) ... [2021-10-12 23:59:09,836 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-12 23:59:09,837 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-12 23:59:09,837 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-12 23:59:09,838 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-12 23:59:09,848 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:09" (1/1) ... [2021-10-12 23:59:09,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:09" (1/1) ... [2021-10-12 23:59:09,864 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:09" (1/1) ... [2021-10-12 23:59:09,864 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:09" (1/1) ... [2021-10-12 23:59:09,870 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:09" (1/1) ... [2021-10-12 23:59:09,886 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:09" (1/1) ... [2021-10-12 23:59:09,888 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:09" (1/1) ... [2021-10-12 23:59:09,891 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-12 23:59:09,892 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-12 23:59:09,892 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-12 23:59:09,892 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-12 23:59:09,909 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:09" (1/1) ... [2021-10-12 23:59:09,919 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-12 23:59:09,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-12 23:59:09,946 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-12 23:59:09,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-10-12 23:59:09,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-12 23:59:09,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-12 23:59:09,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-12 23:59:09,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-12 23:59:10,332 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-12 23:59:10,333 INFO L299 CfgBuilder]: Removed 44 assume(true) statements. [2021-10-12 23:59:10,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:59:10 BoogieIcfgContainer [2021-10-12 23:59:10,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-12 23:59:10,336 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-10-12 23:59:10,336 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-10-12 23:59:10,340 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-10-12 23:59:10,340 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-12 23:59:10,341 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 11:59:09" (1/3) ... [2021-10-12 23:59:10,342 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2118bf1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 11:59:10, skipping insertion in model container [2021-10-12 23:59:10,342 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-12 23:59:10,342 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:09" (2/3) ... [2021-10-12 23:59:10,343 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2118bf1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 11:59:10, skipping insertion in model container [2021-10-12 23:59:10,343 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-12 23:59:10,343 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:59:10" (3/3) ... [2021-10-12 23:59:10,345 INFO L389 chiAutomizerObserver]: Analyzing ICFG pc_sfifo_1.cil-1.c [2021-10-12 23:59:10,394 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-10-12 23:59:10,394 INFO L360 BuchiCegarLoop]: Hoare is false [2021-10-12 23:59:10,401 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-10-12 23:59:10,401 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-12 23:59:10,402 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-12 23:59:10,402 INFO L364 BuchiCegarLoop]: Difference is false [2021-10-12 23:59:10,407 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-12 23:59:10,408 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-10-12 23:59:10,427 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-10-12 23:59:10,463 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2021-10-12 23:59:10,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-12 23:59:10,469 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-12 23:59:10,479 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-10-12 23:59:10,479 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:10,479 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-10-12 23:59:10,480 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-10-12 23:59:10,490 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2021-10-12 23:59:10,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-12 23:59:10,500 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-12 23:59:10,501 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-10-12 23:59:10,501 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:10,509 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-10-12 23:59:10,510 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-10-12 23:59:10,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:10,516 INFO L82 PathProgramCache]: Analyzing trace with hash 28692871, now seen corresponding path program 1 times [2021-10-12 23:59:10,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:10,526 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085239560] [2021-10-12 23:59:10,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:10,527 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:10,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:10,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-12 23:59:10,776 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:10,777 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085239560] [2021-10-12 23:59:10,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085239560] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:10,778 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:10,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-12 23:59:10,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785677623] [2021-10-12 23:59:10,785 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-12 23:59:10,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:10,786 INFO L82 PathProgramCache]: Analyzing trace with hash -778318386, now seen corresponding path program 1 times [2021-10-12 23:59:10,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:10,787 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482651925] [2021-10-12 23:59:10,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:10,787 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:10,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:10,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-12 23:59:10,802 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:10,803 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482651925] [2021-10-12 23:59:10,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482651925] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:10,803 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:10,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-12 23:59:10,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561130877] [2021-10-12 23:59:10,805 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-12 23:59:10,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:10,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-12 23:59:10,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-12 23:59:10,824 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-10-12 23:59:10,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:10,849 INFO L93 Difference]: Finished difference Result 75 states and 103 transitions. [2021-10-12 23:59:10,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-12 23:59:10,852 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 103 transitions. [2021-10-12 23:59:10,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2021-10-12 23:59:10,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 68 states and 96 transitions. [2021-10-12 23:59:10,863 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2021-10-12 23:59:10,864 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2021-10-12 23:59:10,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 96 transitions. [2021-10-12 23:59:10,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-12 23:59:10,866 INFO L681 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2021-10-12 23:59:10,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 96 transitions. [2021-10-12 23:59:10,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-10-12 23:59:10,893 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-10-12 23:59:10,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2021-10-12 23:59:10,897 INFO L704 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2021-10-12 23:59:10,897 INFO L587 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2021-10-12 23:59:10,897 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-10-12 23:59:10,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 96 transitions. [2021-10-12 23:59:10,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2021-10-12 23:59:10,902 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-12 23:59:10,902 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-12 23:59:10,903 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-10-12 23:59:10,903 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:10,904 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-10-12 23:59:10,904 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-10-12 23:59:10,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:10,905 INFO L82 PathProgramCache]: Analyzing trace with hash 28692809, now seen corresponding path program 1 times [2021-10-12 23:59:10,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:10,906 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735860643] [2021-10-12 23:59:10,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:10,906 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:10,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:10,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-12 23:59:10,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:10,949 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735860643] [2021-10-12 23:59:10,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735860643] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:10,950 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:10,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-12 23:59:10,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474387226] [2021-10-12 23:59:10,951 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-12 23:59:10,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:10,952 INFO L82 PathProgramCache]: Analyzing trace with hash -852169887, now seen corresponding path program 1 times [2021-10-12 23:59:10,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:10,953 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646057002] [2021-10-12 23:59:10,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:10,953 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:11,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-12 23:59:11,004 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:11,004 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646057002] [2021-10-12 23:59:11,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646057002] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:11,004 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:11,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-12 23:59:11,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758638886] [2021-10-12 23:59:11,005 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-12 23:59:11,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:11,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-12 23:59:11,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-12 23:59:11,008 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-10-12 23:59:11,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:11,021 INFO L93 Difference]: Finished difference Result 68 states and 95 transitions. [2021-10-12 23:59:11,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-12 23:59:11,022 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 95 transitions. [2021-10-12 23:59:11,025 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2021-10-12 23:59:11,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 68 states and 95 transitions. [2021-10-12 23:59:11,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2021-10-12 23:59:11,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2021-10-12 23:59:11,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 95 transitions. [2021-10-12 23:59:11,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-12 23:59:11,029 INFO L681 BuchiCegarLoop]: Abstraction has 68 states and 95 transitions. [2021-10-12 23:59:11,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 95 transitions. [2021-10-12 23:59:11,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-10-12 23:59:11,034 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-10-12 23:59:11,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 95 transitions. [2021-10-12 23:59:11,036 INFO L704 BuchiCegarLoop]: Abstraction has 68 states and 95 transitions. [2021-10-12 23:59:11,036 INFO L587 BuchiCegarLoop]: Abstraction has 68 states and 95 transitions. [2021-10-12 23:59:11,040 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-10-12 23:59:11,041 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 95 transitions. [2021-10-12 23:59:11,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2021-10-12 23:59:11,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-12 23:59:11,048 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-12 23:59:11,049 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-10-12 23:59:11,049 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:11,049 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-10-12 23:59:11,050 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-10-12 23:59:11,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:11,053 INFO L82 PathProgramCache]: Analyzing trace with hash 28692807, now seen corresponding path program 1 times [2021-10-12 23:59:11,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:11,054 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693376983] [2021-10-12 23:59:11,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:11,055 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-12 23:59:11,097 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-12 23:59:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-12 23:59:11,140 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-12 23:59:11,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:11,141 INFO L82 PathProgramCache]: Analyzing trace with hash -852169887, now seen corresponding path program 2 times [2021-10-12 23:59:11,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:11,142 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625862287] [2021-10-12 23:59:11,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:11,143 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:11,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:11,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-12 23:59:11,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:11,219 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625862287] [2021-10-12 23:59:11,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625862287] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:11,219 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:11,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-12 23:59:11,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198955385] [2021-10-12 23:59:11,220 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-12 23:59:11,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:11,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-12 23:59:11,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-12 23:59:11,222 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-10-12 23:59:11,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:11,360 INFO L93 Difference]: Finished difference Result 134 states and 185 transitions. [2021-10-12 23:59:11,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-12 23:59:11,365 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 185 transitions. [2021-10-12 23:59:11,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 129 [2021-10-12 23:59:11,370 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 134 states and 185 transitions. [2021-10-12 23:59:11,370 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 134 [2021-10-12 23:59:11,371 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 134 [2021-10-12 23:59:11,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 185 transitions. [2021-10-12 23:59:11,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-12 23:59:11,372 INFO L681 BuchiCegarLoop]: Abstraction has 134 states and 185 transitions. [2021-10-12 23:59:11,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 185 transitions. [2021-10-12 23:59:11,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 71. [2021-10-12 23:59:11,378 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-10-12 23:59:11,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 98 transitions. [2021-10-12 23:59:11,380 INFO L704 BuchiCegarLoop]: Abstraction has 71 states and 98 transitions. [2021-10-12 23:59:11,380 INFO L587 BuchiCegarLoop]: Abstraction has 71 states and 98 transitions. [2021-10-12 23:59:11,380 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-10-12 23:59:11,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 98 transitions. [2021-10-12 23:59:11,389 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2021-10-12 23:59:11,389 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-12 23:59:11,389 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-12 23:59:11,393 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-10-12 23:59:11,394 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:11,394 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-10-12 23:59:11,394 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-10-12 23:59:11,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:11,398 INFO L82 PathProgramCache]: Analyzing trace with hash 28692807, now seen corresponding path program 2 times [2021-10-12 23:59:11,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:11,399 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483566455] [2021-10-12 23:59:11,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:11,400 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:11,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-12 23:59:11,421 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-12 23:59:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-12 23:59:11,479 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-12 23:59:11,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:11,483 INFO L82 PathProgramCache]: Analyzing trace with hash 6171900, now seen corresponding path program 1 times [2021-10-12 23:59:11,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:11,483 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34516042] [2021-10-12 23:59:11,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:11,484 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:11,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-12 23:59:11,520 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:11,521 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34516042] [2021-10-12 23:59:11,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34516042] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:11,521 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:11,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-12 23:59:11,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990753750] [2021-10-12 23:59:11,525 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-12 23:59:11,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:11,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-12 23:59:11,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-12 23:59:11,529 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-10-12 23:59:11,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:11,580 INFO L93 Difference]: Finished difference Result 116 states and 156 transitions. [2021-10-12 23:59:11,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-12 23:59:11,581 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 156 transitions. [2021-10-12 23:59:11,582 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 109 [2021-10-12 23:59:11,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 116 states and 156 transitions. [2021-10-12 23:59:11,584 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2021-10-12 23:59:11,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2021-10-12 23:59:11,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 156 transitions. [2021-10-12 23:59:11,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-12 23:59:11,585 INFO L681 BuchiCegarLoop]: Abstraction has 116 states and 156 transitions. [2021-10-12 23:59:11,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 156 transitions. [2021-10-12 23:59:11,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2021-10-12 23:59:11,592 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-10-12 23:59:11,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 132 transitions. [2021-10-12 23:59:11,594 INFO L704 BuchiCegarLoop]: Abstraction has 99 states and 132 transitions. [2021-10-12 23:59:11,594 INFO L587 BuchiCegarLoop]: Abstraction has 99 states and 132 transitions. [2021-10-12 23:59:11,594 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-10-12 23:59:11,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 132 transitions. [2021-10-12 23:59:11,595 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2021-10-12 23:59:11,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-12 23:59:11,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-12 23:59:11,596 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:11,596 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-10-12 23:59:11,597 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-10-12 23:59:11,597 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-10-12 23:59:11,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:11,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1803984585, now seen corresponding path program 1 times [2021-10-12 23:59:11,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:11,598 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129011642] [2021-10-12 23:59:11,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:11,599 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-12 23:59:11,611 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-12 23:59:11,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-12 23:59:11,628 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-12 23:59:11,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:11,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1215725960, now seen corresponding path program 1 times [2021-10-12 23:59:11,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:11,629 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938852332] [2021-10-12 23:59:11,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:11,629 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:11,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-12 23:59:11,656 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:11,656 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938852332] [2021-10-12 23:59:11,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938852332] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:11,657 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:11,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-12 23:59:11,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393278229] [2021-10-12 23:59:11,658 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-12 23:59:11,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:11,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-12 23:59:11,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-12 23:59:11,661 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-10-12 23:59:11,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:11,693 INFO L93 Difference]: Finished difference Result 116 states and 154 transitions. [2021-10-12 23:59:11,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-12 23:59:11,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 154 transitions. [2021-10-12 23:59:11,695 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 109 [2021-10-12 23:59:11,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 116 states and 154 transitions. [2021-10-12 23:59:11,697 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2021-10-12 23:59:11,697 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2021-10-12 23:59:11,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 154 transitions. [2021-10-12 23:59:11,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-12 23:59:11,698 INFO L681 BuchiCegarLoop]: Abstraction has 116 states and 154 transitions. [2021-10-12 23:59:11,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 154 transitions. [2021-10-12 23:59:11,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2021-10-12 23:59:11,705 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-10-12 23:59:11,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 130 transitions. [2021-10-12 23:59:11,706 INFO L704 BuchiCegarLoop]: Abstraction has 99 states and 130 transitions. [2021-10-12 23:59:11,706 INFO L587 BuchiCegarLoop]: Abstraction has 99 states and 130 transitions. [2021-10-12 23:59:11,706 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-10-12 23:59:11,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 130 transitions. [2021-10-12 23:59:11,707 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2021-10-12 23:59:11,707 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-12 23:59:11,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-12 23:59:11,709 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:11,709 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-10-12 23:59:11,709 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-10-12 23:59:11,709 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-10-12 23:59:11,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:11,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1803984585, now seen corresponding path program 2 times [2021-10-12 23:59:11,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:11,710 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757343022] [2021-10-12 23:59:11,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:11,711 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-12 23:59:11,722 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-12 23:59:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-12 23:59:11,737 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-12 23:59:11,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:11,738 INFO L82 PathProgramCache]: Analyzing trace with hash -845499910, now seen corresponding path program 1 times [2021-10-12 23:59:11,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:11,738 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797298710] [2021-10-12 23:59:11,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:11,739 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-12 23:59:11,751 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-12 23:59:11,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-12 23:59:11,766 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-12 23:59:11,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:11,767 INFO L82 PathProgramCache]: Analyzing trace with hash -961475534, now seen corresponding path program 1 times [2021-10-12 23:59:11,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:11,767 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379331958] [2021-10-12 23:59:11,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:11,768 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:11,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-12 23:59:11,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:11,844 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379331958] [2021-10-12 23:59:11,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379331958] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:11,845 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:11,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-12 23:59:11,846 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973809049] [2021-10-12 23:59:12,413 INFO L210 LassoAnalysis]: Preferences: [2021-10-12 23:59:12,414 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-12 23:59:12,414 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-12 23:59:12,414 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-12 23:59:12,414 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-10-12 23:59:12,414 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-12 23:59:12,414 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-12 23:59:12,414 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-12 23:59:12,415 INFO L133 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1.cil-1.c_Iteration6_Loop [2021-10-12 23:59:12,415 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-12 23:59:12,415 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-10-12 23:59:12,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-12 23:59:12,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-12 23:59:12,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-12 23:59:12,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-12 23:59:12,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-12 23:59:12,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-12 23:59:12,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-12 23:59:12,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-12 23:59:12,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-12 23:59:12,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-12 23:59:12,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-12 23:59:12,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-12 23:59:12,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-12 23:59:12,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-12 23:59:12,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-12 23:59:12,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-12 23:59:12,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-12 23:59:12,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-12 23:59:12,871 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-10-12 23:59:12,871 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-10-12 23:59:12,876 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-12 23:59:12,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-12 23:59:12,888 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-12 23:59:12,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-10-12 23:59:12,923 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-10-12 23:59:12,924 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-10-12 23:59:12,954 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-10-12 23:59:12,954 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-10-12 23:59:13,006 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2021-10-12 23:59:13,006 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-12 23:59:13,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-12 23:59:13,008 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-12 23:59:13,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-10-12 23:59:13,012 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-10-12 23:59:13,013 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-10-12 23:59:13,023 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-10-12 23:59:13,023 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-10-12 23:59:13,048 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-10-12 23:59:13,048 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-12 23:59:13,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-12 23:59:13,049 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-12 23:59:13,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-10-12 23:59:13,068 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-10-12 23:59:13,068 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-10-12 23:59:13,090 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-10-12 23:59:13,090 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-10-12 23:59:13,127 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-10-12 23:59:13,127 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-12 23:59:13,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-12 23:59:13,129 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-12 23:59:13,139 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-10-12 23:59:13,139 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-10-12 23:59:13,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-10-12 23:59:13,161 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-10-12 23:59:13,161 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-10-12 23:59:13,192 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-10-12 23:59:13,192 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-12 23:59:13,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-12 23:59:13,194 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-12 23:59:13,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-10-12 23:59:13,201 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-10-12 23:59:13,201 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-10-12 23:59:13,244 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2021-10-12 23:59:13,245 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-12 23:59:13,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-12 23:59:13,246 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-12 23:59:13,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-10-12 23:59:13,249 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-10-12 23:59:13,249 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-10-12 23:59:13,266 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-10-12 23:59:13,293 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2021-10-12 23:59:13,293 INFO L210 LassoAnalysis]: Preferences: [2021-10-12 23:59:13,293 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-12 23:59:13,293 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-12 23:59:13,293 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-12 23:59:13,293 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-10-12 23:59:13,293 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-12 23:59:13,294 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-12 23:59:13,294 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-12 23:59:13,294 INFO L133 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1.cil-1.c_Iteration6_Loop [2021-10-12 23:59:13,294 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-12 23:59:13,294 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-10-12 23:59:13,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-12 23:59:13,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-12 23:59:13,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-12 23:59:13,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-12 23:59:13,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-12 23:59:13,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-12 23:59:13,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-12 23:59:13,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-12 23:59:13,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-12 23:59:13,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-12 23:59:13,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-12 23:59:13,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-12 23:59:13,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-12 23:59:13,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-12 23:59:13,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-12 23:59:13,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-12 23:59:13,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-12 23:59:13,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-12 23:59:13,677 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-10-12 23:59:13,683 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-10-12 23:59:13,685 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-12 23:59:13,685 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-12 23:59:13,686 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-12 23:59:13,692 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-10-12 23:59:13,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-12 23:59:13,702 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-12 23:59:13,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-12 23:59:13,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-12 23:59:13,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-12 23:59:13,706 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-12 23:59:13,706 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-12 23:59:13,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-10-12 23:59:13,715 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-12 23:59:13,752 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-10-12 23:59:13,753 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-12 23:59:13,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-12 23:59:13,754 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-12 23:59:13,760 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-10-12 23:59:13,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-12 23:59:13,770 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-12 23:59:13,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-12 23:59:13,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-12 23:59:13,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-12 23:59:13,772 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-12 23:59:13,772 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-12 23:59:13,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-10-12 23:59:13,788 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-12 23:59:13,828 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-10-12 23:59:13,829 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-12 23:59:13,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-12 23:59:13,833 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-12 23:59:13,839 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-10-12 23:59:13,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-12 23:59:13,848 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-12 23:59:13,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-12 23:59:13,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-12 23:59:13,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-12 23:59:13,851 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-12 23:59:13,851 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-12 23:59:13,853 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-10-12 23:59:13,860 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-12 23:59:13,897 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-10-12 23:59:13,897 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-12 23:59:13,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-12 23:59:13,898 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-12 23:59:13,904 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-10-12 23:59:13,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-12 23:59:13,914 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-12 23:59:13,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-12 23:59:13,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-12 23:59:13,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-12 23:59:13,915 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-12 23:59:13,915 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-12 23:59:13,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-10-12 23:59:13,924 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-10-12 23:59:13,928 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-10-12 23:59:13,929 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-10-12 23:59:13,930 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-12 23:59:13,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-12 23:59:13,933 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-12 23:59:13,958 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-10-12 23:59:13,958 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-10-12 23:59:13,959 INFO L513 LassoAnalysis]: Proved termination. [2021-10-12 23:59:13,959 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~q_free~0) = -2*~q_free~0 + 1 Supporting invariants [] [2021-10-12 23:59:13,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-10-12 23:59:13,993 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-10-12 23:59:13,995 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-10-12 23:59:14,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:14,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-12 23:59:14,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-12 23:59:14,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:14,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-12 23:59:14,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-12 23:59:14,454 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-10-12 23:59:14,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-12 23:59:14,466 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-10-12 23:59:14,467 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-10-12 23:59:14,571 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-10-12 23:59:14,571 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-10-12 23:59:14,572 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-10-12 23:59:14,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2021-10-12 23:59:14,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 111 transitions. Stem has 7 letters. Loop has 33 letters. [2021-10-12 23:59:14,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-12 23:59:14,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 111 transitions. Stem has 40 letters. Loop has 33 letters. [2021-10-12 23:59:14,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-12 23:59:14,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 111 transitions. Stem has 7 letters. Loop has 66 letters. [2021-10-12 23:59:14,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-12 23:59:14,585 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 307 states and 398 transitions. [2021-10-12 23:59:14,590 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 144 [2021-10-12 23:59:14,594 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 307 states to 259 states and 334 transitions. [2021-10-12 23:59:14,594 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 194 [2021-10-12 23:59:14,596 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 199 [2021-10-12 23:59:14,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 259 states and 334 transitions. [2021-10-12 23:59:14,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-12 23:59:14,596 INFO L681 BuchiCegarLoop]: Abstraction has 259 states and 334 transitions. [2021-10-12 23:59:14,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states and 334 transitions. [2021-10-12 23:59:14,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 213. [2021-10-12 23:59:14,623 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-10-12 23:59:14,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 276 transitions. [2021-10-12 23:59:14,630 INFO L704 BuchiCegarLoop]: Abstraction has 213 states and 276 transitions. [2021-10-12 23:59:14,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:14,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-12 23:59:14,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-12 23:59:14,632 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-10-12 23:59:14,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:14,770 INFO L93 Difference]: Finished difference Result 208 states and 261 transitions. [2021-10-12 23:59:14,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-12 23:59:14,771 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 208 states and 261 transitions. [2021-10-12 23:59:14,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 178 [2021-10-12 23:59:14,776 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 208 states to 197 states and 249 transitions. [2021-10-12 23:59:14,777 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 197 [2021-10-12 23:59:14,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 197 [2021-10-12 23:59:14,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 197 states and 249 transitions. [2021-10-12 23:59:14,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-12 23:59:14,783 INFO L681 BuchiCegarLoop]: Abstraction has 197 states and 249 transitions. [2021-10-12 23:59:14,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states and 249 transitions. [2021-10-12 23:59:14,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 122. [2021-10-12 23:59:14,795 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-10-12 23:59:14,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 157 transitions. [2021-10-12 23:59:14,796 INFO L704 BuchiCegarLoop]: Abstraction has 122 states and 157 transitions. [2021-10-12 23:59:14,796 INFO L587 BuchiCegarLoop]: Abstraction has 122 states and 157 transitions. [2021-10-12 23:59:14,796 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-10-12 23:59:14,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 157 transitions. [2021-10-12 23:59:14,797 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 115 [2021-10-12 23:59:14,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-12 23:59:14,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-12 23:59:14,802 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:14,802 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-10-12 23:59:14,803 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-10-12 23:59:14,809 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-10-12 23:59:14,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:14,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1803984585, now seen corresponding path program 3 times [2021-10-12 23:59:14,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:14,810 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573923871] [2021-10-12 23:59:14,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:14,810 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-12 23:59:14,831 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-12 23:59:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-12 23:59:14,857 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-12 23:59:14,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:14,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1537922739, now seen corresponding path program 1 times [2021-10-12 23:59:14,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:14,862 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142388827] [2021-10-12 23:59:14,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:14,862 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:14,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:14,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-12 23:59:14,905 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:14,905 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142388827] [2021-10-12 23:59:14,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142388827] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:14,906 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:14,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-12 23:59:14,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102915640] [2021-10-12 23:59:14,906 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-12 23:59:14,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:14,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-12 23:59:14,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-12 23:59:14,908 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-10-12 23:59:14,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:14,959 INFO L93 Difference]: Finished difference Result 239 states and 305 transitions. [2021-10-12 23:59:14,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-12 23:59:14,959 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 239 states and 305 transitions. [2021-10-12 23:59:14,962 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 186 [2021-10-12 23:59:14,965 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 239 states to 239 states and 305 transitions. [2021-10-12 23:59:14,965 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 239 [2021-10-12 23:59:14,965 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 239 [2021-10-12 23:59:14,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 239 states and 305 transitions. [2021-10-12 23:59:14,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-12 23:59:14,966 INFO L681 BuchiCegarLoop]: Abstraction has 239 states and 305 transitions. [2021-10-12 23:59:14,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states and 305 transitions. [2021-10-12 23:59:14,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 175. [2021-10-12 23:59:14,970 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-10-12 23:59:14,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 222 transitions. [2021-10-12 23:59:14,971 INFO L704 BuchiCegarLoop]: Abstraction has 175 states and 222 transitions. [2021-10-12 23:59:14,971 INFO L587 BuchiCegarLoop]: Abstraction has 175 states and 222 transitions. [2021-10-12 23:59:14,971 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-10-12 23:59:14,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 175 states and 222 transitions. [2021-10-12 23:59:14,973 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 155 [2021-10-12 23:59:14,973 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-12 23:59:14,973 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-12 23:59:14,974 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:14,974 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:14,974 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-10-12 23:59:14,974 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-10-12 23:59:14,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:14,975 INFO L82 PathProgramCache]: Analyzing trace with hash 560336285, now seen corresponding path program 1 times [2021-10-12 23:59:14,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:14,975 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073119577] [2021-10-12 23:59:14,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:14,976 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:14,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:15,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-12 23:59:15,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:15,012 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073119577] [2021-10-12 23:59:15,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073119577] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:15,013 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:15,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-12 23:59:15,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173122735] [2021-10-12 23:59:15,013 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-12 23:59:15,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:15,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1691490411, now seen corresponding path program 1 times [2021-10-12 23:59:15,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:15,014 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851369789] [2021-10-12 23:59:15,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:15,015 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:15,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:15,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-12 23:59:15,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:15,041 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851369789] [2021-10-12 23:59:15,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851369789] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:15,042 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:15,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-12 23:59:15,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693610607] [2021-10-12 23:59:15,042 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-12 23:59:15,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:15,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-12 23:59:15,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-12 23:59:15,044 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-10-12 23:59:15,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:15,057 INFO L93 Difference]: Finished difference Result 177 states and 221 transitions. [2021-10-12 23:59:15,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-12 23:59:15,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 177 states and 221 transitions. [2021-10-12 23:59:15,061 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 141 [2021-10-12 23:59:15,063 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 177 states to 177 states and 221 transitions. [2021-10-12 23:59:15,063 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 177 [2021-10-12 23:59:15,064 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 177 [2021-10-12 23:59:15,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 177 states and 221 transitions. [2021-10-12 23:59:15,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-12 23:59:15,064 INFO L681 BuchiCegarLoop]: Abstraction has 177 states and 221 transitions. [2021-10-12 23:59:15,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states and 221 transitions. [2021-10-12 23:59:15,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2021-10-12 23:59:15,069 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-10-12 23:59:15,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 219 transitions. [2021-10-12 23:59:15,070 INFO L704 BuchiCegarLoop]: Abstraction has 175 states and 219 transitions. [2021-10-12 23:59:15,070 INFO L587 BuchiCegarLoop]: Abstraction has 175 states and 219 transitions. [2021-10-12 23:59:15,070 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-10-12 23:59:15,070 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 175 states and 219 transitions. [2021-10-12 23:59:15,072 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 139 [2021-10-12 23:59:15,072 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-12 23:59:15,072 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-12 23:59:15,074 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-10-12 23:59:15,075 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-10-12 23:59:15,077 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-10-12 23:59:15,077 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-10-12 23:59:15,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:15,078 INFO L82 PathProgramCache]: Analyzing trace with hash 86738256, now seen corresponding path program 1 times [2021-10-12 23:59:15,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:15,078 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688876077] [2021-10-12 23:59:15,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:15,078 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:15,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:15,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-12 23:59:15,134 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:15,134 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688876077] [2021-10-12 23:59:15,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688876077] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:15,134 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:15,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-12 23:59:15,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183473200] [2021-10-12 23:59:15,135 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-12 23:59:15,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:15,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1986815764, now seen corresponding path program 1 times [2021-10-12 23:59:15,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:15,136 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639691277] [2021-10-12 23:59:15,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:15,136 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:15,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:15,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-12 23:59:15,164 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:15,164 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639691277] [2021-10-12 23:59:15,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639691277] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:15,165 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:15,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-12 23:59:15,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679113916] [2021-10-12 23:59:15,165 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-12 23:59:15,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:15,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-12 23:59:15,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-12 23:59:15,166 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-10-12 23:59:15,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:15,183 INFO L93 Difference]: Finished difference Result 181 states and 223 transitions. [2021-10-12 23:59:15,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-12 23:59:15,183 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 181 states and 223 transitions. [2021-10-12 23:59:15,186 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 139 [2021-10-12 23:59:15,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 181 states to 181 states and 223 transitions. [2021-10-12 23:59:15,188 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 181 [2021-10-12 23:59:15,188 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 181 [2021-10-12 23:59:15,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 181 states and 223 transitions. [2021-10-12 23:59:15,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-12 23:59:15,189 INFO L681 BuchiCegarLoop]: Abstraction has 181 states and 223 transitions. [2021-10-12 23:59:15,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states and 223 transitions. [2021-10-12 23:59:15,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 173. [2021-10-12 23:59:15,193 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-10-12 23:59:15,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 213 transitions. [2021-10-12 23:59:15,194 INFO L704 BuchiCegarLoop]: Abstraction has 173 states and 213 transitions. [2021-10-12 23:59:15,194 INFO L587 BuchiCegarLoop]: Abstraction has 173 states and 213 transitions. [2021-10-12 23:59:15,194 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-10-12 23:59:15,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 173 states and 213 transitions. [2021-10-12 23:59:15,195 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 139 [2021-10-12 23:59:15,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-12 23:59:15,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-12 23:59:15,197 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-10-12 23:59:15,197 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-10-12 23:59:15,197 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-10-12 23:59:15,197 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-10-12 23:59:15,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:15,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1703409253, now seen corresponding path program 1 times [2021-10-12 23:59:15,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:15,198 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727182733] [2021-10-12 23:59:15,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:15,199 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:15,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-12 23:59:15,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:15,255 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727182733] [2021-10-12 23:59:15,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727182733] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:15,256 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:15,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-12 23:59:15,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533281217] [2021-10-12 23:59:15,256 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-12 23:59:15,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:15,257 INFO L82 PathProgramCache]: Analyzing trace with hash 102517613, now seen corresponding path program 1 times [2021-10-12 23:59:15,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:15,257 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645082298] [2021-10-12 23:59:15,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:15,258 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:15,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-12 23:59:15,277 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:15,277 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645082298] [2021-10-12 23:59:15,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645082298] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:15,278 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:15,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-12 23:59:15,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563216765] [2021-10-12 23:59:15,278 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-12 23:59:15,279 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:15,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-12 23:59:15,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-12 23:59:15,279 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-10-12 23:59:15,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:15,402 INFO L93 Difference]: Finished difference Result 319 states and 383 transitions. [2021-10-12 23:59:15,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-12 23:59:15,402 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 319 states and 383 transitions. [2021-10-12 23:59:15,406 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 222 [2021-10-12 23:59:15,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 319 states to 319 states and 383 transitions. [2021-10-12 23:59:15,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 319 [2021-10-12 23:59:15,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 319 [2021-10-12 23:59:15,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 319 states and 383 transitions. [2021-10-12 23:59:15,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-12 23:59:15,411 INFO L681 BuchiCegarLoop]: Abstraction has 319 states and 383 transitions. [2021-10-12 23:59:15,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states and 383 transitions. [2021-10-12 23:59:15,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 217. [2021-10-12 23:59:15,431 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-10-12 23:59:15,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 265 transitions. [2021-10-12 23:59:15,432 INFO L704 BuchiCegarLoop]: Abstraction has 217 states and 265 transitions. [2021-10-12 23:59:15,432 INFO L587 BuchiCegarLoop]: Abstraction has 217 states and 265 transitions. [2021-10-12 23:59:15,432 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-10-12 23:59:15,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 217 states and 265 transitions. [2021-10-12 23:59:15,434 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 183 [2021-10-12 23:59:15,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-12 23:59:15,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-12 23:59:15,435 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-10-12 23:59:15,435 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:15,436 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-10-12 23:59:15,436 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-10-12 23:59:15,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:15,437 INFO L82 PathProgramCache]: Analyzing trace with hash 825120445, now seen corresponding path program 1 times [2021-10-12 23:59:15,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:15,437 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922055455] [2021-10-12 23:59:15,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:15,437 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:15,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-12 23:59:15,446 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-12 23:59:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-12 23:59:15,462 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-12 23:59:15,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:15,463 INFO L82 PathProgramCache]: Analyzing trace with hash 313858188, now seen corresponding path program 1 times [2021-10-12 23:59:15,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:15,463 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653120831] [2021-10-12 23:59:15,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:15,464 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:15,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:15,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-12 23:59:15,474 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:15,474 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653120831] [2021-10-12 23:59:15,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653120831] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:15,474 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:15,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-12 23:59:15,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12716817] [2021-10-12 23:59:15,475 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-12 23:59:15,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:15,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-12 23:59:15,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-12 23:59:15,476 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-10-12 23:59:15,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:15,495 INFO L93 Difference]: Finished difference Result 245 states and 285 transitions. [2021-10-12 23:59:15,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-12 23:59:15,496 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 245 states and 285 transitions. [2021-10-12 23:59:15,499 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 186 [2021-10-12 23:59:15,501 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 245 states to 245 states and 285 transitions. [2021-10-12 23:59:15,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 245 [2021-10-12 23:59:15,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 245 [2021-10-12 23:59:15,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 245 states and 285 transitions. [2021-10-12 23:59:15,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-12 23:59:15,502 INFO L681 BuchiCegarLoop]: Abstraction has 245 states and 285 transitions. [2021-10-12 23:59:15,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states and 285 transitions. [2021-10-12 23:59:15,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 172. [2021-10-12 23:59:15,506 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-10-12 23:59:15,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 206 transitions. [2021-10-12 23:59:15,507 INFO L704 BuchiCegarLoop]: Abstraction has 172 states and 206 transitions. [2021-10-12 23:59:15,507 INFO L587 BuchiCegarLoop]: Abstraction has 172 states and 206 transitions. [2021-10-12 23:59:15,508 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-10-12 23:59:15,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 172 states and 206 transitions. [2021-10-12 23:59:15,509 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 121 [2021-10-12 23:59:15,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-12 23:59:15,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-12 23:59:15,510 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-10-12 23:59:15,510 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:15,510 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-10-12 23:59:15,511 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-10-12 23:59:15,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:15,511 INFO L82 PathProgramCache]: Analyzing trace with hash 825120445, now seen corresponding path program 2 times [2021-10-12 23:59:15,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:15,512 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699303882] [2021-10-12 23:59:15,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:15,512 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:15,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-12 23:59:15,520 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-12 23:59:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-12 23:59:15,535 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-12 23:59:15,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:15,536 INFO L82 PathProgramCache]: Analyzing trace with hash -750519281, now seen corresponding path program 1 times [2021-10-12 23:59:15,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:15,536 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133456999] [2021-10-12 23:59:15,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:15,536 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-12 23:59:15,540 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-12 23:59:15,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-12 23:59:15,544 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-12 23:59:15,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:15,544 INFO L82 PathProgramCache]: Analyzing trace with hash 250746827, now seen corresponding path program 1 times [2021-10-12 23:59:15,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:15,545 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253575697] [2021-10-12 23:59:15,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:15,545 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-12 23:59:15,554 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-12 23:59:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-12 23:59:15,569 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-12 23:59:16,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 11:59:16 BoogieIcfgContainer [2021-10-12 23:59:16,720 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-10-12 23:59:16,721 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-12 23:59:16,721 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-12 23:59:16,721 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-12 23:59:16,722 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:59:10" (3/4) ... [2021-10-12 23:59:16,725 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-10-12 23:59:16,781 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/witness.graphml [2021-10-12 23:59:16,781 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-12 23:59:16,783 INFO L168 Benchmark]: Toolchain (without parser) took 7335.22 ms. Allocated memory was 127.9 MB in the beginning and 155.2 MB in the end (delta: 27.3 MB). Free memory was 92.0 MB in the beginning and 95.7 MB in the end (delta: -3.7 MB). Peak memory consumption was 22.5 MB. Max. memory is 16.1 GB. [2021-10-12 23:59:16,783 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 127.9 MB. Free memory was 100.0 MB in the beginning and 99.9 MB in the end (delta: 21.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-12 23:59:16,784 INFO L168 Benchmark]: CACSL2BoogieTranslator took 306.77 ms. Allocated memory is still 127.9 MB. Free memory was 91.6 MB in the beginning and 101.5 MB in the end (delta: -9.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-12 23:59:16,784 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.28 ms. Allocated memory is still 127.9 MB. Free memory was 101.5 MB in the beginning and 99.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-12 23:59:16,784 INFO L168 Benchmark]: Boogie Preprocessor took 53.84 ms. Allocated memory is still 127.9 MB. Free memory was 99.4 MB in the beginning and 97.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-12 23:59:16,785 INFO L168 Benchmark]: RCFGBuilder took 443.28 ms. Allocated memory is still 127.9 MB. Free memory was 97.3 MB in the beginning and 83.4 MB in the end (delta: 13.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-12 23:59:16,785 INFO L168 Benchmark]: BuchiAutomizer took 6383.80 ms. Allocated memory was 127.9 MB in the beginning and 155.2 MB in the end (delta: 27.3 MB). Free memory was 83.4 MB in the beginning and 98.8 MB in the end (delta: -15.4 MB). Peak memory consumption was 73.6 MB. Max. memory is 16.1 GB. [2021-10-12 23:59:16,786 INFO L168 Benchmark]: Witness Printer took 60.42 ms. Allocated memory is still 155.2 MB. Free memory was 98.8 MB in the beginning and 95.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-12 23:59:16,788 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.17 ms. Allocated memory is still 127.9 MB. Free memory was 100.0 MB in the beginning and 99.9 MB in the end (delta: 21.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 306.77 ms. Allocated memory is still 127.9 MB. Free memory was 91.6 MB in the beginning and 101.5 MB in the end (delta: -9.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 79.28 ms. Allocated memory is still 127.9 MB. Free memory was 101.5 MB in the beginning and 99.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 53.84 ms. Allocated memory is still 127.9 MB. Free memory was 99.4 MB in the beginning and 97.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 443.28 ms. Allocated memory is still 127.9 MB. Free memory was 97.3 MB in the beginning and 83.4 MB in the end (delta: 13.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 6383.80 ms. Allocated memory was 127.9 MB in the beginning and 155.2 MB in the end (delta: 27.3 MB). Free memory was 83.4 MB in the beginning and 98.8 MB in the end (delta: -15.4 MB). Peak memory consumption was 73.6 MB. Max. memory is 16.1 GB. * Witness Printer took 60.42 ms. Allocated memory is still 155.2 MB. Free memory was 98.8 MB in the beginning and 95.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * 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. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.3s and 12 iterations. TraceHistogramMax:2. Analysis of lassos took 4.6s. Construction of modules took 0.3s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 11. Minimization of nondet autom 1. Automata minimization 134.5ms AutomataMinimizationTime, 12 MinimizatonAttempts, 467 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 217 states and ocurred in iteration 10. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1290 SDtfs, 1655 SDslu, 1619 SDs, 0 SdLazy, 304 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 321.6ms Time LassoAnalysisResults: nont1 unkn0 SFLI5 SFLT0 conc0 concLT1 SILN0 SILU0 SILI5 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital99 mio100 ax100 hnf100 lsp14 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq214 hnf86 smp100 dnf100 smp100 tf107 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 31ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 264]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=12109} State at position 1 is {p_last_write=10, c_dr_i=1, c_dr_pc=0, NULL=12112, a_t=0, NULL=0, \result=0, NULL=12109, \result=0, c_num_read=0, tmp=5, c_dr_st=0, kernel_st=1, q_read_ev=2, p_dw_i=1, tmp___1=1, tmp___0=0, q_write_ev=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@568869b0=0, __retres1=1, NULL=12110, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@334f4065=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@546a2673=0, p_dw_pc=1, NULL=0, NULL=0, NULL=0, tmp=0, q_free=0, NULL=12113, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4a892796=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3d2b0b95=0, __retres1=0, p_dw_st=2, \result=0, tmp___0=0, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2d28371d=0, c_last_read=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@48e860f9=0, NULL=0, __retres1=0, q_buf_0=10, p_num_write=1, __retres1=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 239]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L16] int q_buf_0 ; [L17] int q_free ; [L18] int q_read_ev ; [L19] int q_write_ev ; [L20] int p_num_write ; [L21] int p_last_write ; [L22] int p_dw_st ; [L23] int p_dw_pc ; [L24] int p_dw_i ; [L25] int c_num_read ; [L26] int c_last_read ; [L27] int c_dr_st ; [L28] int c_dr_pc ; [L29] int c_dr_i ; [L136] static int a_t ; [L352] int __retres1 ; [L338] q_free = 1 [L339] q_write_ev = 2 [L340] q_read_ev = q_write_ev [L341] p_num_write = 0 [L342] p_dw_pc = 0 [L343] p_dw_i = 1 [L344] c_num_read = 0 [L345] c_dr_pc = 0 [L346] c_dr_i = 1 [L306] int kernel_st ; [L307] int tmp ; [L311] kernel_st = 0 [L198] COND TRUE (int )p_dw_i == 1 [L199] p_dw_st = 0 [L203] COND TRUE (int )c_dr_i == 1 [L204] c_dr_st = 0 [L315] COND TRUE 1 [L318] kernel_st = 1 [L233] int tmp ; [L234] int tmp___0 ; [L235] int tmp___1 ; [L239] COND TRUE 1 [L213] int __retres1 ; [L216] COND TRUE (int )p_dw_st == 0 [L217] __retres1 = 1 [L229] return (__retres1); [L242] tmp___1 = exists_runnable_thread() [L244] COND TRUE \read(tmp___1) [L249] COND TRUE (int )p_dw_st == 0 [L251] tmp = __VERIFIER_nondet_int() [L253] COND TRUE \read(tmp) [L255] p_dw_st = 1 [L98] COND TRUE (int )p_dw_pc == 0 [L109] COND TRUE 1 [L111] COND FALSE !((int )q_free == 0) [L121] q_buf_0 = __VERIFIER_nondet_int() [L122] p_last_write = q_buf_0 [L123] p_num_write += 1 [L124] q_free = 0 [L125] q_write_ev = 1 [L69] int tmp ; [L70] int tmp___0 ; [L31] int __retres1 ; [L34] COND FALSE !((int )p_dw_pc == 1) [L44] __retres1 = 0 [L46] return (__retres1); [L74] tmp = is_do_write_p_triggered() [L76] COND FALSE !(\read(tmp)) [L50] int __retres1 ; [L53] COND FALSE !((int )c_dr_pc == 1) [L63] __retres1 = 0 [L65] return (__retres1); [L82] tmp___0 = is_do_read_c_triggered() [L84] COND FALSE !(\read(tmp___0)) [L127] q_write_ev = 2 [L109] COND TRUE 1 [L111] COND TRUE (int )q_free == 0 [L112] p_dw_st = 2 [L113] p_dw_pc = 1 Loop: [L264] COND TRUE (int )c_dr_st == 0 [L266] tmp___0 = __VERIFIER_nondet_int() [L268] COND FALSE !(\read(tmp___0)) [L239] COND TRUE 1 [L213] int __retres1 ; [L216] COND FALSE !((int )p_dw_st == 0) [L220] COND TRUE (int )c_dr_st == 0 [L221] __retres1 = 1 [L229] return (__retres1); [L242] tmp___1 = exists_runnable_thread() [L244] COND TRUE \read(tmp___1) [L249] COND FALSE !((int )p_dw_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-10-12 23:59:16,844 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9812ea90-e425-46c1-ac67-6f84867e7199/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...