./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_6.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_8b616d8f-b9ba-49ea-8d40-90bcae1cf3c0/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b616d8f-b9ba-49ea-8d40-90bcae1cf3c0/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_8b616d8f-b9ba-49ea-8d40-90bcae1cf3c0/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b616d8f-b9ba-49ea-8d40-90bcae1cf3c0/bin/uautomizer-WNIpwEf4Nt/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_6.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b616d8f-b9ba-49ea-8d40-90bcae1cf3c0/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_8b616d8f-b9ba-49ea-8d40-90bcae1cf3c0/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 8a6bc1adbcafb13db44c5d4b4826990150e2f336 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-13 00:53:51,289 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 00:53:51,292 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 00:53:51,333 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 00:53:51,334 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 00:53:51,335 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 00:53:51,338 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 00:53:51,341 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 00:53:51,344 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 00:53:51,345 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 00:53:51,347 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 00:53:51,349 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 00:53:51,350 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 00:53:51,352 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 00:53:51,354 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 00:53:51,356 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 00:53:51,357 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 00:53:51,359 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 00:53:51,361 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 00:53:51,365 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 00:53:51,367 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 00:53:51,369 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 00:53:51,371 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 00:53:51,373 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 00:53:51,378 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 00:53:51,378 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 00:53:51,379 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 00:53:51,380 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 00:53:51,381 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 00:53:51,383 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 00:53:51,384 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 00:53:51,385 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 00:53:51,386 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 00:53:51,388 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 00:53:51,389 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 00:53:51,390 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 00:53:51,391 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 00:53:51,392 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 00:53:51,392 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 00:53:51,394 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 00:53:51,395 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 00:53:51,396 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b616d8f-b9ba-49ea-8d40-90bcae1cf3c0/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-10-13 00:53:51,428 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 00:53:51,435 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 00:53:51,436 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-13 00:53:51,436 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-13 00:53:51,438 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 00:53:51,438 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 00:53:51,438 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 00:53:51,439 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-10-13 00:53:51,439 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-10-13 00:53:51,439 INFO L138 SettingsManager]: * Use old map elimination=false [2021-10-13 00:53:51,440 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-10-13 00:53:51,440 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-10-13 00:53:51,440 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-10-13 00:53:51,440 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 00:53:51,441 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 00:53:51,441 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-13 00:53:51,441 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 00:53:51,442 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 00:53:51,442 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 00:53:51,443 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-10-13 00:53:51,443 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-10-13 00:53:51,443 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-10-13 00:53:51,444 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 00:53:51,444 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 00:53:51,444 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-10-13 00:53:51,444 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 00:53:51,446 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-10-13 00:53:51,447 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 00:53:51,448 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 00:53:51,448 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 00:53:51,448 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-13 00:53:51,449 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 00:53:51,450 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-10-13 00:53:51,451 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_8b616d8f-b9ba-49ea-8d40-90bcae1cf3c0/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_8b616d8f-b9ba-49ea-8d40-90bcae1cf3c0/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 -> 8a6bc1adbcafb13db44c5d4b4826990150e2f336 [2021-10-13 00:53:51,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 00:53:51,801 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 00:53:51,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 00:53:51,806 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 00:53:51,808 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 00:53:51,809 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b616d8f-b9ba-49ea-8d40-90bcae1cf3c0/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/locks/test_locks_6.c [2021-10-13 00:53:51,895 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b616d8f-b9ba-49ea-8d40-90bcae1cf3c0/bin/uautomizer-WNIpwEf4Nt/data/8980d00e1/73541cd60e9348c285550c553cb23c61/FLAG5ffcb439c [2021-10-13 00:53:52,497 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 00:53:52,498 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b616d8f-b9ba-49ea-8d40-90bcae1cf3c0/sv-benchmarks/c/locks/test_locks_6.c [2021-10-13 00:53:52,507 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b616d8f-b9ba-49ea-8d40-90bcae1cf3c0/bin/uautomizer-WNIpwEf4Nt/data/8980d00e1/73541cd60e9348c285550c553cb23c61/FLAG5ffcb439c [2021-10-13 00:53:52,900 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b616d8f-b9ba-49ea-8d40-90bcae1cf3c0/bin/uautomizer-WNIpwEf4Nt/data/8980d00e1/73541cd60e9348c285550c553cb23c61 [2021-10-13 00:53:52,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 00:53:52,905 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 00:53:52,909 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 00:53:52,910 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 00:53:52,914 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 00:53:52,915 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:53:52" (1/1) ... [2021-10-13 00:53:52,916 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54277502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:52, skipping insertion in model container [2021-10-13 00:53:52,917 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:53:52" (1/1) ... [2021-10-13 00:53:52,924 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 00:53:52,948 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 00:53:53,127 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_8b616d8f-b9ba-49ea-8d40-90bcae1cf3c0/sv-benchmarks/c/locks/test_locks_6.c[2544,2557] [2021-10-13 00:53:53,137 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:53:53,149 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 00:53:53,175 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_8b616d8f-b9ba-49ea-8d40-90bcae1cf3c0/sv-benchmarks/c/locks/test_locks_6.c[2544,2557] [2021-10-13 00:53:53,176 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:53:53,192 INFO L208 MainTranslator]: Completed translation [2021-10-13 00:53:53,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:53 WrapperNode [2021-10-13 00:53:53,193 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 00:53:53,194 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 00:53:53,195 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 00:53:53,195 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 00:53:53,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:53" (1/1) ... [2021-10-13 00:53:53,212 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:53" (1/1) ... [2021-10-13 00:53:53,248 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 00:53:53,249 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 00:53:53,250 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 00:53:53,250 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 00:53:53,259 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:53" (1/1) ... [2021-10-13 00:53:53,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:53" (1/1) ... [2021-10-13 00:53:53,261 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:53" (1/1) ... [2021-10-13 00:53:53,261 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:53" (1/1) ... [2021-10-13 00:53:53,266 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:53" (1/1) ... [2021-10-13 00:53:53,271 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:53" (1/1) ... [2021-10-13 00:53:53,273 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:53" (1/1) ... [2021-10-13 00:53:53,275 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 00:53:53,276 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 00:53:53,277 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 00:53:53,277 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 00:53:53,287 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:53" (1/1) ... [2021-10-13 00:53:53,294 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-13 00:53:53,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b616d8f-b9ba-49ea-8d40-90bcae1cf3c0/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:53:53,326 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b616d8f-b9ba-49ea-8d40-90bcae1cf3c0/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-13 00:53:53,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b616d8f-b9ba-49ea-8d40-90bcae1cf3c0/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-10-13 00:53:53,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 00:53:53,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 00:53:53,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 00:53:53,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 00:53:53,635 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 00:53:53,635 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-10-13 00:53:53,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:53:53 BoogieIcfgContainer [2021-10-13 00:53:53,638 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 00:53:53,639 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-10-13 00:53:53,639 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-10-13 00:53:53,643 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-10-13 00:53:53,644 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-13 00:53:53,644 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.10 12:53:52" (1/3) ... [2021-10-13 00:53:53,646 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76d7bb79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 12:53:53, skipping insertion in model container [2021-10-13 00:53:53,646 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-13 00:53:53,646 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:53" (2/3) ... [2021-10-13 00:53:53,647 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76d7bb79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 12:53:53, skipping insertion in model container [2021-10-13 00:53:53,647 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-13 00:53:53,647 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:53:53" (3/3) ... [2021-10-13 00:53:53,649 INFO L389 chiAutomizerObserver]: Analyzing ICFG test_locks_6.c [2021-10-13 00:53:53,702 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-10-13 00:53:53,702 INFO L360 BuchiCegarLoop]: Hoare is false [2021-10-13 00:53:53,702 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-10-13 00:53:53,702 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-13 00:53:53,703 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-13 00:53:53,703 INFO L364 BuchiCegarLoop]: Difference is false [2021-10-13 00:53:53,703 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-13 00:53:53,703 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-10-13 00:53:53,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 26 states have internal predecessors, (47), 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-13 00:53:53,747 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2021-10-13 00:53:53,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:53:53,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:53:53,755 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:53:53,755 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:53:53,755 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-10-13 00:53:53,756 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 26 states have internal predecessors, (47), 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-13 00:53:53,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2021-10-13 00:53:53,761 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:53:53,761 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:53:53,763 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:53:53,763 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:53:53,771 INFO L791 eck$LassoCheckResult]: Stem: 17#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 9#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;havoc main_~cond~0; 12#L99-1true [2021-10-13 00:53:53,772 INFO L793 eck$LassoCheckResult]: Loop: 12#L99-1true assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 8#L31true assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0; 15#L48true assume 0 != main_~p1~0;main_~lk1~0 := 1; 4#L48-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 28#L52-1true assume !(0 != main_~p3~0); 21#L56-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 6#L60-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 25#L64-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 24#L68-1true assume !(0 != main_~p1~0); 27#L74-1true assume !(0 != main_~p2~0); 13#L79-1true assume !(0 != main_~p3~0); 23#L84-1true assume !(0 != main_~p4~0); 14#L89-1true assume !(0 != main_~p5~0); 11#L94-1true assume !(0 != main_~p6~0); 12#L99-1true [2021-10-13 00:53:53,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:53:53,779 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-10-13 00:53:53,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:53:53,790 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734597186] [2021-10-13 00:53:53,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:53:53,791 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:53:53,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:53:53,948 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:53:53,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:53:54,002 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:53:54,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:53:54,006 INFO L82 PathProgramCache]: Analyzing trace with hash -11500681, now seen corresponding path program 1 times [2021-10-13 00:53:54,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:53:54,007 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098762394] [2021-10-13 00:53:54,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:53:54,008 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:53:54,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:53:54,111 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-13 00:53:54,111 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:53:54,112 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098762394] [2021-10-13 00:53:54,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098762394] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:53:54,113 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:53:54,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:53:54,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961344139] [2021-10-13 00:53:54,120 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:53:54,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:53:54,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:53:54,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:54,155 INFO L87 Difference]: Start difference. First operand has 27 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 26 states have internal predecessors, (47), 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 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-13 00:53:54,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:53:54,225 INFO L93 Difference]: Finished difference Result 51 states and 82 transitions. [2021-10-13 00:53:54,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:53:54,227 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 82 transitions. [2021-10-13 00:53:54,233 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2021-10-13 00:53:54,241 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 41 states and 63 transitions. [2021-10-13 00:53:54,244 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2021-10-13 00:53:54,245 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2021-10-13 00:53:54,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 63 transitions. [2021-10-13 00:53:54,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:53:54,247 INFO L681 BuchiCegarLoop]: Abstraction has 41 states and 63 transitions. [2021-10-13 00:53:54,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 63 transitions. [2021-10-13 00:53:54,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2021-10-13 00:53:54,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 40 states have internal predecessors, (63), 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-13 00:53:54,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 63 transitions. [2021-10-13 00:53:54,286 INFO L704 BuchiCegarLoop]: Abstraction has 41 states and 63 transitions. [2021-10-13 00:53:54,286 INFO L587 BuchiCegarLoop]: Abstraction has 41 states and 63 transitions. [2021-10-13 00:53:54,286 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-10-13 00:53:54,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 63 transitions. [2021-10-13 00:53:54,288 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2021-10-13 00:53:54,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:53:54,289 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:53:54,290 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:53:54,290 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:53:54,290 INFO L791 eck$LassoCheckResult]: Stem: 89#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 90#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;havoc main_~cond~0; 104#L99-1 [2021-10-13 00:53:54,290 INFO L793 eck$LassoCheckResult]: Loop: 104#L99-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 119#L31 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0; 118#L48 assume !(0 != main_~p1~0); 87#L48-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 88#L52-1 assume !(0 != main_~p3~0); 117#L56-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 116#L60-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 115#L64-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 114#L68-1 assume !(0 != main_~p1~0); 111#L74-1 assume !(0 != main_~p2~0); 109#L79-1 assume !(0 != main_~p3~0); 92#L84-1 assume !(0 != main_~p4~0); 123#L89-1 assume !(0 != main_~p5~0); 121#L94-1 assume !(0 != main_~p6~0); 104#L99-1 [2021-10-13 00:53:54,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:53:54,292 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-10-13 00:53:54,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:53:54,293 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740659501] [2021-10-13 00:53:54,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:53:54,293 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:53:54,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:53:54,327 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:53:54,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:53:54,361 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:53:54,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:53:54,362 INFO L82 PathProgramCache]: Analyzing trace with hash 246664757, now seen corresponding path program 1 times [2021-10-13 00:53:54,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:53:54,363 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717638235] [2021-10-13 00:53:54,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:53:54,364 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:53:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:53:54,399 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-13 00:53:54,400 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:53:54,400 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717638235] [2021-10-13 00:53:54,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717638235] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:53:54,401 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:53:54,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:53:54,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936167507] [2021-10-13 00:53:54,402 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:53:54,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:53:54,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:53:54,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:54,405 INFO L87 Difference]: Start difference. First operand 41 states and 63 transitions. cyclomatic complexity: 24 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-13 00:53:54,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:53:54,457 INFO L93 Difference]: Finished difference Result 78 states and 118 transitions. [2021-10-13 00:53:54,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:53:54,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 118 transitions. [2021-10-13 00:53:54,462 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 76 [2021-10-13 00:53:54,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 78 states and 118 transitions. [2021-10-13 00:53:54,470 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78 [2021-10-13 00:53:54,471 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2021-10-13 00:53:54,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 118 transitions. [2021-10-13 00:53:54,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:53:54,475 INFO L681 BuchiCegarLoop]: Abstraction has 78 states and 118 transitions. [2021-10-13 00:53:54,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 118 transitions. [2021-10-13 00:53:54,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-10-13 00:53:54,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.5128205128205128) internal successors, (118), 77 states have internal predecessors, (118), 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-13 00:53:54,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 118 transitions. [2021-10-13 00:53:54,486 INFO L704 BuchiCegarLoop]: Abstraction has 78 states and 118 transitions. [2021-10-13 00:53:54,487 INFO L587 BuchiCegarLoop]: Abstraction has 78 states and 118 transitions. [2021-10-13 00:53:54,487 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-10-13 00:53:54,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 118 transitions. [2021-10-13 00:53:54,490 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 76 [2021-10-13 00:53:54,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:53:54,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:53:54,491 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:53:54,491 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:53:54,491 INFO L791 eck$LassoCheckResult]: Stem: 214#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 215#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;havoc main_~cond~0; 227#L99-1 [2021-10-13 00:53:54,492 INFO L793 eck$LassoCheckResult]: Loop: 227#L99-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 263#L31 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0; 259#L48 assume !(0 != main_~p1~0); 258#L48-2 assume !(0 != main_~p2~0); 257#L52-1 assume !(0 != main_~p3~0); 255#L56-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 253#L60-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 251#L64-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 249#L68-1 assume !(0 != main_~p1~0); 240#L74-1 assume !(0 != main_~p2~0); 238#L79-1 assume !(0 != main_~p3~0); 217#L84-1 assume !(0 != main_~p4~0); 276#L89-1 assume !(0 != main_~p5~0); 272#L94-1 assume !(0 != main_~p6~0); 227#L99-1 [2021-10-13 00:53:54,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:53:54,493 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-10-13 00:53:54,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:53:54,494 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699846172] [2021-10-13 00:53:54,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:53:54,495 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:53:54,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:53:54,515 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:53:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:53:54,551 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:53:54,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:53:54,552 INFO L82 PathProgramCache]: Analyzing trace with hash 947729335, now seen corresponding path program 1 times [2021-10-13 00:53:54,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:53:54,552 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529503354] [2021-10-13 00:53:54,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:53:54,553 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:53:54,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:53:54,624 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-13 00:53:54,625 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:53:54,625 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529503354] [2021-10-13 00:53:54,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529503354] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:53:54,626 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:53:54,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:53:54,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673421738] [2021-10-13 00:53:54,627 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:53:54,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:53:54,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:53:54,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:54,638 INFO L87 Difference]: Start difference. First operand 78 states and 118 transitions. cyclomatic complexity: 44 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-13 00:53:54,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:53:54,661 INFO L93 Difference]: Finished difference Result 150 states and 222 transitions. [2021-10-13 00:53:54,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:53:54,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 222 transitions. [2021-10-13 00:53:54,667 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 148 [2021-10-13 00:53:54,671 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 150 states and 222 transitions. [2021-10-13 00:53:54,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 150 [2021-10-13 00:53:54,672 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 150 [2021-10-13 00:53:54,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 222 transitions. [2021-10-13 00:53:54,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:53:54,674 INFO L681 BuchiCegarLoop]: Abstraction has 150 states and 222 transitions. [2021-10-13 00:53:54,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 222 transitions. [2021-10-13 00:53:54,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2021-10-13 00:53:54,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 150 states have (on average 1.48) internal successors, (222), 149 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-13 00:53:54,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 222 transitions. [2021-10-13 00:53:54,696 INFO L704 BuchiCegarLoop]: Abstraction has 150 states and 222 transitions. [2021-10-13 00:53:54,696 INFO L587 BuchiCegarLoop]: Abstraction has 150 states and 222 transitions. [2021-10-13 00:53:54,696 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-10-13 00:53:54,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 150 states and 222 transitions. [2021-10-13 00:53:54,699 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 148 [2021-10-13 00:53:54,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:53:54,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:53:54,700 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:53:54,700 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:53:54,701 INFO L791 eck$LassoCheckResult]: Stem: 448#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 449#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;havoc main_~cond~0; 461#L99-1 [2021-10-13 00:53:54,701 INFO L793 eck$LassoCheckResult]: Loop: 461#L99-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 503#L31 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0; 498#L48 assume !(0 != main_~p1~0); 492#L48-2 assume !(0 != main_~p2~0); 485#L52-1 assume !(0 != main_~p3~0); 486#L56-1 assume !(0 != main_~p4~0); 546#L60-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 545#L64-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 539#L68-1 assume !(0 != main_~p1~0); 541#L74-1 assume !(0 != main_~p2~0); 538#L79-1 assume !(0 != main_~p3~0); 536#L84-1 assume !(0 != main_~p4~0); 535#L89-1 assume !(0 != main_~p5~0); 517#L94-1 assume !(0 != main_~p6~0); 461#L99-1 [2021-10-13 00:53:54,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:53:54,702 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-10-13 00:53:54,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:53:54,703 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496443011] [2021-10-13 00:53:54,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:53:54,703 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:53:54,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:53:54,745 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:53:54,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:53:54,763 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:53:54,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:53:54,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1627787705, now seen corresponding path program 1 times [2021-10-13 00:53:54,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:53:54,765 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935588899] [2021-10-13 00:53:54,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:53:54,765 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:53:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:53:54,791 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-13 00:53:54,792 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:53:54,792 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935588899] [2021-10-13 00:53:54,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935588899] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:53:54,793 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:53:54,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:53:54,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822969665] [2021-10-13 00:53:54,794 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:53:54,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:53:54,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:53:54,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:54,795 INFO L87 Difference]: Start difference. First operand 150 states and 222 transitions. cyclomatic complexity: 80 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-13 00:53:54,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:53:54,818 INFO L93 Difference]: Finished difference Result 290 states and 418 transitions. [2021-10-13 00:53:54,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:53:54,819 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 290 states and 418 transitions. [2021-10-13 00:53:54,825 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 288 [2021-10-13 00:53:54,830 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 290 states to 290 states and 418 transitions. [2021-10-13 00:53:54,830 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 290 [2021-10-13 00:53:54,831 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 290 [2021-10-13 00:53:54,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 290 states and 418 transitions. [2021-10-13 00:53:54,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:53:54,834 INFO L681 BuchiCegarLoop]: Abstraction has 290 states and 418 transitions. [2021-10-13 00:53:54,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states and 418 transitions. [2021-10-13 00:53:54,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2021-10-13 00:53:54,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 290 states have (on average 1.4413793103448276) internal successors, (418), 289 states have internal predecessors, (418), 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-13 00:53:54,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 418 transitions. [2021-10-13 00:53:54,860 INFO L704 BuchiCegarLoop]: Abstraction has 290 states and 418 transitions. [2021-10-13 00:53:54,860 INFO L587 BuchiCegarLoop]: Abstraction has 290 states and 418 transitions. [2021-10-13 00:53:54,860 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-10-13 00:53:54,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 290 states and 418 transitions. [2021-10-13 00:53:54,863 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 288 [2021-10-13 00:53:54,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:53:54,863 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:53:54,864 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:53:54,864 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:53:54,864 INFO L791 eck$LassoCheckResult]: Stem: 894#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 895#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;havoc main_~cond~0; 907#L99-1 [2021-10-13 00:53:54,865 INFO L793 eck$LassoCheckResult]: Loop: 907#L99-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 955#L31 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0; 953#L48 assume !(0 != main_~p1~0); 949#L48-2 assume !(0 != main_~p2~0); 947#L52-1 assume !(0 != main_~p3~0); 943#L56-1 assume !(0 != main_~p4~0); 939#L60-1 assume !(0 != main_~p5~0); 937#L64-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 934#L68-1 assume !(0 != main_~p1~0); 935#L74-1 assume !(0 != main_~p2~0); 971#L79-1 assume !(0 != main_~p3~0); 966#L84-1 assume !(0 != main_~p4~0); 962#L89-1 assume !(0 != main_~p5~0); 959#L94-1 assume !(0 != main_~p6~0); 907#L99-1 [2021-10-13 00:53:54,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:53:54,865 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-10-13 00:53:54,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:53:54,866 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57877703] [2021-10-13 00:53:54,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:53:54,866 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:53:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:53:54,877 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:53:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:53:54,899 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:53:54,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:53:54,904 INFO L82 PathProgramCache]: Analyzing trace with hash 818441079, now seen corresponding path program 1 times [2021-10-13 00:53:54,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:53:54,904 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415289415] [2021-10-13 00:53:54,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:53:54,905 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:53:54,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:53:54,945 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-13 00:53:54,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:53:54,946 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415289415] [2021-10-13 00:53:54,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415289415] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:53:54,947 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:53:54,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 00:53:54,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824021345] [2021-10-13 00:53:54,948 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:53:54,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:53:54,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:53:54,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:54,949 INFO L87 Difference]: Start difference. First operand 290 states and 418 transitions. cyclomatic complexity: 144 Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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-13 00:53:54,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:53:54,998 INFO L93 Difference]: Finished difference Result 562 states and 786 transitions. [2021-10-13 00:53:54,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:53:54,999 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 562 states and 786 transitions. [2021-10-13 00:53:55,006 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 560 [2021-10-13 00:53:55,014 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 562 states to 562 states and 786 transitions. [2021-10-13 00:53:55,015 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 562 [2021-10-13 00:53:55,016 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 562 [2021-10-13 00:53:55,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 562 states and 786 transitions. [2021-10-13 00:53:55,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:53:55,022 INFO L681 BuchiCegarLoop]: Abstraction has 562 states and 786 transitions. [2021-10-13 00:53:55,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states and 786 transitions. [2021-10-13 00:53:55,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2021-10-13 00:53:55,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 562 states have (on average 1.398576512455516) internal successors, (786), 561 states have internal predecessors, (786), 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-13 00:53:55,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 786 transitions. [2021-10-13 00:53:55,078 INFO L704 BuchiCegarLoop]: Abstraction has 562 states and 786 transitions. [2021-10-13 00:53:55,078 INFO L587 BuchiCegarLoop]: Abstraction has 562 states and 786 transitions. [2021-10-13 00:53:55,078 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-10-13 00:53:55,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 562 states and 786 transitions. [2021-10-13 00:53:55,088 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 560 [2021-10-13 00:53:55,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:53:55,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:53:55,088 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:53:55,089 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:53:55,089 INFO L791 eck$LassoCheckResult]: Stem: 1752#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1753#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;havoc main_~cond~0; 1765#L99-1 [2021-10-13 00:53:55,089 INFO L793 eck$LassoCheckResult]: Loop: 1765#L99-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 1846#L31 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0; 1842#L48 assume !(0 != main_~p1~0); 1835#L48-2 assume !(0 != main_~p2~0); 1830#L52-1 assume !(0 != main_~p3~0); 1823#L56-1 assume !(0 != main_~p4~0); 1815#L60-1 assume !(0 != main_~p5~0); 1809#L64-1 assume !(0 != main_~p6~0); 1803#L68-1 assume !(0 != main_~p1~0); 1804#L74-1 assume !(0 != main_~p2~0); 1873#L79-1 assume !(0 != main_~p3~0); 1864#L84-1 assume !(0 != main_~p4~0); 1857#L89-1 assume !(0 != main_~p5~0); 1853#L94-1 assume !(0 != main_~p6~0); 1765#L99-1 [2021-10-13 00:53:55,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:53:55,090 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-10-13 00:53:55,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:53:55,090 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571147928] [2021-10-13 00:53:55,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:53:55,091 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:53:55,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:53:55,110 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:53:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:53:55,147 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:53:55,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:53:55,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1701518855, now seen corresponding path program 1 times [2021-10-13 00:53:55,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:53:55,151 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286373192] [2021-10-13 00:53:55,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:53:55,152 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:53:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:53:55,162 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:53:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:53:55,177 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:53:55,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:53:55,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1159342651, now seen corresponding path program 1 times [2021-10-13 00:53:55,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:53:55,184 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673820693] [2021-10-13 00:53:55,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:53:55,186 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:53:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:53:55,197 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:53:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:53:55,222 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:53:55,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.10 12:53:55 BoogieIcfgContainer [2021-10-13 00:53:55,820 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-10-13 00:53:55,821 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 00:53:55,821 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 00:53:55,821 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 00:53:55,822 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:53:53" (3/4) ... [2021-10-13 00:53:55,825 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-10-13 00:53:55,873 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b616d8f-b9ba-49ea-8d40-90bcae1cf3c0/bin/uautomizer-WNIpwEf4Nt/witness.graphml [2021-10-13 00:53:55,874 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 00:53:55,876 INFO L168 Benchmark]: Toolchain (without parser) took 2969.21 ms. Allocated memory was 107.0 MB in the beginning and 130.0 MB in the end (delta: 23.1 MB). Free memory was 75.6 MB in the beginning and 76.3 MB in the end (delta: -743.9 kB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2021-10-13 00:53:55,876 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 107.0 MB. Free memory is still 61.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 00:53:55,877 INFO L168 Benchmark]: CACSL2BoogieTranslator took 284.30 ms. Allocated memory is still 107.0 MB. Free memory was 75.4 MB in the beginning and 81.3 MB in the end (delta: -6.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-13 00:53:55,878 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.97 ms. Allocated memory is still 107.0 MB. Free memory was 81.3 MB in the beginning and 79.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 00:53:55,878 INFO L168 Benchmark]: Boogie Preprocessor took 26.14 ms. Allocated memory is still 107.0 MB. Free memory was 79.7 MB in the beginning and 78.6 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 00:53:55,879 INFO L168 Benchmark]: RCFGBuilder took 361.48 ms. Allocated memory is still 107.0 MB. Free memory was 78.6 MB in the beginning and 68.1 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-13 00:53:55,880 INFO L168 Benchmark]: BuchiAutomizer took 2181.10 ms. Allocated memory was 107.0 MB in the beginning and 130.0 MB in the end (delta: 23.1 MB). Free memory was 68.1 MB in the beginning and 78.4 MB in the end (delta: -10.3 MB). Peak memory consumption was 15.7 MB. Max. memory is 16.1 GB. [2021-10-13 00:53:55,880 INFO L168 Benchmark]: Witness Printer took 53.48 ms. Allocated memory is still 130.0 MB. Free memory was 78.4 MB in the beginning and 76.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 00:53:55,884 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 107.0 MB. Free memory is still 61.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 284.30 ms. Allocated memory is still 107.0 MB. Free memory was 75.4 MB in the beginning and 81.3 MB in the end (delta: -6.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 53.97 ms. Allocated memory is still 107.0 MB. Free memory was 81.3 MB in the beginning and 79.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 26.14 ms. Allocated memory is still 107.0 MB. Free memory was 79.7 MB in the beginning and 78.6 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 361.48 ms. Allocated memory is still 107.0 MB. Free memory was 78.6 MB in the beginning and 68.1 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 2181.10 ms. Allocated memory was 107.0 MB in the beginning and 130.0 MB in the end (delta: 23.1 MB). Free memory was 68.1 MB in the beginning and 78.4 MB in the end (delta: -10.3 MB). Peak memory consumption was 15.7 MB. Max. memory is 16.1 GB. * Witness Printer took 53.48 ms. Allocated memory is still 130.0 MB. Free memory was 78.4 MB in the beginning and 76.3 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 3 locations. The remainder module has 562 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.1s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. 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 134.9ms AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 562 states and ocurred in iteration 5. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 256 SDtfs, 130 SDslu, 149 SDs, 0 SdLazy, 25 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 102.8ms Time LassoAnalysisResults: nont1 unkn0 SFLI5 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 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: 29]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=28471} State at position 1 is {NULL=28474, NULL=0, p1=0, \result=0, p3=0, p2=0, p5=0, NULL=28471, p4=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@491c0c28=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4ce27f71=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4b108f98=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@df31b8a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@24a73b50=0, cond=9, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7b61c142=0, NULL=28473, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3442edf9=9, NULL=0, NULL=0, NULL=0, NULL=28472, lk3=0, lk4=0, lk5=0, lk6=0, NULL=0, lk1=0, lk2=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 29]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L27] int cond; Loop: [L29] COND TRUE 1 [L30] cond = __VERIFIER_nondet_int() [L31] COND FALSE !(cond == 0) [L34] lk1 = 0 [L36] lk2 = 0 [L38] lk3 = 0 [L40] lk4 = 0 [L42] lk5 = 0 [L44] lk6 = 0 [L48] COND FALSE !(p1 != 0) [L52] COND FALSE !(p2 != 0) [L56] COND FALSE !(p3 != 0) [L60] COND FALSE !(p4 != 0) [L64] COND FALSE !(p5 != 0) [L68] COND FALSE !(p6 != 0) [L74] COND FALSE !(p1 != 0) [L79] COND FALSE !(p2 != 0) [L84] COND FALSE !(p3 != 0) [L89] COND FALSE !(p4 != 0) [L94] COND FALSE !(p5 != 0) [L99] COND FALSE !(p6 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-10-13 00:53:55,951 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b616d8f-b9ba-49ea-8d40-90bcae1cf3c0/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...