./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e943c265 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8c22226-157c-4783-a382-529be5c59e14/bin/uautomizer-j4sWxH34Be/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8c22226-157c-4783-a382-529be5c59e14/bin/uautomizer-j4sWxH34Be/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8c22226-157c-4783-a382-529be5c59e14/bin/uautomizer-j4sWxH34Be/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8c22226-157c-4783-a382-529be5c59e14/bin/uautomizer-j4sWxH34Be/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8c22226-157c-4783-a382-529be5c59e14/bin/uautomizer-j4sWxH34Be/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8c22226-157c-4783-a382-529be5c59e14/bin/uautomizer-j4sWxH34Be --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 e4250f34aeb1bbaa6a68e9df4c6caead053a128de9d45e1f0dae379c6394c54d ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-e943c26 [2021-10-21 19:21:24,270 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-21 19:21:24,273 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-21 19:21:24,309 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-21 19:21:24,310 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-21 19:21:24,311 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-21 19:21:24,313 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-21 19:21:24,316 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-21 19:21:24,318 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-21 19:21:24,320 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-21 19:21:24,321 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-21 19:21:24,323 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-21 19:21:24,323 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-21 19:21:24,325 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-21 19:21:24,327 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-21 19:21:24,329 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-21 19:21:24,331 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-21 19:21:24,332 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-21 19:21:24,335 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-21 19:21:24,338 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-21 19:21:24,340 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-21 19:21:24,342 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-21 19:21:24,344 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-21 19:21:24,345 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-21 19:21:24,350 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-21 19:21:24,350 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-21 19:21:24,351 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-21 19:21:24,352 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-21 19:21:24,353 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-21 19:21:24,355 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-21 19:21:24,355 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-21 19:21:24,356 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-21 19:21:24,358 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-21 19:21:24,359 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-21 19:21:24,360 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-21 19:21:24,360 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-21 19:21:24,361 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-21 19:21:24,361 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-21 19:21:24,362 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-21 19:21:24,363 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-21 19:21:24,364 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-21 19:21:24,365 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8c22226-157c-4783-a382-529be5c59e14/bin/uautomizer-j4sWxH34Be/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-10-21 19:21:24,413 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-21 19:21:24,416 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-21 19:21:24,417 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-21 19:21:24,417 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-21 19:21:24,418 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-21 19:21:24,419 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-21 19:21:24,419 INFO L138 SettingsManager]: * Use SBE=true [2021-10-21 19:21:24,419 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-10-21 19:21:24,420 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-10-21 19:21:24,420 INFO L138 SettingsManager]: * Use old map elimination=false [2021-10-21 19:21:24,421 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-10-21 19:21:24,421 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-10-21 19:21:24,421 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-10-21 19:21:24,422 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-21 19:21:24,422 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-21 19:21:24,422 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-21 19:21:24,422 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-21 19:21:24,423 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-21 19:21:24,423 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-21 19:21:24,423 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-10-21 19:21:24,423 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-10-21 19:21:24,424 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-10-21 19:21:24,424 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-21 19:21:24,424 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-21 19:21:24,424 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-10-21 19:21:24,425 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-21 19:21:24,426 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-10-21 19:21:24,427 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-21 19:21:24,427 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-21 19:21:24,427 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-21 19:21:24,427 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-21 19:21:24,428 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-21 19:21:24,429 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-10-21 19:21:24,429 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_f8c22226-157c-4783-a382-529be5c59e14/bin/uautomizer-j4sWxH34Be/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_f8c22226-157c-4783-a382-529be5c59e14/bin/uautomizer-j4sWxH34Be 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 -> e4250f34aeb1bbaa6a68e9df4c6caead053a128de9d45e1f0dae379c6394c54d [2021-10-21 19:21:24,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-21 19:21:24,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-21 19:21:24,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-21 19:21:24,721 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-21 19:21:24,723 INFO L275 PluginConnector]: CDTParser initialized [2021-10-21 19:21:24,724 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8c22226-157c-4783-a382-529be5c59e14/bin/uautomizer-j4sWxH34Be/../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2021-10-21 19:21:24,819 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8c22226-157c-4783-a382-529be5c59e14/bin/uautomizer-j4sWxH34Be/data/e5954edb0/49a8bd520f0c4c5d845a6c1b356e3e85/FLAGf0c574c90 [2021-10-21 19:21:25,252 INFO L306 CDTParser]: Found 1 translation units. [2021-10-21 19:21:25,252 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8c22226-157c-4783-a382-529be5c59e14/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2021-10-21 19:21:25,264 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8c22226-157c-4783-a382-529be5c59e14/bin/uautomizer-j4sWxH34Be/data/e5954edb0/49a8bd520f0c4c5d845a6c1b356e3e85/FLAGf0c574c90 [2021-10-21 19:21:25,636 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8c22226-157c-4783-a382-529be5c59e14/bin/uautomizer-j4sWxH34Be/data/e5954edb0/49a8bd520f0c4c5d845a6c1b356e3e85 [2021-10-21 19:21:25,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-21 19:21:25,640 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-21 19:21:25,655 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-21 19:21:25,656 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-21 19:21:25,659 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-21 19:21:25,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:21:25" (1/1) ... [2021-10-21 19:21:25,661 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b7a4933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:21:25, skipping insertion in model container [2021-10-21 19:21:25,661 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:21:25" (1/1) ... [2021-10-21 19:21:25,669 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-21 19:21:25,695 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-21 19:21:25,841 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_f8c22226-157c-4783-a382-529be5c59e14/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c[337,350] [2021-10-21 19:21:25,890 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 19:21:25,899 INFO L203 MainTranslator]: Completed pre-run [2021-10-21 19:21:25,909 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_f8c22226-157c-4783-a382-529be5c59e14/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c[337,350] [2021-10-21 19:21:25,929 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 19:21:25,942 INFO L208 MainTranslator]: Completed translation [2021-10-21 19:21:25,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:21:25 WrapperNode [2021-10-21 19:21:25,942 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-21 19:21:25,943 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-21 19:21:25,943 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-21 19:21:25,943 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-21 19:21:25,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:21:25" (1/1) ... [2021-10-21 19:21:25,970 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:21:25" (1/1) ... [2021-10-21 19:21:26,003 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-21 19:21:26,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-21 19:21:26,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-21 19:21:26,011 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-21 19:21:26,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:21:25" (1/1) ... [2021-10-21 19:21:26,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:21:25" (1/1) ... [2021-10-21 19:21:26,034 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:21:25" (1/1) ... [2021-10-21 19:21:26,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:21:25" (1/1) ... [2021-10-21 19:21:26,041 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:21:25" (1/1) ... [2021-10-21 19:21:26,061 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:21:25" (1/1) ... [2021-10-21 19:21:26,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:21:25" (1/1) ... [2021-10-21 19:21:26,066 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-21 19:21:26,080 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-21 19:21:26,080 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-21 19:21:26,080 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-21 19:21:26,081 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:21:25" (1/1) ... [2021-10-21 19:21:26,089 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:21:26,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8c22226-157c-4783-a382-529be5c59e14/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:21:26,116 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8c22226-157c-4783-a382-529be5c59e14/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:21:26,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8c22226-157c-4783-a382-529be5c59e14/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-10-21 19:21:26,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-21 19:21:26,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-21 19:21:26,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-21 19:21:26,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-21 19:21:26,638 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-21 19:21:26,638 INFO L299 CfgBuilder]: Removed 42 assume(true) statements. [2021-10-21 19:21:26,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:21:26 BoogieIcfgContainer [2021-10-21 19:21:26,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-21 19:21:26,641 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-10-21 19:21:26,641 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-10-21 19:21:26,654 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-10-21 19:21:26,655 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-21 19:21:26,656 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.10 07:21:25" (1/3) ... [2021-10-21 19:21:26,657 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4708466c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.10 07:21:26, skipping insertion in model container [2021-10-21 19:21:26,658 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-21 19:21:26,658 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:21:25" (2/3) ... [2021-10-21 19:21:26,658 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4708466c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.10 07:21:26, skipping insertion in model container [2021-10-21 19:21:26,658 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-21 19:21:26,659 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:21:26" (3/3) ... [2021-10-21 19:21:26,660 INFO L389 chiAutomizerObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2021-10-21 19:21:26,713 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-10-21 19:21:26,713 INFO L360 BuchiCegarLoop]: Hoare is false [2021-10-21 19:21:26,714 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-10-21 19:21:26,714 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-21 19:21:26,714 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-21 19:21:26,714 INFO L364 BuchiCegarLoop]: Difference is false [2021-10-21 19:21:26,714 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-21 19:21:26,715 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-10-21 19:21:26,733 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 74 states, 73 states have (on average 1.5616438356164384) internal successors, (114), 73 states have internal predecessors, (114), 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-21 19:21:26,758 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2021-10-21 19:21:26,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:21:26,759 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:21:26,767 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-10-21 19:21:26,767 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:21:26,767 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-10-21 19:21:26,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 74 states, 73 states have (on average 1.5616438356164384) internal successors, (114), 73 states have internal predecessors, (114), 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-21 19:21:26,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2021-10-21 19:21:26,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:21:26,775 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:21:26,776 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-10-21 19:21:26,776 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:21:26,784 INFO L791 eck$LassoCheckResult]: Stem: 57#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; 41#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; 48#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; 55#L315-1true [2021-10-21 19:21:26,784 INFO L793 eck$LassoCheckResult]: Loop: 55#L315-1true assume !false; 50#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; 70#L264true assume false; 30#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; 68#L216-1true assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 63#L228-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 69#L229-1true stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 47#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); 55#L315-1true [2021-10-21 19:21:26,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:21:26,791 INFO L82 PathProgramCache]: Analyzing trace with hash 28692871, now seen corresponding path program 1 times [2021-10-21 19:21:26,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:21:26,801 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063641482] [2021-10-21 19:21:26,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:21:26,803 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:21:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:21:26,990 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-21 19:21:26,991 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:21:26,991 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063641482] [2021-10-21 19:21:26,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063641482] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:21:26,992 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:21:26,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:21:26,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512827406] [2021-10-21 19:21:27,000 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-21 19:21:27,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:21:27,001 INFO L82 PathProgramCache]: Analyzing trace with hash -168076210, now seen corresponding path program 1 times [2021-10-21 19:21:27,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:21:27,002 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289756028] [2021-10-21 19:21:27,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:21:27,003 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:21:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:21:27,016 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-21 19:21:27,017 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:21:27,017 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289756028] [2021-10-21 19:21:27,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289756028] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:21:27,031 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:21:27,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-21 19:21:27,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202632093] [2021-10-21 19:21:27,033 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-21 19:21:27,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:21:27,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:21:27,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:21:27,051 INFO L87 Difference]: Start difference. First operand has 74 states, 73 states have (on average 1.5616438356164384) internal successors, (114), 73 states have internal predecessors, (114), 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-21 19:21:27,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:21:27,073 INFO L93 Difference]: Finished difference Result 74 states and 103 transitions. [2021-10-21 19:21:27,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:21:27,075 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 103 transitions. [2021-10-21 19:21:27,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2021-10-21 19:21:27,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 68 states and 97 transitions. [2021-10-21 19:21:27,085 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2021-10-21 19:21:27,085 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2021-10-21 19:21:27,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 97 transitions. [2021-10-21 19:21:27,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:21:27,087 INFO L681 BuchiCegarLoop]: Abstraction has 68 states and 97 transitions. [2021-10-21 19:21:27,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 97 transitions. [2021-10-21 19:21:27,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-10-21 19:21:27,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 67 states have internal predecessors, (97), 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-21 19:21:27,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 97 transitions. [2021-10-21 19:21:27,119 INFO L704 BuchiCegarLoop]: Abstraction has 68 states and 97 transitions. [2021-10-21 19:21:27,119 INFO L587 BuchiCegarLoop]: Abstraction has 68 states and 97 transitions. [2021-10-21 19:21:27,119 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-10-21 19:21:27,120 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 97 transitions. [2021-10-21 19:21:27,122 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2021-10-21 19:21:27,122 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:21:27,122 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:21:27,123 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-10-21 19:21:27,123 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:21:27,123 INFO L791 eck$LassoCheckResult]: Stem: 221#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; 212#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; 213#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; 167#L198 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 168#L198-2 assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 180#L315-1 [2021-10-21 19:21:27,124 INFO L793 eck$LassoCheckResult]: Loop: 180#L315-1 assume !false; 219#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; 169#L264 assume !false; 202#L240 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 203#L216 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 192#L228 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 193#L229 eval_#t~ret10 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret10;havoc eval_#t~ret10; 175#L244 assume !(0 != eval_~tmp___1~0); 177#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; 204#L216-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 217#L228-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 224#L229-1 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 218#L294 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 200#L301 stop_simulation_#res := stop_simulation_~__retres2~0; 183#L302 start_simulation_#t~ret14 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 184#L322 assume !(0 != start_simulation_~tmp~3); 180#L315-1 [2021-10-21 19:21:27,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:21:27,125 INFO L82 PathProgramCache]: Analyzing trace with hash 28692809, now seen corresponding path program 1 times [2021-10-21 19:21:27,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:21:27,125 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176648652] [2021-10-21 19:21:27,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:21:27,126 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:21:27,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:21:27,161 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-21 19:21:27,162 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:21:27,162 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176648652] [2021-10-21 19:21:27,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176648652] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:21:27,163 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:21:27,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-21 19:21:27,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393915027] [2021-10-21 19:21:27,163 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-21 19:21:27,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:21:27,164 INFO L82 PathProgramCache]: Analyzing trace with hash -241927711, now seen corresponding path program 1 times [2021-10-21 19:21:27,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:21:27,165 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922793055] [2021-10-21 19:21:27,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:21:27,166 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:21:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:21:27,206 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-21 19:21:27,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:21:27,207 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922793055] [2021-10-21 19:21:27,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922793055] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:21:27,207 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:21:27,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 19:21:27,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715408128] [2021-10-21 19:21:27,208 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-21 19:21:27,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:21:27,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:21:27,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:21:27,210 INFO L87 Difference]: Start difference. First operand 68 states and 97 transitions. cyclomatic complexity: 30 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-21 19:21:27,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:21:27,221 INFO L93 Difference]: Finished difference Result 68 states and 96 transitions. [2021-10-21 19:21:27,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:21:27,223 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 96 transitions. [2021-10-21 19:21:27,225 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2021-10-21 19:21:27,227 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 68 states and 96 transitions. [2021-10-21 19:21:27,242 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2021-10-21 19:21:27,243 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2021-10-21 19:21:27,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 96 transitions. [2021-10-21 19:21:27,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:21:27,244 INFO L681 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2021-10-21 19:21:27,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 96 transitions. [2021-10-21 19:21:27,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-10-21 19:21:27,249 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-21 19:21:27,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2021-10-21 19:21:27,250 INFO L704 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2021-10-21 19:21:27,250 INFO L587 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2021-10-21 19:21:27,250 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-10-21 19:21:27,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 96 transitions. [2021-10-21 19:21:27,252 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2021-10-21 19:21:27,252 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:21:27,252 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:21:27,253 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-10-21 19:21:27,253 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:21:27,254 INFO L791 eck$LassoCheckResult]: Stem: 366#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; 357#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; 358#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; 312#L198 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 313#L198-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 325#L315-1 [2021-10-21 19:21:27,254 INFO L793 eck$LassoCheckResult]: Loop: 325#L315-1 assume !false; 364#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; 314#L264 assume !false; 347#L240 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 348#L216 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 337#L228 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 338#L229 eval_#t~ret10 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret10;havoc eval_#t~ret10; 322#L244 assume !(0 != eval_~tmp___1~0); 324#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; 349#L216-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 361#L228-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 369#L229-1 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 363#L294 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 342#L301 stop_simulation_#res := stop_simulation_~__retres2~0; 328#L302 start_simulation_#t~ret14 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 329#L322 assume !(0 != start_simulation_~tmp~3); 325#L315-1 [2021-10-21 19:21:27,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:21:27,255 INFO L82 PathProgramCache]: Analyzing trace with hash 28692807, now seen corresponding path program 1 times [2021-10-21 19:21:27,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:21:27,255 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430479669] [2021-10-21 19:21:27,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:21:27,256 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:21:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:21:27,274 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:21:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:21:27,338 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:21:27,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:21:27,342 INFO L82 PathProgramCache]: Analyzing trace with hash -241927711, now seen corresponding path program 2 times [2021-10-21 19:21:27,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:21:27,343 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491904465] [2021-10-21 19:21:27,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:21:27,344 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:21:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:21:27,419 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-21 19:21:27,420 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:21:27,420 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491904465] [2021-10-21 19:21:27,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491904465] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:21:27,421 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:21:27,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 19:21:27,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475362157] [2021-10-21 19:21:27,421 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-21 19:21:27,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:21:27,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 19:21:27,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:21:27,423 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. cyclomatic complexity: 29 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-21 19:21:27,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:21:27,555 INFO L93 Difference]: Finished difference Result 134 states and 187 transitions. [2021-10-21 19:21:27,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-21 19:21:27,558 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 187 transitions. [2021-10-21 19:21:27,563 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 129 [2021-10-21 19:21:27,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 134 states and 187 transitions. [2021-10-21 19:21:27,565 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 134 [2021-10-21 19:21:27,566 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 134 [2021-10-21 19:21:27,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 187 transitions. [2021-10-21 19:21:27,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:21:27,570 INFO L681 BuchiCegarLoop]: Abstraction has 134 states and 187 transitions. [2021-10-21 19:21:27,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 187 transitions. [2021-10-21 19:21:27,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 71. [2021-10-21 19:21:27,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 70 states have internal predecessors, (99), 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-21 19:21:27,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2021-10-21 19:21:27,584 INFO L704 BuchiCegarLoop]: Abstraction has 71 states and 99 transitions. [2021-10-21 19:21:27,584 INFO L587 BuchiCegarLoop]: Abstraction has 71 states and 99 transitions. [2021-10-21 19:21:27,584 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-10-21 19:21:27,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 99 transitions. [2021-10-21 19:21:27,585 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2021-10-21 19:21:27,585 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:21:27,586 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:21:27,586 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-10-21 19:21:27,586 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-21 19:21:27,587 INFO L791 eck$LassoCheckResult]: Stem: 584#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; 575#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; 576#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; 530#L198 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 531#L198-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 542#L315-1 [2021-10-21 19:21:27,587 INFO L793 eck$LassoCheckResult]: Loop: 542#L315-1 assume !false; 582#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; 532#L264 assume !false; 564#L240 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 565#L216 assume !(0 == ~p_dw_st~0); 574#L220 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 588#L228 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 590#L229 eval_#t~ret10 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret10;havoc eval_#t~ret10; 589#L244 assume !(0 != eval_~tmp___1~0); 566#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; 567#L216-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 580#L228-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 587#L229-1 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 581#L294 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 559#L301 stop_simulation_#res := stop_simulation_~__retres2~0; 545#L302 start_simulation_#t~ret14 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 546#L322 assume !(0 != start_simulation_~tmp~3); 542#L315-1 [2021-10-21 19:21:27,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:21:27,587 INFO L82 PathProgramCache]: Analyzing trace with hash 28692807, now seen corresponding path program 2 times [2021-10-21 19:21:27,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:21:27,588 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312946302] [2021-10-21 19:21:27,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:21:27,588 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:21:27,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:21:27,621 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:21:27,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:21:27,654 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:21:27,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:21:27,655 INFO L82 PathProgramCache]: Analyzing trace with hash 616414076, now seen corresponding path program 1 times [2021-10-21 19:21:27,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:21:27,656 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525708421] [2021-10-21 19:21:27,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:21:27,656 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:21:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:21:27,687 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-21 19:21:27,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:21:27,688 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525708421] [2021-10-21 19:21:27,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525708421] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:21:27,689 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:21:27,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:21:27,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851683152] [2021-10-21 19:21:27,690 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-21 19:21:27,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:21:27,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:21:27,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:21:27,695 INFO L87 Difference]: Start difference. First operand 71 states and 99 transitions. cyclomatic complexity: 29 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-21 19:21:27,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:21:27,746 INFO L93 Difference]: Finished difference Result 121 states and 166 transitions. [2021-10-21 19:21:27,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:21:27,756 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 166 transitions. [2021-10-21 19:21:27,758 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 114 [2021-10-21 19:21:27,760 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 121 states and 166 transitions. [2021-10-21 19:21:27,760 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2021-10-21 19:21:27,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2021-10-21 19:21:27,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 166 transitions. [2021-10-21 19:21:27,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:21:27,762 INFO L681 BuchiCegarLoop]: Abstraction has 121 states and 166 transitions. [2021-10-21 19:21:27,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 166 transitions. [2021-10-21 19:21:27,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 104. [2021-10-21 19:21:27,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 1.3653846153846154) internal successors, (142), 103 states have internal predecessors, (142), 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-21 19:21:27,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 142 transitions. [2021-10-21 19:21:27,768 INFO L704 BuchiCegarLoop]: Abstraction has 104 states and 142 transitions. [2021-10-21 19:21:27,768 INFO L587 BuchiCegarLoop]: Abstraction has 104 states and 142 transitions. [2021-10-21 19:21:27,768 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-10-21 19:21:27,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 142 transitions. [2021-10-21 19:21:27,770 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 97 [2021-10-21 19:21:27,770 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:21:27,770 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:21:27,771 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:21:27,771 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:21:27,771 INFO L791 eck$LassoCheckResult]: Stem: 786#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; 776#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; 777#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; 728#L198 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 729#L198-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 742#L315-1 assume !false; 783#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; 731#L264 [2021-10-21 19:21:27,771 INFO L793 eck$LassoCheckResult]: Loop: 731#L264 assume !false; 792#L240 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 800#L216 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 797#L228 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 796#L229 eval_#t~ret10 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret10;havoc eval_#t~ret10; 795#L244 assume 0 != eval_~tmp___1~0; 794#L244-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet11;havoc eval_#t~nondet11; 752#L253 assume !(0 != eval_~tmp~1); 730#L249 assume !(0 == ~c_dr_st~0); 731#L264 [2021-10-21 19:21:27,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:21:27,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1803984585, now seen corresponding path program 1 times [2021-10-21 19:21:27,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:21:27,772 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443101293] [2021-10-21 19:21:27,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:21:27,772 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:21:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:21:27,782 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:21:27,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:21:27,814 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:21:27,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:21:27,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1028489344, now seen corresponding path program 1 times [2021-10-21 19:21:27,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:21:27,821 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306594083] [2021-10-21 19:21:27,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:21:27,822 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:21:27,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:21:27,829 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:21:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:21:27,840 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:21:27,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:21:27,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1783037256, now seen corresponding path program 1 times [2021-10-21 19:21:27,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:21:27,841 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328351245] [2021-10-21 19:21:27,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:21:27,842 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:21:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:21:27,880 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-21 19:21:27,880 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:21:27,881 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328351245] [2021-10-21 19:21:27,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328351245] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:21:27,881 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:21:27,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-21 19:21:27,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333349979] [2021-10-21 19:21:27,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:21:27,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:21:27,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:21:27,964 INFO L87 Difference]: Start difference. First operand 104 states and 142 transitions. cyclomatic complexity: 39 Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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-21 19:21:27,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:21:27,988 INFO L93 Difference]: Finished difference Result 184 states and 249 transitions. [2021-10-21 19:21:27,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:21:27,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 249 transitions. [2021-10-21 19:21:27,991 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 177 [2021-10-21 19:21:27,993 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 184 states and 249 transitions. [2021-10-21 19:21:27,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 184 [2021-10-21 19:21:27,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 184 [2021-10-21 19:21:27,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 184 states and 249 transitions. [2021-10-21 19:21:27,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:21:27,996 INFO L681 BuchiCegarLoop]: Abstraction has 184 states and 249 transitions. [2021-10-21 19:21:27,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states and 249 transitions. [2021-10-21 19:21:28,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 146. [2021-10-21 19:21:28,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 146 states have (on average 1.3493150684931507) internal successors, (197), 145 states have internal predecessors, (197), 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-21 19:21:28,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 197 transitions. [2021-10-21 19:21:28,006 INFO L704 BuchiCegarLoop]: Abstraction has 146 states and 197 transitions. [2021-10-21 19:21:28,006 INFO L587 BuchiCegarLoop]: Abstraction has 146 states and 197 transitions. [2021-10-21 19:21:28,006 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-10-21 19:21:28,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 146 states and 197 transitions. [2021-10-21 19:21:28,007 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 139 [2021-10-21 19:21:28,007 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:21:28,008 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:21:28,008 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:21:28,008 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:21:28,008 INFO L791 eck$LassoCheckResult]: Stem: 1088#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; 1075#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; 1076#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; 1024#L198 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 1025#L198-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 1038#L315-1 assume !false; 1141#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; 1139#L264 [2021-10-21 19:21:28,009 INFO L793 eck$LassoCheckResult]: Loop: 1139#L264 assume !false; 1138#L240 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1137#L216 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 1135#L228 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1134#L229 eval_#t~ret10 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret10;havoc eval_#t~ret10; 1110#L244 assume 0 != eval_~tmp___1~0; 1111#L244-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet11;havoc eval_#t~nondet11; 1114#L253 assume !(0 != eval_~tmp~1); 1116#L249 assume 0 == ~c_dr_st~0;eval_~tmp___0~1 := eval_#t~nondet12;havoc eval_#t~nondet12; 1140#L268 assume !(0 != eval_~tmp___0~1); 1139#L264 [2021-10-21 19:21:28,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:21:28,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1803984585, now seen corresponding path program 2 times [2021-10-21 19:21:28,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:21:28,010 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388993836] [2021-10-21 19:21:28,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:21:28,010 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:21:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:21:28,019 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:21:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:21:28,031 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:21:28,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:21:28,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1818395562, now seen corresponding path program 1 times [2021-10-21 19:21:28,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:21:28,033 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96223707] [2021-10-21 19:21:28,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:21:28,033 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:21:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:21:28,037 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:21:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:21:28,043 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:21:28,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:21:28,043 INFO L82 PathProgramCache]: Analyzing trace with hash 560416882, now seen corresponding path program 1 times [2021-10-21 19:21:28,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:21:28,044 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401926183] [2021-10-21 19:21:28,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:21:28,044 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:21:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:21:28,053 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:21:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:21:28,068 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:21:28,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.10 07:21:28 BoogieIcfgContainer [2021-10-21 19:21:28,910 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-10-21 19:21:28,911 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-21 19:21:28,911 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-21 19:21:28,911 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-21 19:21:28,912 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:21:26" (3/4) ... [2021-10-21 19:21:28,915 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-10-21 19:21:28,960 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8c22226-157c-4783-a382-529be5c59e14/bin/uautomizer-j4sWxH34Be/witness.graphml [2021-10-21 19:21:28,960 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-21 19:21:28,961 INFO L168 Benchmark]: Toolchain (without parser) took 3320.63 ms. Allocated memory was 94.4 MB in the beginning and 121.6 MB in the end (delta: 27.3 MB). Free memory was 59.5 MB in the beginning and 88.2 MB in the end (delta: -28.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 19:21:28,962 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 94.4 MB. Free memory was 66.2 MB in the beginning and 66.2 MB in the end (delta: 29.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 19:21:28,962 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.94 ms. Allocated memory is still 94.4 MB. Free memory was 59.3 MB in the beginning and 69.5 MB in the end (delta: -10.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-21 19:21:28,963 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.63 ms. Allocated memory is still 94.4 MB. Free memory was 69.5 MB in the beginning and 67.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-21 19:21:28,963 INFO L168 Benchmark]: Boogie Preprocessor took 68.59 ms. Allocated memory is still 94.4 MB. Free memory was 67.4 MB in the beginning and 66.2 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 19:21:28,964 INFO L168 Benchmark]: RCFGBuilder took 560.88 ms. Allocated memory is still 94.4 MB. Free memory was 66.2 MB in the beginning and 51.9 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-10-21 19:21:28,964 INFO L168 Benchmark]: BuchiAutomizer took 2269.02 ms. Allocated memory was 94.4 MB in the beginning and 121.6 MB in the end (delta: 27.3 MB). Free memory was 51.9 MB in the beginning and 90.2 MB in the end (delta: -38.3 MB). Peak memory consumption was 39.4 MB. Max. memory is 16.1 GB. [2021-10-21 19:21:28,965 INFO L168 Benchmark]: Witness Printer took 49.25 ms. Allocated memory is still 121.6 MB. Free memory was 90.2 MB in the beginning and 88.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-21 19:21:28,967 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.27 ms. Allocated memory is still 94.4 MB. Free memory was 66.2 MB in the beginning and 66.2 MB in the end (delta: 29.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 286.94 ms. Allocated memory is still 94.4 MB. Free memory was 59.3 MB in the beginning and 69.5 MB in the end (delta: -10.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 66.63 ms. Allocated memory is still 94.4 MB. Free memory was 69.5 MB in the beginning and 67.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 68.59 ms. Allocated memory is still 94.4 MB. Free memory was 67.4 MB in the beginning and 66.2 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 560.88 ms. Allocated memory is still 94.4 MB. Free memory was 66.2 MB in the beginning and 51.9 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 2269.02 ms. Allocated memory was 94.4 MB in the beginning and 121.6 MB in the end (delta: 27.3 MB). Free memory was 51.9 MB in the beginning and 90.2 MB in the end (delta: -38.3 MB). Peak memory consumption was 39.4 MB. Max. memory is 16.1 GB. * Witness Printer took 49.25 ms. Allocated memory is still 121.6 MB. Free memory was 90.2 MB in the beginning and 88.2 MB in the end (delta: 2.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 5 terminating modules (5 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.5 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 146 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.1s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 1.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 52.6ms AutomataMinimizationTime, 5 MinimizatonAttempts, 118 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 146 states and ocurred in iteration 5. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 537 SDtfs, 571 SDslu, 420 SDs, 0 SdLazy, 55 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 101.1ms Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 239]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {p_last_write=0, c_dr_i=1, c_dr_pc=0, NULL=3, a_t=0, NULL=0, \result=0, NULL=1, c_num_read=0, tmp=0, c_dr_st=0, kernel_st=1, q_read_ev=2, p_dw_i=1, tmp___0=0, tmp___1=1, q_write_ev=2, __retres1=1, NULL=5, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2d0cad05=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@b8e3185=0, p_dw_pc=0, NULL=0, NULL=0, NULL=0, tmp=0, q_free=1, NULL=4, p_dw_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@11756496=0, c_last_read=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@21e6da14=0, p_num_write=0, q_buf_0=0, __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 ; Loop: [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 FALSE !(\read(tmp)) [L264] COND TRUE (int )c_dr_st == 0 [L266] tmp___0 = __VERIFIER_nondet_int() [L268] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-10-21 19:21:29,043 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8c22226-157c-4783-a382-529be5c59e14/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...