./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_14-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a8a6698-8d16-4cc3-b5e6-534d11c0e0a3/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a8a6698-8d16-4cc3-b5e6-534d11c0e0a3/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_8a8a6698-8d16-4cc3-b5e6-534d11c0e0a3/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a8a6698-8d16-4cc3-b5e6-534d11c0e0a3/bin/uautomizer-WNIpwEf4Nt/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_14-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a8a6698-8d16-4cc3-b5e6-534d11c0e0a3/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_8a8a6698-8d16-4cc3-b5e6-534d11c0e0a3/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 1e59705ae4b9d6434bb0d27311e7a023ef1b3945 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:00:56,209 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 00:00:56,211 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 00:00:56,260 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 00:00:56,262 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 00:00:56,267 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 00:00:56,270 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 00:00:56,274 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 00:00:56,276 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 00:00:56,281 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 00:00:56,283 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 00:00:56,284 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 00:00:56,285 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 00:00:56,288 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 00:00:56,289 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 00:00:56,296 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 00:00:56,298 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 00:00:56,299 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 00:00:56,303 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 00:00:56,311 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 00:00:56,312 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 00:00:56,314 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 00:00:56,317 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 00:00:56,318 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 00:00:56,327 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 00:00:56,327 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 00:00:56,328 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 00:00:56,330 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 00:00:56,331 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 00:00:56,332 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 00:00:56,333 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 00:00:56,334 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 00:00:56,337 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 00:00:56,338 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 00:00:56,340 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 00:00:56,341 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 00:00:56,341 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 00:00:56,341 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 00:00:56,342 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 00:00:56,342 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 00:00:56,343 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 00:00:56,344 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a8a6698-8d16-4cc3-b5e6-534d11c0e0a3/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-10-13 00:00:56,401 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 00:00:56,401 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 00:00:56,401 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-13 00:00:56,402 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-13 00:00:56,403 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 00:00:56,403 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 00:00:56,403 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 00:00:56,403 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-10-13 00:00:56,404 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-10-13 00:00:56,404 INFO L138 SettingsManager]: * Use old map elimination=false [2021-10-13 00:00:56,404 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-10-13 00:00:56,404 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-10-13 00:00:56,404 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-10-13 00:00:56,405 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 00:00:56,405 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 00:00:56,405 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-13 00:00:56,405 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 00:00:56,405 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 00:00:56,406 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 00:00:56,406 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-10-13 00:00:56,406 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-10-13 00:00:56,406 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-10-13 00:00:56,406 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 00:00:56,407 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 00:00:56,407 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-10-13 00:00:56,407 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 00:00:56,407 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-10-13 00:00:56,407 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 00:00:56,408 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 00:00:56,408 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 00:00:56,408 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-13 00:00:56,408 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 00:00:56,409 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-10-13 00:00:56,409 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_8a8a6698-8d16-4cc3-b5e6-534d11c0e0a3/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_8a8a6698-8d16-4cc3-b5e6-534d11c0e0a3/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 -> 1e59705ae4b9d6434bb0d27311e7a023ef1b3945 [2021-10-13 00:00:56,789 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 00:00:56,827 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 00:00:56,829 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 00:00:56,831 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 00:00:56,832 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 00:00:56,833 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a8a6698-8d16-4cc3-b5e6-534d11c0e0a3/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/locks/test_locks_14-1.c [2021-10-13 00:00:56,890 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a8a6698-8d16-4cc3-b5e6-534d11c0e0a3/bin/uautomizer-WNIpwEf4Nt/data/6b5ab326e/fcdb02187cab4c0486518d59ce7ca084/FLAGbb335df3a [2021-10-13 00:00:57,404 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 00:00:57,408 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a8a6698-8d16-4cc3-b5e6-534d11c0e0a3/sv-benchmarks/c/locks/test_locks_14-1.c [2021-10-13 00:00:57,424 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a8a6698-8d16-4cc3-b5e6-534d11c0e0a3/bin/uautomizer-WNIpwEf4Nt/data/6b5ab326e/fcdb02187cab4c0486518d59ce7ca084/FLAGbb335df3a [2021-10-13 00:00:57,751 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a8a6698-8d16-4cc3-b5e6-534d11c0e0a3/bin/uautomizer-WNIpwEf4Nt/data/6b5ab326e/fcdb02187cab4c0486518d59ce7ca084 [2021-10-13 00:00:57,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 00:00:57,755 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 00:00:57,756 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 00:00:57,756 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 00:00:57,760 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 00:00:57,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:00:57" (1/1) ... [2021-10-13 00:00:57,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8591645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:00:57, skipping insertion in model container [2021-10-13 00:00:57,762 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:00:57" (1/1) ... [2021-10-13 00:00:57,768 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 00:00:57,789 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 00:00:58,001 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_8a8a6698-8d16-4cc3-b5e6-534d11c0e0a3/sv-benchmarks/c/locks/test_locks_14-1.c[5283,5296] [2021-10-13 00:00:58,003 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:00:58,011 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 00:00:58,038 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_8a8a6698-8d16-4cc3-b5e6-534d11c0e0a3/sv-benchmarks/c/locks/test_locks_14-1.c[5283,5296] [2021-10-13 00:00:58,040 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:00:58,056 INFO L208 MainTranslator]: Completed translation [2021-10-13 00:00:58,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:00:58 WrapperNode [2021-10-13 00:00:58,056 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 00:00:58,058 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 00:00:58,058 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 00:00:58,058 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 00:00:58,065 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:00:58" (1/1) ... [2021-10-13 00:00:58,073 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:00:58" (1/1) ... [2021-10-13 00:00:58,097 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 00:00:58,097 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 00:00:58,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 00:00:58,098 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 00:00:58,106 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:00:58" (1/1) ... [2021-10-13 00:00:58,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:00:58" (1/1) ... [2021-10-13 00:00:58,108 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:00:58" (1/1) ... [2021-10-13 00:00:58,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:00:58" (1/1) ... [2021-10-13 00:00:58,115 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:00:58" (1/1) ... [2021-10-13 00:00:58,122 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:00:58" (1/1) ... [2021-10-13 00:00:58,124 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:00:58" (1/1) ... [2021-10-13 00:00:58,127 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 00:00:58,128 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 00:00:58,128 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 00:00:58,128 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 00:00:58,129 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:00:58" (1/1) ... [2021-10-13 00:00:58,138 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-13 00:00:58,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a8a6698-8d16-4cc3-b5e6-534d11c0e0a3/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:00:58,188 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a8a6698-8d16-4cc3-b5e6-534d11c0e0a3/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-13 00:00:58,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a8a6698-8d16-4cc3-b5e6-534d11c0e0a3/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-10-13 00:00:58,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 00:00:58,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 00:00:58,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 00:00:58,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 00:00:58,519 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 00:00:58,519 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-10-13 00:00:58,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:00:58 BoogieIcfgContainer [2021-10-13 00:00:58,521 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 00:00:58,522 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-10-13 00:00:58,522 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-10-13 00:00:58,525 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-10-13 00:00:58,526 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-13 00:00:58,526 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.10 12:00:57" (1/3) ... [2021-10-13 00:00:58,528 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5946ca13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 12:00:58, skipping insertion in model container [2021-10-13 00:00:58,528 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-13 00:00:58,528 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:00:58" (2/3) ... [2021-10-13 00:00:58,528 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5946ca13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 12:00:58, skipping insertion in model container [2021-10-13 00:00:58,528 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-13 00:00:58,529 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:00:58" (3/3) ... [2021-10-13 00:00:58,530 INFO L389 chiAutomizerObserver]: Analyzing ICFG test_locks_14-1.c [2021-10-13 00:00:58,586 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-10-13 00:00:58,586 INFO L360 BuchiCegarLoop]: Hoare is false [2021-10-13 00:00:58,586 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-10-13 00:00:58,586 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-13 00:00:58,586 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-13 00:00:58,586 INFO L364 BuchiCegarLoop]: Difference is false [2021-10-13 00:00:58,587 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-13 00:00:58,587 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-10-13 00:00:58,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:00:58,626 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2021-10-13 00:00:58,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:00:58,626 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:00:58,633 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:00:58,633 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:00:58,633 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-10-13 00:00:58,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:00:58,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2021-10-13 00:00:58,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:00:58,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:00:58,643 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:00:58,643 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:00:58,649 INFO L791 eck$LassoCheckResult]: Stem: 42#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 35#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_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~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;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 37#L211-1true [2021-10-13 00:00:58,651 INFO L793 eck$LassoCheckResult]: Loop: 37#L211-1true assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 46#L55true 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;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 22#L88true assume 0 != main_~p1~0;main_~lk1~0 := 1; 12#L88-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 33#L92-1true assume !(0 != main_~p3~0); 4#L96-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 7#L100-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 49#L104-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 13#L108-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 52#L112-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 26#L116-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 40#L120-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 34#L124-1true assume !(0 != main_~p11~0); 16#L128-1true assume 0 != main_~p12~0;main_~lk12~0 := 1; 47#L132-1true assume 0 != main_~p13~0;main_~lk13~0 := 1; 43#L136-1true assume 0 != main_~p14~0;main_~lk14~0 := 1; 39#L140-1true assume !(0 != main_~p1~0); 17#L146-1true assume !(0 != main_~p2~0); 31#L151-1true assume !(0 != main_~p3~0); 29#L156-1true assume !(0 != main_~p4~0); 5#L161-1true assume !(0 != main_~p5~0); 11#L166-1true assume !(0 != main_~p6~0); 24#L171-1true assume !(0 != main_~p7~0); 20#L176-1true assume !(0 != main_~p8~0); 50#L181-1true assume !(0 != main_~p9~0); 21#L186-1true assume !(0 != main_~p10~0); 38#L191-1true assume !(0 != main_~p11~0); 51#L196-1true assume !(0 != main_~p12~0); 25#L201-1true assume !(0 != main_~p13~0); 14#L206-1true assume !(0 != main_~p14~0); 37#L211-1true [2021-10-13 00:00:58,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:00:58,656 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-10-13 00:00:58,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:00:58,665 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110374799] [2021-10-13 00:00:58,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:00:58,683 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:00:58,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:00:58,849 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:00:58,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:00:58,913 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:00:58,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:00:58,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1221430905, now seen corresponding path program 1 times [2021-10-13 00:00:58,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:00:58,919 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748985476] [2021-10-13 00:00:58,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:00:58,919 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:00:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:00:59,053 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:00:59,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:00:59,054 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748985476] [2021-10-13 00:00:59,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748985476] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:00:59,056 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:00:59,056 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:00:59,056 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548869218] [2021-10-13 00:00:59,074 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:00:59,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:00:59,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:00:59,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:00:59,103 INFO L87 Difference]: Start difference. First operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:00:59,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:00:59,165 INFO L93 Difference]: Finished difference Result 99 states and 178 transitions. [2021-10-13 00:00:59,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:00:59,168 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 178 transitions. [2021-10-13 00:00:59,184 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2021-10-13 00:00:59,189 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 89 states and 143 transitions. [2021-10-13 00:00:59,190 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2021-10-13 00:00:59,191 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2021-10-13 00:00:59,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 143 transitions. [2021-10-13 00:00:59,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:00:59,193 INFO L681 BuchiCegarLoop]: Abstraction has 89 states and 143 transitions. [2021-10-13 00:00:59,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 143 transitions. [2021-10-13 00:00:59,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-10-13 00:00:59,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.6067415730337078) internal successors, (143), 88 states have internal predecessors, (143), 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:00:59,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 143 transitions. [2021-10-13 00:00:59,243 INFO L704 BuchiCegarLoop]: Abstraction has 89 states and 143 transitions. [2021-10-13 00:00:59,243 INFO L587 BuchiCegarLoop]: Abstraction has 89 states and 143 transitions. [2021-10-13 00:00:59,243 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-10-13 00:00:59,244 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 143 transitions. [2021-10-13 00:00:59,251 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2021-10-13 00:00:59,251 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:00:59,252 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:00:59,253 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:00:59,253 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:00:59,253 INFO L791 eck$LassoCheckResult]: Stem: 190#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 174#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_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~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;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 168#L211-1 [2021-10-13 00:00:59,254 INFO L793 eck$LassoCheckResult]: Loop: 168#L211-1 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 179#L55 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;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 202#L88 assume !(0 != main_~p1~0); 221#L88-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 220#L92-1 assume !(0 != main_~p3~0); 219#L96-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 218#L100-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 208#L104-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 185#L108-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 186#L112-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 205#L116-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 183#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 172#L124-1 assume !(0 != main_~p11~0); 173#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 192#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 213#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 211#L140-1 assume !(0 != main_~p1~0); 212#L146-1 assume !(0 != main_~p2~0); 246#L151-1 assume !(0 != main_~p3~0); 244#L156-1 assume !(0 != main_~p4~0); 242#L161-1 assume !(0 != main_~p5~0); 240#L166-1 assume !(0 != main_~p6~0); 237#L171-1 assume !(0 != main_~p7~0); 236#L176-1 assume !(0 != main_~p8~0); 207#L181-1 assume !(0 != main_~p9~0); 194#L186-1 assume !(0 != main_~p10~0); 180#L191-1 assume !(0 != main_~p11~0); 176#L196-1 assume !(0 != main_~p12~0); 189#L201-1 assume !(0 != main_~p13~0); 166#L206-1 assume !(0 != main_~p14~0); 168#L211-1 [2021-10-13 00:00:59,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:00:59,255 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-10-13 00:00:59,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:00:59,256 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351176383] [2021-10-13 00:00:59,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:00:59,256 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:00:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:00:59,284 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:00:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:00:59,320 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:00:59,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:00:59,323 INFO L82 PathProgramCache]: Analyzing trace with hash 711957815, now seen corresponding path program 1 times [2021-10-13 00:00:59,323 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:00:59,323 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005408228] [2021-10-13 00:00:59,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:00:59,324 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:00:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:00:59,373 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:00:59,373 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:00:59,374 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005408228] [2021-10-13 00:00:59,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005408228] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:00:59,374 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:00:59,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:00:59,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301119958] [2021-10-13 00:00:59,375 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:00:59,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:00:59,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:00:59,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:00:59,376 INFO L87 Difference]: Start difference. First operand 89 states and 143 transitions. cyclomatic complexity: 56 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:00:59,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:00:59,399 INFO L93 Difference]: Finished difference Result 174 states and 278 transitions. [2021-10-13 00:00:59,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:00:59,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 278 transitions. [2021-10-13 00:00:59,403 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2021-10-13 00:00:59,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 174 states and 278 transitions. [2021-10-13 00:00:59,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2021-10-13 00:00:59,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2021-10-13 00:00:59,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 278 transitions. [2021-10-13 00:00:59,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:00:59,408 INFO L681 BuchiCegarLoop]: Abstraction has 174 states and 278 transitions. [2021-10-13 00:00:59,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 278 transitions. [2021-10-13 00:00:59,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2021-10-13 00:00:59,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 174 states have (on average 1.5977011494252873) internal successors, (278), 173 states have internal predecessors, (278), 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:00:59,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 278 transitions. [2021-10-13 00:00:59,439 INFO L704 BuchiCegarLoop]: Abstraction has 174 states and 278 transitions. [2021-10-13 00:00:59,439 INFO L587 BuchiCegarLoop]: Abstraction has 174 states and 278 transitions. [2021-10-13 00:00:59,439 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-10-13 00:00:59,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 278 transitions. [2021-10-13 00:00:59,441 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2021-10-13 00:00:59,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:00:59,441 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:00:59,442 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:00:59,442 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:00:59,442 INFO L791 eck$LassoCheckResult]: Stem: 465#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 444#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_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~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;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 445#L211-1 [2021-10-13 00:00:59,443 INFO L793 eck$LassoCheckResult]: Loop: 445#L211-1 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 527#L55 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;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 525#L88 assume !(0 != main_~p1~0); 522#L88-2 assume !(0 != main_~p2~0); 517#L92-1 assume !(0 != main_~p3~0); 516#L96-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 514#L100-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 512#L104-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 511#L108-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 510#L112-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 509#L116-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 508#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 507#L124-1 assume !(0 != main_~p11~0); 506#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 505#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 489#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 490#L140-1 assume !(0 != main_~p1~0); 499#L146-1 assume !(0 != main_~p2~0); 501#L151-1 assume !(0 != main_~p3~0); 550#L156-1 assume !(0 != main_~p4~0); 548#L161-1 assume !(0 != main_~p5~0); 546#L166-1 assume !(0 != main_~p6~0); 543#L171-1 assume !(0 != main_~p7~0); 542#L176-1 assume !(0 != main_~p8~0); 540#L181-1 assume !(0 != main_~p9~0); 537#L186-1 assume !(0 != main_~p10~0); 536#L191-1 assume !(0 != main_~p11~0); 534#L196-1 assume !(0 != main_~p12~0); 532#L201-1 assume !(0 != main_~p13~0); 530#L206-1 assume !(0 != main_~p14~0); 445#L211-1 [2021-10-13 00:00:59,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:00:59,443 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-10-13 00:00:59,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:00:59,444 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955330794] [2021-10-13 00:00:59,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:00:59,450 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:00:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:00:59,481 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:00:59,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:00:59,508 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:00:59,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:00:59,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1659781447, now seen corresponding path program 1 times [2021-10-13 00:00:59,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:00:59,509 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200062809] [2021-10-13 00:00:59,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:00:59,509 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:00:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:00:59,576 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:00:59,576 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:00:59,577 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200062809] [2021-10-13 00:00:59,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200062809] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:00:59,577 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:00:59,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:00:59,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057785687] [2021-10-13 00:00:59,578 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:00:59,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:00:59,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:00:59,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:00:59,579 INFO L87 Difference]: Start difference. First operand 174 states and 278 transitions. cyclomatic complexity: 108 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:00:59,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:00:59,610 INFO L93 Difference]: Finished difference Result 342 states and 542 transitions. [2021-10-13 00:00:59,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:00:59,611 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 342 states and 542 transitions. [2021-10-13 00:00:59,617 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2021-10-13 00:00:59,625 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 342 states to 342 states and 542 transitions. [2021-10-13 00:00:59,625 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 342 [2021-10-13 00:00:59,628 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 342 [2021-10-13 00:00:59,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 342 states and 542 transitions. [2021-10-13 00:00:59,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:00:59,635 INFO L681 BuchiCegarLoop]: Abstraction has 342 states and 542 transitions. [2021-10-13 00:00:59,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states and 542 transitions. [2021-10-13 00:00:59,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2021-10-13 00:00:59,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 342 states have (on average 1.5847953216374269) internal successors, (542), 341 states have internal predecessors, (542), 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:00:59,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 542 transitions. [2021-10-13 00:00:59,667 INFO L704 BuchiCegarLoop]: Abstraction has 342 states and 542 transitions. [2021-10-13 00:00:59,667 INFO L587 BuchiCegarLoop]: Abstraction has 342 states and 542 transitions. [2021-10-13 00:00:59,667 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-10-13 00:00:59,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 342 states and 542 transitions. [2021-10-13 00:00:59,670 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2021-10-13 00:00:59,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:00:59,670 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:00:59,671 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:00:59,671 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:00:59,671 INFO L791 eck$LassoCheckResult]: Stem: 983#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 967#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_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~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;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 968#L211-1 [2021-10-13 00:00:59,671 INFO L793 eck$LassoCheckResult]: Loop: 968#L211-1 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 1027#L55 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;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 1022#L88 assume !(0 != main_~p1~0); 1023#L88-2 assume !(0 != main_~p2~0); 1152#L92-1 assume !(0 != main_~p3~0); 1149#L96-1 assume !(0 != main_~p4~0); 1147#L100-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 1145#L104-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1143#L108-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1141#L112-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1139#L116-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1137#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1135#L124-1 assume !(0 != main_~p11~0); 1133#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 1131#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 1129#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 1125#L140-1 assume !(0 != main_~p1~0); 1123#L146-1 assume !(0 != main_~p2~0); 1121#L151-1 assume !(0 != main_~p3~0); 1116#L156-1 assume !(0 != main_~p4~0); 1114#L161-1 assume !(0 != main_~p5~0); 1108#L166-1 assume !(0 != main_~p6~0); 1103#L171-1 assume !(0 != main_~p7~0); 1100#L176-1 assume !(0 != main_~p8~0); 1098#L181-1 assume !(0 != main_~p9~0); 1095#L186-1 assume !(0 != main_~p10~0); 1092#L191-1 assume !(0 != main_~p11~0); 1088#L196-1 assume !(0 != main_~p12~0); 1068#L201-1 assume !(0 != main_~p13~0); 1038#L206-1 assume !(0 != main_~p14~0); 968#L211-1 [2021-10-13 00:00:59,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:00:59,672 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-10-13 00:00:59,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:00:59,672 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038653161] [2021-10-13 00:00:59,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:00:59,673 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:00:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:00:59,681 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:00:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:00:59,697 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:00:59,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:00:59,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1519232837, now seen corresponding path program 1 times [2021-10-13 00:00:59,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:00:59,699 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473250548] [2021-10-13 00:00:59,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:00:59,699 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:00:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:00:59,749 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:00:59,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:00:59,750 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473250548] [2021-10-13 00:00:59,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473250548] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:00:59,751 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:00:59,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:00:59,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009312787] [2021-10-13 00:00:59,752 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:00:59,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:00:59,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:00:59,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:00:59,753 INFO L87 Difference]: Start difference. First operand 342 states and 542 transitions. cyclomatic complexity: 208 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:00:59,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:00:59,771 INFO L93 Difference]: Finished difference Result 674 states and 1058 transitions. [2021-10-13 00:00:59,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:00:59,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 674 states and 1058 transitions. [2021-10-13 00:00:59,779 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2021-10-13 00:00:59,785 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 674 states to 674 states and 1058 transitions. [2021-10-13 00:00:59,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 674 [2021-10-13 00:00:59,786 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 674 [2021-10-13 00:00:59,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 674 states and 1058 transitions. [2021-10-13 00:00:59,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:00:59,789 INFO L681 BuchiCegarLoop]: Abstraction has 674 states and 1058 transitions. [2021-10-13 00:00:59,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states and 1058 transitions. [2021-10-13 00:00:59,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2021-10-13 00:00:59,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 674 states have (on average 1.5697329376854599) internal successors, (1058), 673 states have internal predecessors, (1058), 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:00:59,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1058 transitions. [2021-10-13 00:00:59,814 INFO L704 BuchiCegarLoop]: Abstraction has 674 states and 1058 transitions. [2021-10-13 00:00:59,814 INFO L587 BuchiCegarLoop]: Abstraction has 674 states and 1058 transitions. [2021-10-13 00:00:59,814 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-10-13 00:00:59,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 674 states and 1058 transitions. [2021-10-13 00:00:59,819 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2021-10-13 00:00:59,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:00:59,819 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:00:59,820 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:00:59,820 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:00:59,820 INFO L791 eck$LassoCheckResult]: Stem: 2005#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1986#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_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~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;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 1987#L211-1 [2021-10-13 00:00:59,820 INFO L793 eck$LassoCheckResult]: Loop: 1987#L211-1 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 2105#L55 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;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 2103#L88 assume !(0 != main_~p1~0); 2104#L88-2 assume !(0 != main_~p2~0); 2147#L92-1 assume !(0 != main_~p3~0); 2145#L96-1 assume !(0 != main_~p4~0); 2143#L100-1 assume !(0 != main_~p5~0); 2142#L104-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 2141#L108-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2140#L112-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2139#L116-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 2138#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 2137#L124-1 assume !(0 != main_~p11~0); 2136#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 2135#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 2134#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 2132#L140-1 assume !(0 != main_~p1~0); 2130#L146-1 assume !(0 != main_~p2~0); 2129#L151-1 assume !(0 != main_~p3~0); 2126#L156-1 assume !(0 != main_~p4~0); 2124#L161-1 assume !(0 != main_~p5~0); 2123#L166-1 assume !(0 != main_~p6~0); 2120#L171-1 assume !(0 != main_~p7~0); 2119#L176-1 assume !(0 != main_~p8~0); 2117#L181-1 assume !(0 != main_~p9~0); 2114#L186-1 assume !(0 != main_~p10~0); 2113#L191-1 assume !(0 != main_~p11~0); 2111#L196-1 assume !(0 != main_~p12~0); 2109#L201-1 assume !(0 != main_~p13~0); 2107#L206-1 assume !(0 != main_~p14~0); 1987#L211-1 [2021-10-13 00:00:59,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:00:59,821 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-10-13 00:00:59,821 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:00:59,822 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592029488] [2021-10-13 00:00:59,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:00:59,822 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:00:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:00:59,829 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:00:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:00:59,839 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:00:59,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:00:59,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1653246343, now seen corresponding path program 1 times [2021-10-13 00:00:59,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:00:59,840 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541991309] [2021-10-13 00:00:59,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:00:59,841 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:00:59,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:00:59,866 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:00:59,866 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:00:59,866 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541991309] [2021-10-13 00:00:59,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541991309] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:00:59,867 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:00:59,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:00:59,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171963603] [2021-10-13 00:00:59,868 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:00:59,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:00:59,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:00:59,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:00:59,869 INFO L87 Difference]: Start difference. First operand 674 states and 1058 transitions. cyclomatic complexity: 400 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:00:59,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:00:59,889 INFO L93 Difference]: Finished difference Result 1330 states and 2066 transitions. [2021-10-13 00:00:59,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:00:59,890 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1330 states and 2066 transitions. [2021-10-13 00:00:59,902 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2021-10-13 00:00:59,914 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1330 states to 1330 states and 2066 transitions. [2021-10-13 00:00:59,914 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1330 [2021-10-13 00:00:59,916 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1330 [2021-10-13 00:00:59,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1330 states and 2066 transitions. [2021-10-13 00:00:59,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:00:59,919 INFO L681 BuchiCegarLoop]: Abstraction has 1330 states and 2066 transitions. [2021-10-13 00:00:59,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states and 2066 transitions. [2021-10-13 00:00:59,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1330. [2021-10-13 00:00:59,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 1330 states have (on average 1.5533834586466166) internal successors, (2066), 1329 states have internal predecessors, (2066), 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:00:59,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 2066 transitions. [2021-10-13 00:00:59,981 INFO L704 BuchiCegarLoop]: Abstraction has 1330 states and 2066 transitions. [2021-10-13 00:00:59,981 INFO L587 BuchiCegarLoop]: Abstraction has 1330 states and 2066 transitions. [2021-10-13 00:00:59,982 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-10-13 00:00:59,982 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1330 states and 2066 transitions. [2021-10-13 00:00:59,997 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2021-10-13 00:00:59,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:00:59,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:01:00,001 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:01:00,001 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:01:00,001 INFO L791 eck$LassoCheckResult]: Stem: 4017#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 3996#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_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~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;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 3997#L211-1 [2021-10-13 00:01:00,001 INFO L793 eck$LassoCheckResult]: Loop: 3997#L211-1 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 4074#L55 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;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 4061#L88 assume !(0 != main_~p1~0); 4054#L88-2 assume !(0 != main_~p2~0); 4055#L92-1 assume !(0 != main_~p3~0); 4048#L96-1 assume !(0 != main_~p4~0); 4050#L100-1 assume !(0 != main_~p5~0); 4187#L104-1 assume !(0 != main_~p6~0); 4189#L108-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 4179#L112-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 4180#L116-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 4171#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 4172#L124-1 assume !(0 != main_~p11~0); 4163#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 4164#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 4155#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 4156#L140-1 assume !(0 != main_~p1~0); 4355#L146-1 assume !(0 != main_~p2~0); 4353#L151-1 assume !(0 != main_~p3~0); 4348#L156-1 assume !(0 != main_~p4~0); 4346#L161-1 assume !(0 != main_~p5~0); 4345#L166-1 assume !(0 != main_~p6~0); 4342#L171-1 assume !(0 != main_~p7~0); 4341#L176-1 assume !(0 != main_~p8~0); 4338#L181-1 assume !(0 != main_~p9~0); 4335#L186-1 assume !(0 != main_~p10~0); 4317#L191-1 assume !(0 != main_~p11~0); 4289#L196-1 assume !(0 != main_~p12~0); 4288#L201-1 assume !(0 != main_~p13~0); 4292#L206-1 assume !(0 != main_~p14~0); 3997#L211-1 [2021-10-13 00:01:00,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:01:00,003 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-10-13 00:01:00,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:01:00,003 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212872161] [2021-10-13 00:01:00,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:01:00,004 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:01:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:01:00,017 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:01:00,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:01:00,040 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:01:00,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:01:00,045 INFO L82 PathProgramCache]: Analyzing trace with hash 836282619, now seen corresponding path program 1 times [2021-10-13 00:01:00,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:01:00,046 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134400026] [2021-10-13 00:01:00,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:01:00,047 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:01:00,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:01:00,088 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:01:00,088 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:01:00,089 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134400026] [2021-10-13 00:01:00,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134400026] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:01:00,090 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:01:00,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:01:00,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279986345] [2021-10-13 00:01:00,091 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:01:00,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:01:00,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:01:00,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:01:00,094 INFO L87 Difference]: Start difference. First operand 1330 states and 2066 transitions. cyclomatic complexity: 768 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:01:00,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:01:00,125 INFO L93 Difference]: Finished difference Result 2626 states and 4034 transitions. [2021-10-13 00:01:00,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:01:00,126 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2626 states and 4034 transitions. [2021-10-13 00:01:00,166 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2021-10-13 00:01:00,189 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2626 states to 2626 states and 4034 transitions. [2021-10-13 00:01:00,190 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2626 [2021-10-13 00:01:00,192 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2626 [2021-10-13 00:01:00,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2626 states and 4034 transitions. [2021-10-13 00:01:00,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:01:00,198 INFO L681 BuchiCegarLoop]: Abstraction has 2626 states and 4034 transitions. [2021-10-13 00:01:00,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2626 states and 4034 transitions. [2021-10-13 00:01:00,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2626 to 2626. [2021-10-13 00:01:00,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2626 states, 2626 states have (on average 1.5361766945925361) internal successors, (4034), 2625 states have internal predecessors, (4034), 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:01:00,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 4034 transitions. [2021-10-13 00:01:00,263 INFO L704 BuchiCegarLoop]: Abstraction has 2626 states and 4034 transitions. [2021-10-13 00:01:00,263 INFO L587 BuchiCegarLoop]: Abstraction has 2626 states and 4034 transitions. [2021-10-13 00:01:00,263 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-10-13 00:01:00,263 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2626 states and 4034 transitions. [2021-10-13 00:01:00,281 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2021-10-13 00:01:00,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:01:00,282 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:01:00,282 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:01:00,282 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:01:00,283 INFO L791 eck$LassoCheckResult]: Stem: 7974#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 7958#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_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~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;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 7959#L211-1 [2021-10-13 00:01:00,283 INFO L793 eck$LassoCheckResult]: Loop: 7959#L211-1 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 8097#L55 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;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 8093#L88 assume !(0 != main_~p1~0); 8086#L88-2 assume !(0 != main_~p2~0); 8081#L92-1 assume !(0 != main_~p3~0); 8074#L96-1 assume !(0 != main_~p4~0); 8066#L100-1 assume !(0 != main_~p5~0); 8058#L104-1 assume !(0 != main_~p6~0); 8052#L108-1 assume !(0 != main_~p7~0); 8047#L112-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 8048#L116-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 8041#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 8042#L124-1 assume !(0 != main_~p11~0); 8035#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 8036#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 8028#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 8029#L140-1 assume !(0 != main_~p1~0); 8194#L146-1 assume !(0 != main_~p2~0); 8174#L151-1 assume !(0 != main_~p3~0); 8168#L156-1 assume !(0 != main_~p4~0); 8163#L161-1 assume !(0 != main_~p5~0); 8159#L166-1 assume !(0 != main_~p6~0); 8157#L171-1 assume !(0 != main_~p7~0); 8156#L176-1 assume !(0 != main_~p8~0); 8154#L181-1 assume !(0 != main_~p9~0); 8141#L186-1 assume !(0 != main_~p10~0); 8122#L191-1 assume !(0 != main_~p11~0); 8118#L196-1 assume !(0 != main_~p12~0); 8116#L201-1 assume !(0 != main_~p13~0); 8106#L206-1 assume !(0 != main_~p14~0); 7959#L211-1 [2021-10-13 00:01:00,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:01:00,284 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2021-10-13 00:01:00,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:01:00,284 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098741294] [2021-10-13 00:01:00,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:01:00,285 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:01:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:01:00,291 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:01:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:01:00,299 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:01:00,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:01:00,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1055137337, now seen corresponding path program 1 times [2021-10-13 00:01:00,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:01:00,301 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509110389] [2021-10-13 00:01:00,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:01:00,301 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:01:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:01:00,356 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:01:00,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:01:00,357 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509110389] [2021-10-13 00:01:00,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509110389] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:01:00,357 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:01:00,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:01:00,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547862097] [2021-10-13 00:01:00,358 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:01:00,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:01:00,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:01:00,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:01:00,359 INFO L87 Difference]: Start difference. First operand 2626 states and 4034 transitions. cyclomatic complexity: 1472 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:01:00,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:01:00,401 INFO L93 Difference]: Finished difference Result 5186 states and 7874 transitions. [2021-10-13 00:01:00,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:01:00,402 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5186 states and 7874 transitions. [2021-10-13 00:01:00,461 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2021-10-13 00:01:00,508 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5186 states to 5186 states and 7874 transitions. [2021-10-13 00:01:00,508 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5186 [2021-10-13 00:01:00,514 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5186 [2021-10-13 00:01:00,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5186 states and 7874 transitions. [2021-10-13 00:01:00,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:01:00,524 INFO L681 BuchiCegarLoop]: Abstraction has 5186 states and 7874 transitions. [2021-10-13 00:01:00,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5186 states and 7874 transitions. [2021-10-13 00:01:00,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5186 to 5186. [2021-10-13 00:01:00,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5186 states, 5186 states have (on average 1.5183185499421519) internal successors, (7874), 5185 states have internal predecessors, (7874), 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:01:00,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5186 states to 5186 states and 7874 transitions. [2021-10-13 00:01:00,687 INFO L704 BuchiCegarLoop]: Abstraction has 5186 states and 7874 transitions. [2021-10-13 00:01:00,688 INFO L587 BuchiCegarLoop]: Abstraction has 5186 states and 7874 transitions. [2021-10-13 00:01:00,688 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-10-13 00:01:00,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5186 states and 7874 transitions. [2021-10-13 00:01:00,721 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2021-10-13 00:01:00,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:01:00,721 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:01:00,724 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:01:00,724 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:01:00,725 INFO L791 eck$LassoCheckResult]: Stem: 15796#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 15777#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_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~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;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 15778#L211-1 [2021-10-13 00:01:00,725 INFO L793 eck$LassoCheckResult]: Loop: 15778#L211-1 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 16332#L55 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;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 16329#L88 assume !(0 != main_~p1~0); 16326#L88-2 assume !(0 != main_~p2~0); 16324#L92-1 assume !(0 != main_~p3~0); 16321#L96-1 assume !(0 != main_~p4~0); 16317#L100-1 assume !(0 != main_~p5~0); 16314#L104-1 assume !(0 != main_~p6~0); 16311#L108-1 assume !(0 != main_~p7~0); 16140#L112-1 assume !(0 != main_~p8~0); 16142#L116-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 16090#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 16091#L124-1 assume !(0 != main_~p11~0); 16082#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 16083#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 16481#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 16477#L140-1 assume !(0 != main_~p1~0); 16066#L146-1 assume !(0 != main_~p2~0); 16068#L151-1 assume !(0 != main_~p3~0); 16057#L156-1 assume !(0 != main_~p4~0); 16059#L161-1 assume !(0 != main_~p5~0); 16363#L166-1 assume !(0 != main_~p6~0); 16361#L171-1 assume !(0 != main_~p7~0); 16359#L176-1 assume !(0 != main_~p8~0); 16357#L181-1 assume !(0 != main_~p9~0); 16352#L186-1 assume !(0 != main_~p10~0); 16349#L191-1 assume !(0 != main_~p11~0); 16345#L196-1 assume !(0 != main_~p12~0); 16341#L201-1 assume !(0 != main_~p13~0); 16337#L206-1 assume !(0 != main_~p14~0); 15778#L211-1 [2021-10-13 00:01:00,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:01:00,726 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2021-10-13 00:01:00,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:01:00,726 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121240424] [2021-10-13 00:01:00,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:01:00,727 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:01:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:01:00,745 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:01:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:01:00,762 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:01:00,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:01:00,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1477839163, now seen corresponding path program 1 times [2021-10-13 00:01:00,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:01:00,770 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346384919] [2021-10-13 00:01:00,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:01:00,771 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:01:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:01:00,794 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:01:00,794 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:01:00,794 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346384919] [2021-10-13 00:01:00,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346384919] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:01:00,800 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:01:00,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:01:00,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107788353] [2021-10-13 00:01:00,803 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:01:00,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:01:00,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:01:00,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:01:00,804 INFO L87 Difference]: Start difference. First operand 5186 states and 7874 transitions. cyclomatic complexity: 2816 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:01:00,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:01:00,877 INFO L93 Difference]: Finished difference Result 10242 states and 15362 transitions. [2021-10-13 00:01:00,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:01:00,877 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10242 states and 15362 transitions. [2021-10-13 00:01:01,038 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2021-10-13 00:01:01,122 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10242 states to 10242 states and 15362 transitions. [2021-10-13 00:01:01,122 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10242 [2021-10-13 00:01:01,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10242 [2021-10-13 00:01:01,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10242 states and 15362 transitions. [2021-10-13 00:01:01,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:01:01,148 INFO L681 BuchiCegarLoop]: Abstraction has 10242 states and 15362 transitions. [2021-10-13 00:01:01,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10242 states and 15362 transitions. [2021-10-13 00:01:01,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10242 to 10242. [2021-10-13 00:01:01,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10242 states, 10242 states have (on average 1.4999023628197619) internal successors, (15362), 10241 states have internal predecessors, (15362), 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:01:01,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10242 states to 10242 states and 15362 transitions. [2021-10-13 00:01:01,570 INFO L704 BuchiCegarLoop]: Abstraction has 10242 states and 15362 transitions. [2021-10-13 00:01:01,570 INFO L587 BuchiCegarLoop]: Abstraction has 10242 states and 15362 transitions. [2021-10-13 00:01:01,570 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-10-13 00:01:01,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10242 states and 15362 transitions. [2021-10-13 00:01:01,615 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2021-10-13 00:01:01,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:01:01,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:01:01,616 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:01:01,616 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:01:01,616 INFO L791 eck$LassoCheckResult]: Stem: 31228#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 31211#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_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~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;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 31212#L211-1 [2021-10-13 00:01:01,618 INFO L793 eck$LassoCheckResult]: Loop: 31212#L211-1 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 31931#L55 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;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 31927#L88 assume !(0 != main_~p1~0); 31923#L88-2 assume !(0 != main_~p2~0); 31921#L92-1 assume !(0 != main_~p3~0); 31917#L96-1 assume !(0 != main_~p4~0); 31913#L100-1 assume !(0 != main_~p5~0); 31910#L104-1 assume !(0 != main_~p6~0); 31911#L108-1 assume !(0 != main_~p7~0); 31996#L112-1 assume !(0 != main_~p8~0); 31993#L116-1 assume !(0 != main_~p9~0); 31991#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 31989#L124-1 assume !(0 != main_~p11~0); 31987#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 31985#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 31982#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 31978#L140-1 assume !(0 != main_~p1~0); 31974#L146-1 assume !(0 != main_~p2~0); 31972#L151-1 assume !(0 != main_~p3~0); 31968#L156-1 assume !(0 != main_~p4~0); 31965#L161-1 assume !(0 != main_~p5~0); 31964#L166-1 assume !(0 != main_~p6~0); 31962#L171-1 assume !(0 != main_~p7~0); 31958#L176-1 assume !(0 != main_~p8~0); 31954#L181-1 assume !(0 != main_~p9~0); 31950#L186-1 assume !(0 != main_~p10~0); 31947#L191-1 assume !(0 != main_~p11~0); 31943#L196-1 assume !(0 != main_~p12~0); 31939#L201-1 assume !(0 != main_~p13~0); 31935#L206-1 assume !(0 != main_~p14~0); 31212#L211-1 [2021-10-13 00:01:01,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:01:01,619 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2021-10-13 00:01:01,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:01:01,619 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949197431] [2021-10-13 00:01:01,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:01:01,619 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:01:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:01:01,628 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:01:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:01:01,638 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:01:01,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:01:01,639 INFO L82 PathProgramCache]: Analyzing trace with hash 660190713, now seen corresponding path program 1 times [2021-10-13 00:01:01,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:01:01,640 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839711373] [2021-10-13 00:01:01,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:01:01,640 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:01:01,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:01:01,671 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:01:01,671 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:01:01,671 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839711373] [2021-10-13 00:01:01,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839711373] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:01:01,672 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:01:01,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:01:01,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637233178] [2021-10-13 00:01:01,673 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:01:01,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:01:01,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:01:01,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:01:01,676 INFO L87 Difference]: Start difference. First operand 10242 states and 15362 transitions. cyclomatic complexity: 5376 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:01:01,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:01:01,862 INFO L93 Difference]: Finished difference Result 20226 states and 29954 transitions. [2021-10-13 00:01:01,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:01:01,863 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20226 states and 29954 transitions. [2021-10-13 00:01:01,983 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224 [2021-10-13 00:01:02,136 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20226 states to 20226 states and 29954 transitions. [2021-10-13 00:01:02,136 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20226 [2021-10-13 00:01:02,145 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20226 [2021-10-13 00:01:02,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20226 states and 29954 transitions. [2021-10-13 00:01:02,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:01:02,170 INFO L681 BuchiCegarLoop]: Abstraction has 20226 states and 29954 transitions. [2021-10-13 00:01:02,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20226 states and 29954 transitions. [2021-10-13 00:01:02,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20226 to 20226. [2021-10-13 00:01:02,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20226 states, 20226 states have (on average 1.4809650944329082) internal successors, (29954), 20225 states have internal predecessors, (29954), 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:01:02,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20226 states to 20226 states and 29954 transitions. [2021-10-13 00:01:02,599 INFO L704 BuchiCegarLoop]: Abstraction has 20226 states and 29954 transitions. [2021-10-13 00:01:02,599 INFO L587 BuchiCegarLoop]: Abstraction has 20226 states and 29954 transitions. [2021-10-13 00:01:02,599 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-10-13 00:01:02,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20226 states and 29954 transitions. [2021-10-13 00:01:02,673 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224 [2021-10-13 00:01:02,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:01:02,674 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:01:02,674 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:01:02,675 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:01:02,675 INFO L791 eck$LassoCheckResult]: Stem: 61703#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 61684#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_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~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;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 61685#L211-1 [2021-10-13 00:01:02,675 INFO L793 eck$LassoCheckResult]: Loop: 61685#L211-1 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 62023#L55 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;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 62020#L88 assume !(0 != main_~p1~0); 62016#L88-2 assume !(0 != main_~p2~0); 62013#L92-1 assume !(0 != main_~p3~0); 62010#L96-1 assume !(0 != main_~p4~0); 62006#L100-1 assume !(0 != main_~p5~0); 62002#L104-1 assume !(0 != main_~p6~0); 61995#L108-1 assume !(0 != main_~p7~0); 61996#L112-1 assume !(0 != main_~p8~0); 62085#L116-1 assume !(0 != main_~p9~0); 62081#L120-1 assume !(0 != main_~p10~0); 62079#L124-1 assume !(0 != main_~p11~0); 62077#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 62075#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 62073#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 62069#L140-1 assume !(0 != main_~p1~0); 62065#L146-1 assume !(0 != main_~p2~0); 62062#L151-1 assume !(0 != main_~p3~0); 62057#L156-1 assume !(0 != main_~p4~0); 62053#L161-1 assume !(0 != main_~p5~0); 62049#L166-1 assume !(0 != main_~p6~0); 62047#L171-1 assume !(0 != main_~p7~0); 62045#L176-1 assume !(0 != main_~p8~0); 62043#L181-1 assume !(0 != main_~p9~0); 62041#L186-1 assume !(0 != main_~p10~0); 62040#L191-1 assume !(0 != main_~p11~0); 62036#L196-1 assume !(0 != main_~p12~0); 62032#L201-1 assume !(0 != main_~p13~0); 62028#L206-1 assume !(0 != main_~p14~0); 61685#L211-1 [2021-10-13 00:01:02,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:01:02,675 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2021-10-13 00:01:02,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:01:02,676 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271696836] [2021-10-13 00:01:02,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:01:02,676 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:01:02,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:01:02,683 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:01:02,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:01:02,691 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:01:02,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:01:02,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1028753029, now seen corresponding path program 1 times [2021-10-13 00:01:02,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:01:02,692 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868206202] [2021-10-13 00:01:02,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:01:02,692 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:01:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:01:02,715 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:01:02,715 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:01:02,716 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868206202] [2021-10-13 00:01:02,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868206202] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:01:02,717 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:01:02,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:01:02,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210492348] [2021-10-13 00:01:02,717 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:01:02,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:01:02,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:01:02,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:01:02,719 INFO L87 Difference]: Start difference. First operand 20226 states and 29954 transitions. cyclomatic complexity: 10240 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:01:02,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:01:02,990 INFO L93 Difference]: Finished difference Result 39938 states and 58370 transitions. [2021-10-13 00:01:02,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:01:02,990 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39938 states and 58370 transitions. [2021-10-13 00:01:03,322 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936 [2021-10-13 00:01:03,476 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39938 states to 39938 states and 58370 transitions. [2021-10-13 00:01:03,476 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39938 [2021-10-13 00:01:03,501 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39938 [2021-10-13 00:01:03,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39938 states and 58370 transitions. [2021-10-13 00:01:03,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:01:03,526 INFO L681 BuchiCegarLoop]: Abstraction has 39938 states and 58370 transitions. [2021-10-13 00:01:03,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39938 states and 58370 transitions. [2021-10-13 00:01:04,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39938 to 39938. [2021-10-13 00:01:04,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39938 states, 39938 states have (on average 1.4615153487906254) internal successors, (58370), 39937 states have internal predecessors, (58370), 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:01:04,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39938 states to 39938 states and 58370 transitions. [2021-10-13 00:01:04,269 INFO L704 BuchiCegarLoop]: Abstraction has 39938 states and 58370 transitions. [2021-10-13 00:01:04,269 INFO L587 BuchiCegarLoop]: Abstraction has 39938 states and 58370 transitions. [2021-10-13 00:01:04,270 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-10-13 00:01:04,270 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39938 states and 58370 transitions. [2021-10-13 00:01:04,395 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936 [2021-10-13 00:01:04,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:01:04,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:01:04,396 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:01:04,396 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:01:04,396 INFO L791 eck$LassoCheckResult]: Stem: 121875#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 121856#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_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~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;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 121857#L211-1 [2021-10-13 00:01:04,396 INFO L793 eck$LassoCheckResult]: Loop: 121857#L211-1 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 122012#L55 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;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 122010#L88 assume !(0 != main_~p1~0); 122006#L88-2 assume !(0 != main_~p2~0); 122004#L92-1 assume !(0 != main_~p3~0); 122000#L96-1 assume !(0 != main_~p4~0); 121996#L100-1 assume !(0 != main_~p5~0); 121992#L104-1 assume !(0 != main_~p6~0); 121988#L108-1 assume !(0 != main_~p7~0); 121984#L112-1 assume !(0 != main_~p8~0); 121980#L116-1 assume !(0 != main_~p9~0); 121976#L120-1 assume !(0 != main_~p10~0); 121974#L124-1 assume !(0 != main_~p11~0); 121970#L128-1 assume !(0 != main_~p12~0); 121968#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 121966#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 121963#L140-1 assume !(0 != main_~p1~0); 121964#L146-1 assume !(0 != main_~p2~0); 122060#L151-1 assume !(0 != main_~p3~0); 122055#L156-1 assume !(0 != main_~p4~0); 122051#L161-1 assume !(0 != main_~p5~0); 122047#L166-1 assume !(0 != main_~p6~0); 122043#L171-1 assume !(0 != main_~p7~0); 122039#L176-1 assume !(0 != main_~p8~0); 122035#L181-1 assume !(0 != main_~p9~0); 122031#L186-1 assume !(0 != main_~p10~0); 122028#L191-1 assume !(0 != main_~p11~0); 122023#L196-1 assume !(0 != main_~p12~0); 122020#L201-1 assume !(0 != main_~p13~0); 122016#L206-1 assume !(0 != main_~p14~0); 121857#L211-1 [2021-10-13 00:01:04,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:01:04,554 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2021-10-13 00:01:04,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:01:04,554 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425302343] [2021-10-13 00:01:04,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:01:04,555 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:01:04,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:01:04,559 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:01:04,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:01:04,577 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:01:04,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:01:04,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1677866365, now seen corresponding path program 1 times [2021-10-13 00:01:04,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:01:04,586 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62292437] [2021-10-13 00:01:04,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:01:04,587 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:01:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:01:04,614 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:01:04,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:01:04,614 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62292437] [2021-10-13 00:01:04,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62292437] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:01:04,614 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:01:04,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:01:04,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732577008] [2021-10-13 00:01:04,615 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:01:04,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:01:04,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:01:04,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:01:04,616 INFO L87 Difference]: Start difference. First operand 39938 states and 58370 transitions. cyclomatic complexity: 19456 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:01:04,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:01:04,849 INFO L93 Difference]: Finished difference Result 78850 states and 113666 transitions. [2021-10-13 00:01:04,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:01:04,849 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78850 states and 113666 transitions. [2021-10-13 00:01:05,330 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 78848 [2021-10-13 00:01:05,709 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78850 states to 78850 states and 113666 transitions. [2021-10-13 00:01:05,710 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78850 [2021-10-13 00:01:05,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78850 [2021-10-13 00:01:05,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78850 states and 113666 transitions. [2021-10-13 00:01:05,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:01:05,824 INFO L681 BuchiCegarLoop]: Abstraction has 78850 states and 113666 transitions. [2021-10-13 00:01:05,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78850 states and 113666 transitions. [2021-10-13 00:01:06,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78850 to 78850. [2021-10-13 00:01:06,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78850 states, 78850 states have (on average 1.4415472415979709) internal successors, (113666), 78849 states have internal predecessors, (113666), 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:01:07,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78850 states to 78850 states and 113666 transitions. [2021-10-13 00:01:07,258 INFO L704 BuchiCegarLoop]: Abstraction has 78850 states and 113666 transitions. [2021-10-13 00:01:07,260 INFO L587 BuchiCegarLoop]: Abstraction has 78850 states and 113666 transitions. [2021-10-13 00:01:07,260 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-10-13 00:01:07,270 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78850 states and 113666 transitions. [2021-10-13 00:01:07,479 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 78848 [2021-10-13 00:01:07,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:01:07,480 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:01:07,481 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:01:07,481 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:01:07,481 INFO L791 eck$LassoCheckResult]: Stem: 240669#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 240648#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_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~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;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 240649#L211-1 [2021-10-13 00:01:07,481 INFO L793 eck$LassoCheckResult]: Loop: 240649#L211-1 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 241123#L55 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;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 241119#L88 assume !(0 != main_~p1~0); 241113#L88-2 assume !(0 != main_~p2~0); 241108#L92-1 assume !(0 != main_~p3~0); 241104#L96-1 assume !(0 != main_~p4~0); 241098#L100-1 assume !(0 != main_~p5~0); 241068#L104-1 assume !(0 != main_~p6~0); 241070#L108-1 assume !(0 != main_~p7~0); 241092#L112-1 assume !(0 != main_~p8~0); 241206#L116-1 assume !(0 != main_~p9~0); 241203#L120-1 assume !(0 != main_~p10~0); 241200#L124-1 assume !(0 != main_~p11~0); 241197#L128-1 assume !(0 != main_~p12~0); 241193#L132-1 assume !(0 != main_~p13~0); 241194#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 241224#L140-1 assume !(0 != main_~p1~0); 241222#L146-1 assume !(0 != main_~p2~0); 241221#L151-1 assume !(0 != main_~p3~0); 241218#L156-1 assume !(0 != main_~p4~0); 241216#L161-1 assume !(0 != main_~p5~0); 241214#L166-1 assume !(0 != main_~p6~0); 241007#L171-1 assume !(0 != main_~p7~0); 241002#L176-1 assume !(0 != main_~p8~0); 240997#L181-1 assume !(0 != main_~p9~0); 240992#L186-1 assume !(0 != main_~p10~0); 240993#L191-1 assume !(0 != main_~p11~0); 240982#L196-1 assume !(0 != main_~p12~0); 240984#L201-1 assume !(0 != main_~p13~0); 241131#L206-1 assume !(0 != main_~p14~0); 240649#L211-1 [2021-10-13 00:01:07,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:01:07,482 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2021-10-13 00:01:07,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:01:07,482 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004294143] [2021-10-13 00:01:07,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:01:07,482 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:01:07,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:01:07,488 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:01:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:01:07,494 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:01:07,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:01:07,495 INFO L82 PathProgramCache]: Analyzing trace with hash 656798011, now seen corresponding path program 1 times [2021-10-13 00:01:07,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:01:07,495 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057837778] [2021-10-13 00:01:07,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:01:07,495 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:01:07,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:01:07,510 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:01:07,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:01:07,510 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057837778] [2021-10-13 00:01:07,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057837778] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:01:07,510 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:01:07,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 00:01:07,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348629214] [2021-10-13 00:01:07,511 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:01:07,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:01:07,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:01:07,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:01:07,512 INFO L87 Difference]: Start difference. First operand 78850 states and 113666 transitions. cyclomatic complexity: 36864 Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:01:08,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:01:08,113 INFO L93 Difference]: Finished difference Result 155650 states and 221186 transitions. [2021-10-13 00:01:08,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:01:08,114 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155650 states and 221186 transitions. [2021-10-13 00:01:09,062 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 155648 [2021-10-13 00:01:09,504 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155650 states to 155650 states and 221186 transitions. [2021-10-13 00:01:09,504 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155650 [2021-10-13 00:01:09,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 155650 [2021-10-13 00:01:09,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 155650 states and 221186 transitions. [2021-10-13 00:01:09,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:01:09,616 INFO L681 BuchiCegarLoop]: Abstraction has 155650 states and 221186 transitions. [2021-10-13 00:01:09,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155650 states and 221186 transitions. [2021-10-13 00:01:11,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155650 to 155650. [2021-10-13 00:01:11,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155650 states, 155650 states have (on average 1.4210472213299068) internal successors, (221186), 155649 states have internal predecessors, (221186), 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:01:11,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155650 states to 155650 states and 221186 transitions. [2021-10-13 00:01:11,663 INFO L704 BuchiCegarLoop]: Abstraction has 155650 states and 221186 transitions. [2021-10-13 00:01:11,663 INFO L587 BuchiCegarLoop]: Abstraction has 155650 states and 221186 transitions. [2021-10-13 00:01:11,663 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-10-13 00:01:11,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 155650 states and 221186 transitions. [2021-10-13 00:01:12,674 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 155648 [2021-10-13 00:01:12,675 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:01:12,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:01:12,677 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:01:12,677 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:01:12,677 INFO L791 eck$LassoCheckResult]: Stem: 475174#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 475155#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_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~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;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 475156#L211-1 [2021-10-13 00:01:12,677 INFO L793 eck$LassoCheckResult]: Loop: 475156#L211-1 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 476630#L55 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;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 476626#L88 assume !(0 != main_~p1~0); 476622#L88-2 assume !(0 != main_~p2~0); 476620#L92-1 assume !(0 != main_~p3~0); 476615#L96-1 assume !(0 != main_~p4~0); 476603#L100-1 assume !(0 != main_~p5~0); 476604#L104-1 assume !(0 != main_~p6~0); 476674#L108-1 assume !(0 != main_~p7~0); 476661#L112-1 assume !(0 != main_~p8~0); 476659#L116-1 assume !(0 != main_~p9~0); 476569#L120-1 assume !(0 != main_~p10~0); 476571#L124-1 assume !(0 != main_~p11~0); 476544#L128-1 assume !(0 != main_~p12~0); 476546#L132-1 assume !(0 != main_~p13~0); 476521#L136-1 assume !(0 != main_~p14~0); 476523#L140-1 assume !(0 != main_~p1~0); 476485#L146-1 assume !(0 != main_~p2~0); 476487#L151-1 assume !(0 != main_~p3~0); 476475#L156-1 assume !(0 != main_~p4~0); 476477#L161-1 assume !(0 != main_~p5~0); 476335#L166-1 assume !(0 != main_~p6~0); 476336#L171-1 assume !(0 != main_~p7~0); 476428#L176-1 assume !(0 != main_~p8~0); 476650#L181-1 assume !(0 != main_~p9~0); 476647#L186-1 assume !(0 != main_~p10~0); 476646#L191-1 assume !(0 != main_~p11~0); 476643#L196-1 assume !(0 != main_~p12~0); 476639#L201-1 assume !(0 != main_~p13~0); 476635#L206-1 assume !(0 != main_~p14~0); 475156#L211-1 [2021-10-13 00:01:12,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:01:12,677 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 13 times [2021-10-13 00:01:12,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:01:12,678 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200475433] [2021-10-13 00:01:12,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:01:12,678 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:01:12,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:01:12,684 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:01:12,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:01:12,690 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:01:12,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:01:12,691 INFO L82 PathProgramCache]: Analyzing trace with hash -623065667, now seen corresponding path program 1 times [2021-10-13 00:01:12,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:01:12,691 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746699927] [2021-10-13 00:01:12,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:01:12,691 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:01:12,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:01:12,695 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:01:12,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:01:12,702 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:01:12,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:01:12,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1839024639, now seen corresponding path program 1 times [2021-10-13 00:01:12,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:01:12,703 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486352094] [2021-10-13 00:01:12,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:01:12,703 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:01:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:01:12,709 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:01:12,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:01:12,726 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:01:13,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.10 12:01:13 BoogieIcfgContainer [2021-10-13 00:01:13,531 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-10-13 00:01:13,531 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 00:01:13,531 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 00:01:13,532 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 00:01:13,532 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:00:58" (3/4) ... [2021-10-13 00:01:13,534 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-10-13 00:01:13,585 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a8a6698-8d16-4cc3-b5e6-534d11c0e0a3/bin/uautomizer-WNIpwEf4Nt/witness.graphml [2021-10-13 00:01:13,585 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 00:01:13,587 INFO L168 Benchmark]: Toolchain (without parser) took 15831.22 ms. Allocated memory was 79.7 MB in the beginning and 9.3 GB in the end (delta: 9.2 GB). Free memory was 42.0 MB in the beginning and 7.9 GB in the end (delta: -7.8 GB). Peak memory consumption was 1.3 GB. Max. memory is 16.1 GB. [2021-10-13 00:01:13,587 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 79.7 MB. Free memory is still 58.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 00:01:13,588 INFO L168 Benchmark]: CACSL2BoogieTranslator took 300.56 ms. Allocated memory was 79.7 MB in the beginning and 104.9 MB in the end (delta: 25.2 MB). Free memory was 41.8 MB in the beginning and 80.5 MB in the end (delta: -38.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-13 00:01:13,588 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.31 ms. Allocated memory is still 104.9 MB. Free memory was 80.5 MB in the beginning and 79.0 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 00:01:13,589 INFO L168 Benchmark]: Boogie Preprocessor took 29.80 ms. Allocated memory is still 104.9 MB. Free memory was 79.0 MB in the beginning and 77.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 00:01:13,589 INFO L168 Benchmark]: RCFGBuilder took 393.26 ms. Allocated memory is still 104.9 MB. Free memory was 77.4 MB in the beginning and 64.3 MB in the end (delta: 13.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-13 00:01:13,590 INFO L168 Benchmark]: BuchiAutomizer took 15008.72 ms. Allocated memory was 104.9 MB in the beginning and 9.3 GB in the end (delta: 9.1 GB). Free memory was 63.8 MB in the beginning and 7.9 GB in the end (delta: -7.8 GB). Peak memory consumption was 1.3 GB. Max. memory is 16.1 GB. [2021-10-13 00:01:13,590 INFO L168 Benchmark]: Witness Printer took 54.10 ms. Allocated memory is still 9.3 GB. Free memory was 7.9 GB in the beginning and 7.9 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 00:01:13,592 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 79.7 MB. Free memory is still 58.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 300.56 ms. Allocated memory was 79.7 MB in the beginning and 104.9 MB in the end (delta: 25.2 MB). Free memory was 41.8 MB in the beginning and 80.5 MB in the end (delta: -38.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 39.31 ms. Allocated memory is still 104.9 MB. Free memory was 80.5 MB in the beginning and 79.0 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 29.80 ms. Allocated memory is still 104.9 MB. Free memory was 79.0 MB in the beginning and 77.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 393.26 ms. Allocated memory is still 104.9 MB. Free memory was 77.4 MB in the beginning and 64.3 MB in the end (delta: 13.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 15008.72 ms. Allocated memory was 104.9 MB in the beginning and 9.3 GB in the end (delta: 9.1 GB). Free memory was 63.8 MB in the beginning and 7.9 GB in the end (delta: -7.8 GB). Peak memory consumption was 1.3 GB. Max. memory is 16.1 GB. * Witness Printer took 54.10 ms. Allocated memory is still 9.3 GB. Free memory was 7.9 GB in the beginning and 7.9 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (12 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.12 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 155650 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.9s and 13 iterations. TraceHistogramMax:1. Analysis of lassos took 2.2s. Construction of modules took 0.1s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 0. Minimization of det autom 12. Minimization of nondet autom 0. Automata minimization 5484.2ms AutomataMinimizationTime, 12 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 3.5s Buchi closure took 0.1s. Biggest automaton had 155650 states and ocurred in iteration 12. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1324 SDtfs, 690 SDslu, 833 SDs, 0 SdLazy, 60 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 114.1ms Time LassoAnalysisResults: nont1 unkn0 SFLI12 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: 53]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=32002} State at position 1 is {NULL=0, p1=0, p3=0, p5=0, NULL=32002, p10=0, p7=0, p9=0, lk12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@659e49a3=0, lk14=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@365c4dd9=0, p14=0, lk10=0, p12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@770bd829=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@79715c9d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@44ec5f3e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@185cc2a7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7b091a42=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7c136bb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1085b4b1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@44e311fd=0, NULL=0, NULL=0, lk3=0, lk5=0, NULL=0, lk1=0, lk7=0, lk9=0, NULL=32005, \result=0, p2=0, p4=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2fdf99d0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@69149189=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1bccef0f=0, lk13=0, p13=0, p11=0, lk11=0, cond=10, NULL=32003, NULL=0, NULL=32004, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@313f8b15=0, lk4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@42d9ac1b=10, lk6=0, lk2=0, lk8=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 53]: 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; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L51] int cond; Loop: [L53] COND TRUE 1 [L54] cond = __VERIFIER_nondet_int() [L55] COND FALSE !(cond == 0) [L58] lk1 = 0 [L60] lk2 = 0 [L62] lk3 = 0 [L64] lk4 = 0 [L66] lk5 = 0 [L68] lk6 = 0 [L70] lk7 = 0 [L72] lk8 = 0 [L74] lk9 = 0 [L76] lk10 = 0 [L78] lk11 = 0 [L80] lk12 = 0 [L82] lk13 = 0 [L84] lk14 = 0 [L88] COND FALSE !(p1 != 0) [L92] COND FALSE !(p2 != 0) [L96] COND FALSE !(p3 != 0) [L100] COND FALSE !(p4 != 0) [L104] COND FALSE !(p5 != 0) [L108] COND FALSE !(p6 != 0) [L112] COND FALSE !(p7 != 0) [L116] COND FALSE !(p8 != 0) [L120] COND FALSE !(p9 != 0) [L124] COND FALSE !(p10 != 0) [L128] COND FALSE !(p11 != 0) [L132] COND FALSE !(p12 != 0) [L136] COND FALSE !(p13 != 0) [L140] COND FALSE !(p14 != 0) [L146] COND FALSE !(p1 != 0) [L151] COND FALSE !(p2 != 0) [L156] COND FALSE !(p3 != 0) [L161] COND FALSE !(p4 != 0) [L166] COND FALSE !(p5 != 0) [L171] COND FALSE !(p6 != 0) [L176] COND FALSE !(p7 != 0) [L181] COND FALSE !(p8 != 0) [L186] COND FALSE !(p9 != 0) [L191] COND FALSE !(p10 != 0) [L196] COND FALSE !(p11 != 0) [L201] COND FALSE !(p12 != 0) [L206] COND FALSE !(p13 != 0) [L211] COND FALSE !(p14 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-10-13 00:01:13,668 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a8a6698-8d16-4cc3-b5e6-534d11c0e0a3/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...