./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 e943c265 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f3c3b4-801e-482e-bb98-5b70dd593e91/bin/uautomizer-j4sWxH34Be/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f3c3b4-801e-482e-bb98-5b70dd593e91/bin/uautomizer-j4sWxH34Be/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f3c3b4-801e-482e-bb98-5b70dd593e91/bin/uautomizer-j4sWxH34Be/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f3c3b4-801e-482e-bb98-5b70dd593e91/bin/uautomizer-j4sWxH34Be/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_14-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f3c3b4-801e-482e-bb98-5b70dd593e91/bin/uautomizer-j4sWxH34Be/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f3c3b4-801e-482e-bb98-5b70dd593e91/bin/uautomizer-j4sWxH34Be --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1e1f6c8a80d54f6d4b7b413368cc99af6eca243b930331d178961d851b56afbd ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-e943c26 [2021-10-21 20:02:40,315 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-21 20:02:40,317 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-21 20:02:40,374 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-21 20:02:40,374 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-21 20:02:40,377 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-21 20:02:40,379 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-21 20:02:40,381 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-21 20:02:40,383 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-21 20:02:40,384 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-21 20:02:40,386 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-21 20:02:40,387 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-21 20:02:40,387 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-21 20:02:40,389 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-21 20:02:40,390 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-21 20:02:40,404 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-21 20:02:40,406 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-21 20:02:40,408 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-21 20:02:40,411 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-21 20:02:40,419 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-21 20:02:40,422 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-21 20:02:40,424 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-21 20:02:40,428 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-21 20:02:40,429 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-21 20:02:40,437 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-21 20:02:40,437 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-21 20:02:40,438 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-21 20:02:40,440 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-21 20:02:40,441 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-21 20:02:40,442 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-21 20:02:40,443 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-21 20:02:40,444 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-21 20:02:40,446 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-21 20:02:40,447 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-21 20:02:40,449 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-21 20:02:40,449 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-21 20:02:40,450 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-21 20:02:40,451 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-21 20:02:40,451 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-21 20:02:40,452 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-21 20:02:40,453 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-21 20:02:40,454 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f3c3b4-801e-482e-bb98-5b70dd593e91/bin/uautomizer-j4sWxH34Be/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-10-21 20:02:40,501 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-21 20:02:40,501 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-21 20:02:40,501 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-21 20:02:40,501 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-21 20:02:40,502 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-21 20:02:40,502 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-21 20:02:40,502 INFO L138 SettingsManager]: * Use SBE=true [2021-10-21 20:02:40,503 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-10-21 20:02:40,503 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-10-21 20:02:40,503 INFO L138 SettingsManager]: * Use old map elimination=false [2021-10-21 20:02:40,503 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-10-21 20:02:40,503 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-10-21 20:02:40,504 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-10-21 20:02:40,504 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-21 20:02:40,504 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-21 20:02:40,504 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-21 20:02:40,504 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-21 20:02:40,505 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-21 20:02:40,505 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-21 20:02:40,505 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-10-21 20:02:40,505 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-10-21 20:02:40,505 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-10-21 20:02:40,506 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-21 20:02:40,506 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-21 20:02:40,506 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-10-21 20:02:40,506 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-21 20:02:40,507 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-10-21 20:02:40,507 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-21 20:02:40,507 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-21 20:02:40,507 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-21 20:02:40,508 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-21 20:02:40,508 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-21 20:02:40,509 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-10-21 20:02:40,509 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_b8f3c3b4-801e-482e-bb98-5b70dd593e91/bin/uautomizer-j4sWxH34Be/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f3c3b4-801e-482e-bb98-5b70dd593e91/bin/uautomizer-j4sWxH34Be Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1e1f6c8a80d54f6d4b7b413368cc99af6eca243b930331d178961d851b56afbd [2021-10-21 20:02:40,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-21 20:02:40,791 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-21 20:02:40,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-21 20:02:40,796 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-21 20:02:40,797 INFO L275 PluginConnector]: CDTParser initialized [2021-10-21 20:02:40,798 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f3c3b4-801e-482e-bb98-5b70dd593e91/bin/uautomizer-j4sWxH34Be/../../sv-benchmarks/c/locks/test_locks_14-1.c [2021-10-21 20:02:40,876 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f3c3b4-801e-482e-bb98-5b70dd593e91/bin/uautomizer-j4sWxH34Be/data/d4dec1c90/6d05c305a3aa419cac0d1fe852d9d840/FLAGe10dd7733 [2021-10-21 20:02:41,366 INFO L306 CDTParser]: Found 1 translation units. [2021-10-21 20:02:41,367 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f3c3b4-801e-482e-bb98-5b70dd593e91/sv-benchmarks/c/locks/test_locks_14-1.c [2021-10-21 20:02:41,382 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f3c3b4-801e-482e-bb98-5b70dd593e91/bin/uautomizer-j4sWxH34Be/data/d4dec1c90/6d05c305a3aa419cac0d1fe852d9d840/FLAGe10dd7733 [2021-10-21 20:02:41,718 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f3c3b4-801e-482e-bb98-5b70dd593e91/bin/uautomizer-j4sWxH34Be/data/d4dec1c90/6d05c305a3aa419cac0d1fe852d9d840 [2021-10-21 20:02:41,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-21 20:02:41,722 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-21 20:02:41,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-21 20:02:41,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-21 20:02:41,727 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-21 20:02:41,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 08:02:41" (1/1) ... [2021-10-21 20:02:41,729 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@228b969f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:02:41, skipping insertion in model container [2021-10-21 20:02:41,729 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 08:02:41" (1/1) ... [2021-10-21 20:02:41,737 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-21 20:02:41,767 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-21 20:02:41,950 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_b8f3c3b4-801e-482e-bb98-5b70dd593e91/sv-benchmarks/c/locks/test_locks_14-1.c[5283,5296] [2021-10-21 20:02:41,952 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 20:02:41,962 INFO L203 MainTranslator]: Completed pre-run [2021-10-21 20:02:41,993 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_b8f3c3b4-801e-482e-bb98-5b70dd593e91/sv-benchmarks/c/locks/test_locks_14-1.c[5283,5296] [2021-10-21 20:02:41,994 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 20:02:42,009 INFO L208 MainTranslator]: Completed translation [2021-10-21 20:02:42,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:02:42 WrapperNode [2021-10-21 20:02:42,010 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-21 20:02:42,011 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-21 20:02:42,011 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-21 20:02:42,012 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-21 20:02:42,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:02:42" (1/1) ... [2021-10-21 20:02:42,030 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:02:42" (1/1) ... [2021-10-21 20:02:42,057 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-21 20:02:42,058 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-21 20:02:42,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-21 20:02:42,059 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-21 20:02:42,068 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:02:42" (1/1) ... [2021-10-21 20:02:42,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:02:42" (1/1) ... [2021-10-21 20:02:42,071 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:02:42" (1/1) ... [2021-10-21 20:02:42,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:02:42" (1/1) ... [2021-10-21 20:02:42,079 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:02:42" (1/1) ... [2021-10-21 20:02:42,087 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:02:42" (1/1) ... [2021-10-21 20:02:42,089 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:02:42" (1/1) ... [2021-10-21 20:02:42,092 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-21 20:02:42,093 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-21 20:02:42,093 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-21 20:02:42,093 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-21 20:02:42,095 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:02:42" (1/1) ... [2021-10-21 20:02:42,104 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 20:02:42,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f3c3b4-801e-482e-bb98-5b70dd593e91/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 20:02:42,149 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f3c3b4-801e-482e-bb98-5b70dd593e91/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 20:02:42,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f3c3b4-801e-482e-bb98-5b70dd593e91/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-10-21 20:02:42,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-21 20:02:42,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-21 20:02:42,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-21 20:02:42,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-21 20:02:42,665 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-21 20:02:42,665 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-10-21 20:02:42,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 08:02:42 BoogieIcfgContainer [2021-10-21 20:02:42,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-21 20:02:42,669 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-10-21 20:02:42,669 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-10-21 20:02:42,673 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-10-21 20:02:42,674 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-21 20:02:42,674 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.10 08:02:41" (1/3) ... [2021-10-21 20:02:42,675 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3308494 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.10 08:02:42, skipping insertion in model container [2021-10-21 20:02:42,676 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-21 20:02:42,676 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:02:42" (2/3) ... [2021-10-21 20:02:42,676 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3308494 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.10 08:02:42, skipping insertion in model container [2021-10-21 20:02:42,676 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-21 20:02:42,677 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 08:02:42" (3/3) ... [2021-10-21 20:02:42,678 INFO L389 chiAutomizerObserver]: Analyzing ICFG test_locks_14-1.c [2021-10-21 20:02:42,728 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-10-21 20:02:42,728 INFO L360 BuchiCegarLoop]: Hoare is false [2021-10-21 20:02:42,728 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-10-21 20:02:42,728 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-21 20:02:42,729 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-21 20:02:42,729 INFO L364 BuchiCegarLoop]: Difference is false [2021-10-21 20:02:42,729 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-21 20:02:42,729 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-10-21 20:02:42,748 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-21 20:02:42,772 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2021-10-21 20:02:42,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 20:02:42,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 20:02:42,780 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-21 20:02:42,780 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-21 20:02:42,780 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-10-21 20:02:42,781 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-21 20:02:42,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2021-10-21 20:02:42,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 20:02:42,786 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 20:02:42,788 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-21 20:02:42,788 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-21 20:02:42,795 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-21 20:02:42,797 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-21 20:02:42,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:02:42,804 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-10-21 20:02:42,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:02:42,815 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447750429] [2021-10-21 20:02:42,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:02:42,816 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:02:42,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:02:42,921 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 20:02:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:02:42,962 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 20:02:42,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:02:42,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1221430905, now seen corresponding path program 1 times [2021-10-21 20:02:42,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:02:42,966 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064138679] [2021-10-21 20:02:42,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:02:42,966 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:02:42,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:02:43,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:02:43,056 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:02:43,056 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064138679] [2021-10-21 20:02:43,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064138679] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:02:43,057 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:02:43,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:02:43,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884358557] [2021-10-21 20:02:43,064 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-21 20:02:43,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:02:43,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:02:43,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:02:43,085 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-21 20:02:43,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:02:43,125 INFO L93 Difference]: Finished difference Result 99 states and 178 transitions. [2021-10-21 20:02:43,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:02:43,127 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 178 transitions. [2021-10-21 20:02:43,133 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2021-10-21 20:02:43,139 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 89 states and 143 transitions. [2021-10-21 20:02:43,140 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2021-10-21 20:02:43,141 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2021-10-21 20:02:43,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 143 transitions. [2021-10-21 20:02:43,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 20:02:43,143 INFO L681 BuchiCegarLoop]: Abstraction has 89 states and 143 transitions. [2021-10-21 20:02:43,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 143 transitions. [2021-10-21 20:02:43,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-10-21 20:02:43,178 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-21 20:02:43,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 143 transitions. [2021-10-21 20:02:43,182 INFO L704 BuchiCegarLoop]: Abstraction has 89 states and 143 transitions. [2021-10-21 20:02:43,182 INFO L587 BuchiCegarLoop]: Abstraction has 89 states and 143 transitions. [2021-10-21 20:02:43,182 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-10-21 20:02:43,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 143 transitions. [2021-10-21 20:02:43,185 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2021-10-21 20:02:43,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 20:02:43,186 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 20:02:43,187 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-21 20:02:43,187 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-21 20:02:43,187 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-21 20:02:43,187 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-21 20:02:43,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:02:43,188 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-10-21 20:02:43,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:02:43,189 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294116376] [2021-10-21 20:02:43,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:02:43,189 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:02:43,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:02:43,206 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 20:02:43,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:02:43,228 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 20:02:43,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:02:43,229 INFO L82 PathProgramCache]: Analyzing trace with hash 711957815, now seen corresponding path program 1 times [2021-10-21 20:02:43,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:02:43,230 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138374074] [2021-10-21 20:02:43,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:02:43,230 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:02:43,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:02:43,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:02:43,276 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:02:43,277 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138374074] [2021-10-21 20:02:43,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138374074] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:02:43,277 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:02:43,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:02:43,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598224441] [2021-10-21 20:02:43,278 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-21 20:02:43,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:02:43,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:02:43,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:02:43,280 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-21 20:02:43,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:02:43,302 INFO L93 Difference]: Finished difference Result 174 states and 278 transitions. [2021-10-21 20:02:43,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:02:43,303 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 278 transitions. [2021-10-21 20:02:43,307 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2021-10-21 20:02:43,310 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 174 states and 278 transitions. [2021-10-21 20:02:43,310 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2021-10-21 20:02:43,311 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2021-10-21 20:02:43,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 278 transitions. [2021-10-21 20:02:43,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 20:02:43,313 INFO L681 BuchiCegarLoop]: Abstraction has 174 states and 278 transitions. [2021-10-21 20:02:43,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 278 transitions. [2021-10-21 20:02:43,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2021-10-21 20:02:43,331 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-21 20:02:43,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 278 transitions. [2021-10-21 20:02:43,333 INFO L704 BuchiCegarLoop]: Abstraction has 174 states and 278 transitions. [2021-10-21 20:02:43,334 INFO L587 BuchiCegarLoop]: Abstraction has 174 states and 278 transitions. [2021-10-21 20:02:43,334 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-10-21 20:02:43,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 278 transitions. [2021-10-21 20:02:43,337 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2021-10-21 20:02:43,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 20:02:43,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 20:02:43,339 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-21 20:02:43,343 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-21 20:02:43,343 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-21 20:02:43,345 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-21 20:02:43,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:02:43,352 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-10-21 20:02:43,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:02:43,353 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256623150] [2021-10-21 20:02:43,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:02:43,355 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:02:43,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:02:43,383 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 20:02:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:02:43,400 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 20:02:43,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:02:43,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1659781447, now seen corresponding path program 1 times [2021-10-21 20:02:43,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:02:43,402 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766401212] [2021-10-21 20:02:43,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:02:43,403 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:02:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:02:43,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:02:43,482 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:02:43,482 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766401212] [2021-10-21 20:02:43,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766401212] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:02:43,483 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:02:43,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:02:43,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675069944] [2021-10-21 20:02:43,484 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-21 20:02:43,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:02:43,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:02:43,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:02:43,485 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-21 20:02:43,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:02:43,507 INFO L93 Difference]: Finished difference Result 342 states and 542 transitions. [2021-10-21 20:02:43,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:02:43,507 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 342 states and 542 transitions. [2021-10-21 20:02:43,512 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2021-10-21 20:02:43,518 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 342 states to 342 states and 542 transitions. [2021-10-21 20:02:43,518 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 342 [2021-10-21 20:02:43,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 342 [2021-10-21 20:02:43,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 342 states and 542 transitions. [2021-10-21 20:02:43,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 20:02:43,523 INFO L681 BuchiCegarLoop]: Abstraction has 342 states and 542 transitions. [2021-10-21 20:02:43,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states and 542 transitions. [2021-10-21 20:02:43,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2021-10-21 20:02:43,557 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-21 20:02:43,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 542 transitions. [2021-10-21 20:02:43,561 INFO L704 BuchiCegarLoop]: Abstraction has 342 states and 542 transitions. [2021-10-21 20:02:43,561 INFO L587 BuchiCegarLoop]: Abstraction has 342 states and 542 transitions. [2021-10-21 20:02:43,561 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-10-21 20:02:43,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 342 states and 542 transitions. [2021-10-21 20:02:43,564 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2021-10-21 20:02:43,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 20:02:43,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 20:02:43,565 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-21 20:02:43,566 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-21 20:02:43,566 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-21 20:02:43,566 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-21 20:02:43,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:02:43,567 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-10-21 20:02:43,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:02:43,568 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274468193] [2021-10-21 20:02:43,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:02:43,568 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:02:43,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:02:43,580 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 20:02:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:02:43,596 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 20:02:43,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:02:43,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1519232837, now seen corresponding path program 1 times [2021-10-21 20:02:43,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:02:43,597 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062430982] [2021-10-21 20:02:43,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:02:43,598 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:02:43,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:02:43,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:02:43,633 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:02:43,633 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062430982] [2021-10-21 20:02:43,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062430982] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:02:43,634 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:02:43,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:02:43,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757731498] [2021-10-21 20:02:43,635 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-21 20:02:43,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:02:43,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:02:43,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:02:43,637 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-21 20:02:43,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:02:43,660 INFO L93 Difference]: Finished difference Result 674 states and 1058 transitions. [2021-10-21 20:02:43,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:02:43,660 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 674 states and 1058 transitions. [2021-10-21 20:02:43,671 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2021-10-21 20:02:43,681 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 674 states to 674 states and 1058 transitions. [2021-10-21 20:02:43,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 674 [2021-10-21 20:02:43,683 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 674 [2021-10-21 20:02:43,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 674 states and 1058 transitions. [2021-10-21 20:02:43,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 20:02:43,688 INFO L681 BuchiCegarLoop]: Abstraction has 674 states and 1058 transitions. [2021-10-21 20:02:43,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states and 1058 transitions. [2021-10-21 20:02:43,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2021-10-21 20:02:43,716 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-21 20:02:43,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1058 transitions. [2021-10-21 20:02:43,722 INFO L704 BuchiCegarLoop]: Abstraction has 674 states and 1058 transitions. [2021-10-21 20:02:43,722 INFO L587 BuchiCegarLoop]: Abstraction has 674 states and 1058 transitions. [2021-10-21 20:02:43,722 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-10-21 20:02:43,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 674 states and 1058 transitions. [2021-10-21 20:02:43,728 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2021-10-21 20:02:43,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 20:02:43,728 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 20:02:43,729 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-21 20:02:43,729 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-21 20:02:43,730 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-21 20:02:43,730 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-21 20:02:43,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:02:43,731 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-10-21 20:02:43,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:02:43,731 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572448070] [2021-10-21 20:02:43,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:02:43,732 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:02:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:02:43,742 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 20:02:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:02:43,757 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 20:02:43,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:02:43,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1653246343, now seen corresponding path program 1 times [2021-10-21 20:02:43,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:02:43,758 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262729891] [2021-10-21 20:02:43,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:02:43,759 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:02:43,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:02:43,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:02:43,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:02:43,805 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262729891] [2021-10-21 20:02:43,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262729891] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:02:43,806 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:02:43,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:02:43,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790163240] [2021-10-21 20:02:43,807 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-21 20:02:43,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:02:43,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:02:43,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:02:43,808 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-21 20:02:43,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:02:43,832 INFO L93 Difference]: Finished difference Result 1330 states and 2066 transitions. [2021-10-21 20:02:43,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:02:43,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1330 states and 2066 transitions. [2021-10-21 20:02:43,849 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2021-10-21 20:02:43,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1330 states to 1330 states and 2066 transitions. [2021-10-21 20:02:43,863 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1330 [2021-10-21 20:02:43,864 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1330 [2021-10-21 20:02:43,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1330 states and 2066 transitions. [2021-10-21 20:02:43,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 20:02:43,866 INFO L681 BuchiCegarLoop]: Abstraction has 1330 states and 2066 transitions. [2021-10-21 20:02:43,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states and 2066 transitions. [2021-10-21 20:02:43,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1330. [2021-10-21 20:02:43,899 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-21 20:02:43,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 2066 transitions. [2021-10-21 20:02:43,905 INFO L704 BuchiCegarLoop]: Abstraction has 1330 states and 2066 transitions. [2021-10-21 20:02:43,905 INFO L587 BuchiCegarLoop]: Abstraction has 1330 states and 2066 transitions. [2021-10-21 20:02:43,905 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-10-21 20:02:43,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1330 states and 2066 transitions. [2021-10-21 20:02:43,915 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2021-10-21 20:02:43,916 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 20:02:43,916 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 20:02:43,916 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-21 20:02:43,917 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-21 20:02:43,917 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-21 20:02:43,917 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-21 20:02:43,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:02:43,918 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-10-21 20:02:43,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:02:43,918 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109553596] [2021-10-21 20:02:43,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:02:43,918 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:02:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:02:43,928 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 20:02:43,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:02:43,939 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 20:02:43,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:02:43,940 INFO L82 PathProgramCache]: Analyzing trace with hash 836282619, now seen corresponding path program 1 times [2021-10-21 20:02:43,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:02:43,941 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442392748] [2021-10-21 20:02:43,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:02:43,941 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:02:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:02:43,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:02:43,968 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:02:43,968 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442392748] [2021-10-21 20:02:43,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442392748] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:02:43,968 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:02:43,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:02:43,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528428887] [2021-10-21 20:02:43,969 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-21 20:02:43,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:02:43,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:02:43,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:02:43,970 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-21 20:02:44,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:02:44,007 INFO L93 Difference]: Finished difference Result 2626 states and 4034 transitions. [2021-10-21 20:02:44,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:02:44,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2626 states and 4034 transitions. [2021-10-21 20:02:44,080 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2021-10-21 20:02:44,104 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2626 states to 2626 states and 4034 transitions. [2021-10-21 20:02:44,106 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2626 [2021-10-21 20:02:44,108 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2626 [2021-10-21 20:02:44,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2626 states and 4034 transitions. [2021-10-21 20:02:44,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 20:02:44,113 INFO L681 BuchiCegarLoop]: Abstraction has 2626 states and 4034 transitions. [2021-10-21 20:02:44,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2626 states and 4034 transitions. [2021-10-21 20:02:44,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2626 to 2626. [2021-10-21 20:02:44,174 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-21 20:02:44,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 4034 transitions. [2021-10-21 20:02:44,186 INFO L704 BuchiCegarLoop]: Abstraction has 2626 states and 4034 transitions. [2021-10-21 20:02:44,186 INFO L587 BuchiCegarLoop]: Abstraction has 2626 states and 4034 transitions. [2021-10-21 20:02:44,186 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-10-21 20:02:44,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2626 states and 4034 transitions. [2021-10-21 20:02:44,208 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2021-10-21 20:02:44,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 20:02:44,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 20:02:44,210 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-21 20:02:44,211 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-21 20:02:44,211 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-21 20:02:44,211 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-21 20:02:44,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:02:44,213 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2021-10-21 20:02:44,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:02:44,214 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725473066] [2021-10-21 20:02:44,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:02:44,214 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:02:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:02:44,232 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 20:02:44,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:02:44,260 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 20:02:44,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:02:44,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1055137337, now seen corresponding path program 1 times [2021-10-21 20:02:44,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:02:44,262 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078041833] [2021-10-21 20:02:44,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:02:44,262 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:02:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:02:44,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:02:44,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:02:44,309 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078041833] [2021-10-21 20:02:44,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078041833] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:02:44,310 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:02:44,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:02:44,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342448761] [2021-10-21 20:02:44,311 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-21 20:02:44,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:02:44,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:02:44,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:02:44,312 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-21 20:02:44,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:02:44,365 INFO L93 Difference]: Finished difference Result 5186 states and 7874 transitions. [2021-10-21 20:02:44,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:02:44,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5186 states and 7874 transitions. [2021-10-21 20:02:44,429 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2021-10-21 20:02:44,476 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5186 states to 5186 states and 7874 transitions. [2021-10-21 20:02:44,477 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5186 [2021-10-21 20:02:44,482 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5186 [2021-10-21 20:02:44,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5186 states and 7874 transitions. [2021-10-21 20:02:44,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 20:02:44,492 INFO L681 BuchiCegarLoop]: Abstraction has 5186 states and 7874 transitions. [2021-10-21 20:02:44,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5186 states and 7874 transitions. [2021-10-21 20:02:44,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5186 to 5186. [2021-10-21 20:02:44,670 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-21 20:02:44,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5186 states to 5186 states and 7874 transitions. [2021-10-21 20:02:44,690 INFO L704 BuchiCegarLoop]: Abstraction has 5186 states and 7874 transitions. [2021-10-21 20:02:44,690 INFO L587 BuchiCegarLoop]: Abstraction has 5186 states and 7874 transitions. [2021-10-21 20:02:44,690 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-10-21 20:02:44,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5186 states and 7874 transitions. [2021-10-21 20:02:44,727 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2021-10-21 20:02:44,727 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 20:02:44,727 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 20:02:44,729 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-21 20:02:44,730 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-21 20:02:44,730 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-21 20:02:44,732 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-21 20:02:44,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:02:44,732 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2021-10-21 20:02:44,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:02:44,733 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406617641] [2021-10-21 20:02:44,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:02:44,733 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:02:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:02:44,760 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 20:02:44,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:02:44,782 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 20:02:44,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:02:44,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1477839163, now seen corresponding path program 1 times [2021-10-21 20:02:44,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:02:44,783 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035977459] [2021-10-21 20:02:44,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:02:44,783 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:02:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:02:44,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:02:44,820 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:02:44,822 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035977459] [2021-10-21 20:02:44,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035977459] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:02:44,824 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:02:44,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:02:44,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584437641] [2021-10-21 20:02:44,825 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-21 20:02:44,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:02:44,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:02:44,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:02:44,831 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-21 20:02:44,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:02:44,955 INFO L93 Difference]: Finished difference Result 10242 states and 15362 transitions. [2021-10-21 20:02:44,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:02:44,956 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10242 states and 15362 transitions. [2021-10-21 20:02:45,041 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2021-10-21 20:02:45,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10242 states to 10242 states and 15362 transitions. [2021-10-21 20:02:45,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10242 [2021-10-21 20:02:45,145 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10242 [2021-10-21 20:02:45,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10242 states and 15362 transitions. [2021-10-21 20:02:45,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 20:02:45,164 INFO L681 BuchiCegarLoop]: Abstraction has 10242 states and 15362 transitions. [2021-10-21 20:02:45,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10242 states and 15362 transitions. [2021-10-21 20:02:45,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10242 to 10242. [2021-10-21 20:02:45,485 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-21 20:02:45,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10242 states to 10242 states and 15362 transitions. [2021-10-21 20:02:45,519 INFO L704 BuchiCegarLoop]: Abstraction has 10242 states and 15362 transitions. [2021-10-21 20:02:45,519 INFO L587 BuchiCegarLoop]: Abstraction has 10242 states and 15362 transitions. [2021-10-21 20:02:45,519 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-10-21 20:02:45,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10242 states and 15362 transitions. [2021-10-21 20:02:45,562 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2021-10-21 20:02:45,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 20:02:45,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 20:02:45,564 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-21 20:02:45,564 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-21 20:02:45,564 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-21 20:02:45,566 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-21 20:02:45,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:02:45,567 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2021-10-21 20:02:45,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:02:45,568 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333980580] [2021-10-21 20:02:45,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:02:45,569 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:02:45,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:02:45,580 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 20:02:45,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:02:45,598 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 20:02:45,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:02:45,599 INFO L82 PathProgramCache]: Analyzing trace with hash 660190713, now seen corresponding path program 1 times [2021-10-21 20:02:45,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:02:45,600 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888407725] [2021-10-21 20:02:45,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:02:45,600 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:02:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:02:45,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:02:45,655 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:02:45,656 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888407725] [2021-10-21 20:02:45,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888407725] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:02:45,656 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:02:45,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:02:45,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261993931] [2021-10-21 20:02:45,657 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-21 20:02:45,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:02:45,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:02:45,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:02:45,658 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-21 20:02:45,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:02:45,848 INFO L93 Difference]: Finished difference Result 20226 states and 29954 transitions. [2021-10-21 20:02:45,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:02:45,849 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20226 states and 29954 transitions. [2021-10-21 20:02:46,070 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224 [2021-10-21 20:02:46,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20226 states to 20226 states and 29954 transitions. [2021-10-21 20:02:46,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20226 [2021-10-21 20:02:46,195 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20226 [2021-10-21 20:02:46,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20226 states and 29954 transitions. [2021-10-21 20:02:46,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 20:02:46,271 INFO L681 BuchiCegarLoop]: Abstraction has 20226 states and 29954 transitions. [2021-10-21 20:02:46,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20226 states and 29954 transitions. [2021-10-21 20:02:46,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20226 to 20226. [2021-10-21 20:02:46,860 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-21 20:02:46,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20226 states to 20226 states and 29954 transitions. [2021-10-21 20:02:46,983 INFO L704 BuchiCegarLoop]: Abstraction has 20226 states and 29954 transitions. [2021-10-21 20:02:46,983 INFO L587 BuchiCegarLoop]: Abstraction has 20226 states and 29954 transitions. [2021-10-21 20:02:46,983 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-10-21 20:02:46,983 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20226 states and 29954 transitions. [2021-10-21 20:02:47,064 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224 [2021-10-21 20:02:47,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 20:02:47,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 20:02:47,066 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-21 20:02:47,066 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-21 20:02:47,066 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-21 20:02:47,066 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-21 20:02:47,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:02:47,067 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2021-10-21 20:02:47,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:02:47,067 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211830458] [2021-10-21 20:02:47,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:02:47,068 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:02:47,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:02:47,076 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 20:02:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:02:47,096 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 20:02:47,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:02:47,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1028753029, now seen corresponding path program 1 times [2021-10-21 20:02:47,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:02:47,098 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155430855] [2021-10-21 20:02:47,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:02:47,098 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:02:47,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:02:47,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:02:47,132 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:02:47,133 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155430855] [2021-10-21 20:02:47,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155430855] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:02:47,133 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:02:47,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:02:47,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692070726] [2021-10-21 20:02:47,134 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-21 20:02:47,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:02:47,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:02:47,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:02:47,136 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-21 20:02:47,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:02:47,486 INFO L93 Difference]: Finished difference Result 39938 states and 58370 transitions. [2021-10-21 20:02:47,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:02:47,486 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39938 states and 58370 transitions. [2021-10-21 20:02:47,703 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936 [2021-10-21 20:02:47,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39938 states to 39938 states and 58370 transitions. [2021-10-21 20:02:47,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39938 [2021-10-21 20:02:48,065 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39938 [2021-10-21 20:02:48,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39938 states and 58370 transitions. [2021-10-21 20:02:48,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 20:02:48,100 INFO L681 BuchiCegarLoop]: Abstraction has 39938 states and 58370 transitions. [2021-10-21 20:02:48,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39938 states and 58370 transitions. [2021-10-21 20:02:48,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39938 to 39938. [2021-10-21 20:02:48,747 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-21 20:02:49,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39938 states to 39938 states and 58370 transitions. [2021-10-21 20:02:49,059 INFO L704 BuchiCegarLoop]: Abstraction has 39938 states and 58370 transitions. [2021-10-21 20:02:49,059 INFO L587 BuchiCegarLoop]: Abstraction has 39938 states and 58370 transitions. [2021-10-21 20:02:49,060 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-10-21 20:02:49,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39938 states and 58370 transitions. [2021-10-21 20:02:49,193 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936 [2021-10-21 20:02:49,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 20:02:49,193 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 20:02:49,194 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-21 20:02:49,194 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-21 20:02:49,195 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-21 20:02:49,195 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-21 20:02:49,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:02:49,195 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2021-10-21 20:02:49,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:02:49,196 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310723675] [2021-10-21 20:02:49,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:02:49,196 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:02:49,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:02:49,208 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 20:02:49,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:02:49,231 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 20:02:49,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:02:49,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1677866365, now seen corresponding path program 1 times [2021-10-21 20:02:49,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:02:49,233 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011718122] [2021-10-21 20:02:49,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:02:49,233 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:02:49,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:02:49,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:02:49,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:02:49,401 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011718122] [2021-10-21 20:02:49,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011718122] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:02:49,404 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:02:49,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:02:49,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457633963] [2021-10-21 20:02:49,404 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-21 20:02:49,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:02:49,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:02:49,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:02:49,407 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-21 20:02:49,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:02:49,627 INFO L93 Difference]: Finished difference Result 78850 states and 113666 transitions. [2021-10-21 20:02:49,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:02:49,628 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78850 states and 113666 transitions. [2021-10-21 20:02:50,292 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 78848 [2021-10-21 20:02:50,588 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78850 states to 78850 states and 113666 transitions. [2021-10-21 20:02:50,588 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78850 [2021-10-21 20:02:50,638 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78850 [2021-10-21 20:02:50,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78850 states and 113666 transitions. [2021-10-21 20:02:50,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 20:02:50,707 INFO L681 BuchiCegarLoop]: Abstraction has 78850 states and 113666 transitions. [2021-10-21 20:02:50,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78850 states and 113666 transitions. [2021-10-21 20:02:51,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78850 to 78850. [2021-10-21 20:02:51,777 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-21 20:02:52,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78850 states to 78850 states and 113666 transitions. [2021-10-21 20:02:52,004 INFO L704 BuchiCegarLoop]: Abstraction has 78850 states and 113666 transitions. [2021-10-21 20:02:52,004 INFO L587 BuchiCegarLoop]: Abstraction has 78850 states and 113666 transitions. [2021-10-21 20:02:52,004 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-10-21 20:02:52,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78850 states and 113666 transitions. [2021-10-21 20:02:52,246 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 78848 [2021-10-21 20:02:52,246 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 20:02:52,246 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 20:02:52,248 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-21 20:02:52,248 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-21 20:02:52,248 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-21 20:02:52,248 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-21 20:02:52,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:02:52,249 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2021-10-21 20:02:52,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:02:52,250 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600405398] [2021-10-21 20:02:52,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:02:52,250 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:02:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:02:52,257 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 20:02:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:02:52,266 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 20:02:52,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:02:52,267 INFO L82 PathProgramCache]: Analyzing trace with hash 656798011, now seen corresponding path program 1 times [2021-10-21 20:02:52,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:02:52,267 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901391899] [2021-10-21 20:02:52,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:02:52,268 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:02:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:02:52,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:02:52,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:02:52,287 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901391899] [2021-10-21 20:02:52,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901391899] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:02:52,288 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:02:52,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-21 20:02:52,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345082487] [2021-10-21 20:02:52,289 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-21 20:02:52,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:02:52,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:02:52,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:02:52,290 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-21 20:02:53,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:02:53,117 INFO L93 Difference]: Finished difference Result 155650 states and 221186 transitions. [2021-10-21 20:02:53,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:02:53,118 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155650 states and 221186 transitions. [2021-10-21 20:02:54,135 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 155648 [2021-10-21 20:02:54,570 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155650 states to 155650 states and 221186 transitions. [2021-10-21 20:02:54,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155650 [2021-10-21 20:02:54,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 155650 [2021-10-21 20:02:54,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 155650 states and 221186 transitions. [2021-10-21 20:02:54,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 20:02:54,806 INFO L681 BuchiCegarLoop]: Abstraction has 155650 states and 221186 transitions. [2021-10-21 20:02:54,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155650 states and 221186 transitions. [2021-10-21 20:02:56,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155650 to 155650. [2021-10-21 20:02:56,670 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-21 20:02:57,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155650 states to 155650 states and 221186 transitions. [2021-10-21 20:02:57,628 INFO L704 BuchiCegarLoop]: Abstraction has 155650 states and 221186 transitions. [2021-10-21 20:02:57,629 INFO L587 BuchiCegarLoop]: Abstraction has 155650 states and 221186 transitions. [2021-10-21 20:02:57,629 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-10-21 20:02:57,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 155650 states and 221186 transitions. [2021-10-21 20:02:58,068 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 155648 [2021-10-21 20:02:58,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 20:02:58,068 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 20:02:58,070 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-21 20:02:58,071 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-21 20:02:58,071 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-21 20:02:58,071 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-21 20:02:58,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:02:58,072 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 13 times [2021-10-21 20:02:58,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:02:58,072 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187427588] [2021-10-21 20:02:58,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:02:58,073 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:02:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:02:58,079 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 20:02:58,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:02:58,087 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 20:02:58,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:02:58,088 INFO L82 PathProgramCache]: Analyzing trace with hash -623065667, now seen corresponding path program 1 times [2021-10-21 20:02:58,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:02:58,088 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278199184] [2021-10-21 20:02:58,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:02:58,089 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:02:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:02:58,093 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 20:02:58,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:02:58,101 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 20:02:58,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:02:58,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1839024639, now seen corresponding path program 1 times [2021-10-21 20:02:58,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:02:58,103 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944545673] [2021-10-21 20:02:58,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:02:58,103 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:02:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:02:58,111 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 20:02:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:02:58,124 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 20:02:59,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.10 08:02:59 BoogieIcfgContainer [2021-10-21 20:02:59,052 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-10-21 20:02:59,053 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-21 20:02:59,053 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-21 20:02:59,053 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-21 20:02:59,053 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 08:02:42" (3/4) ... [2021-10-21 20:02:59,056 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-10-21 20:02:59,121 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f3c3b4-801e-482e-bb98-5b70dd593e91/bin/uautomizer-j4sWxH34Be/witness.graphml [2021-10-21 20:02:59,121 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-21 20:02:59,123 INFO L168 Benchmark]: Toolchain (without parser) took 17399.62 ms. Allocated memory was 104.9 MB in the beginning and 10.4 GB in the end (delta: 10.3 GB). Free memory was 70.6 MB in the beginning and 8.9 GB in the end (delta: -8.9 GB). Peak memory consumption was 1.4 GB. Max. memory is 16.1 GB. [2021-10-21 20:02:59,123 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 104.9 MB. Free memory is still 57.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 20:02:59,124 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.46 ms. Allocated memory was 104.9 MB in the beginning and 134.2 MB in the end (delta: 29.4 MB). Free memory was 70.6 MB in the beginning and 107.9 MB in the end (delta: -37.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-21 20:02:59,124 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.73 ms. Allocated memory is still 134.2 MB. Free memory was 107.9 MB in the beginning and 106.7 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 20:02:59,125 INFO L168 Benchmark]: Boogie Preprocessor took 33.69 ms. Allocated memory is still 134.2 MB. Free memory was 106.7 MB in the beginning and 105.2 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-21 20:02:59,125 INFO L168 Benchmark]: RCFGBuilder took 574.53 ms. Allocated memory is still 134.2 MB. Free memory was 105.2 MB in the beginning and 91.8 MB in the end (delta: 13.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-21 20:02:59,126 INFO L168 Benchmark]: BuchiAutomizer took 16383.41 ms. Allocated memory was 134.2 MB in the beginning and 10.4 GB in the end (delta: 10.3 GB). Free memory was 91.8 MB in the beginning and 8.9 GB in the end (delta: -8.8 GB). Peak memory consumption was 1.4 GB. Max. memory is 16.1 GB. [2021-10-21 20:02:59,126 INFO L168 Benchmark]: Witness Printer took 68.59 ms. Allocated memory is still 10.4 GB. Free memory was 8.9 GB in the beginning and 8.9 GB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-21 20:02:59,129 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.24 ms. Allocated memory is still 104.9 MB. Free memory is still 57.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 286.46 ms. Allocated memory was 104.9 MB in the beginning and 134.2 MB in the end (delta: 29.4 MB). Free memory was 70.6 MB in the beginning and 107.9 MB in the end (delta: -37.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 46.73 ms. Allocated memory is still 134.2 MB. Free memory was 107.9 MB in the beginning and 106.7 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 33.69 ms. Allocated memory is still 134.2 MB. Free memory was 106.7 MB in the beginning and 105.2 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 574.53 ms. Allocated memory is still 134.2 MB. Free memory was 105.2 MB in the beginning and 91.8 MB in the end (delta: 13.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 16383.41 ms. Allocated memory was 134.2 MB in the beginning and 10.4 GB in the end (delta: 10.3 GB). Free memory was 91.8 MB in the beginning and 8.9 GB in the end (delta: -8.8 GB). Peak memory consumption was 1.4 GB. Max. memory is 16.1 GB. * Witness Printer took 68.59 ms. Allocated memory is still 10.4 GB. Free memory was 8.9 GB in the beginning and 8.9 GB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (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 16.2s and 13 iterations. TraceHistogramMax:1. Analysis of lassos took 2.2s. Construction of modules took 0.1s. Büchi inclusion checks took 1.8s. Highest rank in rank-based complementation 0. Minimization of det autom 12. Minimization of nondet autom 0. Automata minimization 6557.0ms AutomataMinimizationTime, 12 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 3.7s Buchi closure took 0.2s. 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, 131.6ms 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@d79afb=0, lk14=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@65b1f556=0, p14=0, lk10=0, p12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7557cfba=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@44268a4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2b0d02cf=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@64b25944=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3517690f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2dcb85f9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@11f7d2f9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7b869ed4=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@4c2524cb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@61863e19=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3b37efa=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@2f536077=0, lk4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@38c33a71=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-21 20:02:59,202 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f3c3b4-801e-482e-bb98-5b70dd593e91/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...