./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-alloca-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF --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 a775ba6b744ab5ffb556747687a592ac2a696b9fe34bb3e21dc1471ba5c99e1a --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 06:17:06,953 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 06:17:06,955 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 06:17:07,013 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 06:17:07,014 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 06:17:07,019 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 06:17:07,022 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 06:17:07,027 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 06:17:07,031 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 06:17:07,038 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 06:17:07,039 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 06:17:07,042 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 06:17:07,042 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 06:17:07,046 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 06:17:07,048 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 06:17:07,054 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 06:17:07,056 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 06:17:07,058 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 06:17:07,060 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 06:17:07,071 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 06:17:07,073 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 06:17:07,075 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 06:17:07,080 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 06:17:07,081 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 06:17:07,090 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 06:17:07,090 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 06:17:07,091 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 06:17:07,093 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 06:17:07,094 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 06:17:07,096 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 06:17:07,098 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 06:17:07,099 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 06:17:07,102 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 06:17:07,103 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 06:17:07,106 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 06:17:07,106 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 06:17:07,107 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 06:17:07,107 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 06:17:07,108 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 06:17:07,109 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 06:17:07,110 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 06:17:07,111 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-11-20 06:17:07,176 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 06:17:07,176 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 06:17:07,177 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 06:17:07,177 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 06:17:07,180 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 06:17:07,180 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 06:17:07,180 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 06:17:07,181 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-11-20 06:17:07,181 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-11-20 06:17:07,181 INFO L138 SettingsManager]: * Use old map elimination=false [2021-11-20 06:17:07,182 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-11-20 06:17:07,183 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-11-20 06:17:07,183 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-11-20 06:17:07,183 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 06:17:07,184 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 06:17:07,184 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-20 06:17:07,184 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 06:17:07,184 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 06:17:07,184 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 06:17:07,185 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-11-20 06:17:07,185 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-11-20 06:17:07,185 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-11-20 06:17:07,186 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 06:17:07,186 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 06:17:07,186 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-11-20 06:17:07,186 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 06:17:07,188 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-11-20 06:17:07,189 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 06:17:07,189 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 06:17:07,189 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 06:17:07,189 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-20 06:17:07,190 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 06:17:07,191 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-11-20 06:17:07,191 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_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/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_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF 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 -> a775ba6b744ab5ffb556747687a592ac2a696b9fe34bb3e21dc1471ba5c99e1a [2021-11-20 06:17:07,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 06:17:07,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 06:17:07,592 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 06:17:07,594 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 06:17:07,595 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 06:17:07,597 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-alloca-1.i [2021-11-20 06:17:07,692 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/data/0abafacda/d8536076f9474d02ab203d647db10349/FLAGf04576770 [2021-11-20 06:17:08,344 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 06:17:08,346 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-alloca-1.i [2021-11-20 06:17:08,376 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/data/0abafacda/d8536076f9474d02ab203d647db10349/FLAGf04576770 [2021-11-20 06:17:08,630 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/data/0abafacda/d8536076f9474d02ab203d647db10349 [2021-11-20 06:17:08,633 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 06:17:08,635 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 06:17:08,637 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 06:17:08,637 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 06:17:08,642 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 06:17:08,643 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:17:08" (1/1) ... [2021-11-20 06:17:08,645 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61eabeb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:17:08, skipping insertion in model container [2021-11-20 06:17:08,645 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:17:08" (1/1) ... [2021-11-20 06:17:08,654 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 06:17:08,705 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 06:17:09,127 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 06:17:09,138 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 06:17:09,191 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 06:17:09,235 INFO L208 MainTranslator]: Completed translation [2021-11-20 06:17:09,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:17:09 WrapperNode [2021-11-20 06:17:09,238 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 06:17:09,240 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 06:17:09,240 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 06:17:09,241 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 06:17:09,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:17:09" (1/1) ... [2021-11-20 06:17:09,297 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:17:09" (1/1) ... [2021-11-20 06:17:09,345 INFO L137 Inliner]: procedures = 117, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 97 [2021-11-20 06:17:09,346 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 06:17:09,348 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 06:17:09,348 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 06:17:09,349 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 06:17:09,360 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:17:09" (1/1) ... [2021-11-20 06:17:09,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:17:09" (1/1) ... [2021-11-20 06:17:09,381 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:17:09" (1/1) ... [2021-11-20 06:17:09,381 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:17:09" (1/1) ... [2021-11-20 06:17:09,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:17:09" (1/1) ... [2021-11-20 06:17:09,396 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:17:09" (1/1) ... [2021-11-20 06:17:09,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:17:09" (1/1) ... [2021-11-20 06:17:09,402 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 06:17:09,403 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 06:17:09,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 06:17:09,404 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 06:17:09,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:17:09" (1/1) ... [2021-11-20 06:17:09,429 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:17:09,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:09,459 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:17:09,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-11-20 06:17:09,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-20 06:17:09,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-20 06:17:09,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-20 06:17:09,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-20 06:17:09,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 06:17:09,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 06:17:09,654 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 06:17:09,656 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 06:17:10,016 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 06:17:10,035 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 06:17:10,036 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-20 06:17:10,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:17:10 BoogieIcfgContainer [2021-11-20 06:17:10,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 06:17:10,040 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-11-20 06:17:10,040 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-11-20 06:17:10,045 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-11-20 06:17:10,046 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-20 06:17:10,046 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 06:17:08" (1/3) ... [2021-11-20 06:17:10,048 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@741e2e4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 06:17:10, skipping insertion in model container [2021-11-20 06:17:10,049 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-20 06:17:10,049 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:17:09" (2/3) ... [2021-11-20 06:17:10,050 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@741e2e4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 06:17:10, skipping insertion in model container [2021-11-20 06:17:10,050 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-20 06:17:10,050 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:17:10" (3/3) ... [2021-11-20 06:17:10,052 INFO L388 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca-1.i [2021-11-20 06:17:10,119 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-11-20 06:17:10,119 INFO L360 BuchiCegarLoop]: Hoare is false [2021-11-20 06:17:10,120 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-11-20 06:17:10,120 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-11-20 06:17:10,120 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-11-20 06:17:10,120 INFO L364 BuchiCegarLoop]: Difference is false [2021-11-20 06:17:10,121 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-11-20 06:17:10,121 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-11-20 06:17:10,141 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 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-11-20 06:17:10,168 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 9 [2021-11-20 06:17:10,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:17:10,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:17:10,200 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-11-20 06:17:10,200 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-20 06:17:10,201 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-11-20 06:17:10,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 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-11-20 06:17:10,205 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 9 [2021-11-20 06:17:10,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:17:10,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:17:10,206 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-11-20 06:17:10,206 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-20 06:17:10,215 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 14#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 22#L536true assume !(main_~length~0#1 < 1); 8#L536-2true assume !(main_~n~1#1 < 1); 9#L539-1true call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 5#L545-3true [2021-11-20 06:17:10,216 INFO L793 eck$LassoCheckResult]: Loop: 5#L545-3true assume !!(main_~i~0#1 < main_~length~0#1 - 1);call write~int(main_#t~nondet13#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet13#1; 11#L545-2true main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 5#L545-3true [2021-11-20 06:17:10,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:10,224 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2021-11-20 06:17:10,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:17:10,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139160277] [2021-11-20 06:17:10,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:10,240 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:17:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:17:10,363 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:17:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:17:10,402 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:17:10,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:10,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2021-11-20 06:17:10,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:17:10,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253768664] [2021-11-20 06:17:10,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:10,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:17:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:17:10,421 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:17:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:17:10,432 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:17:10,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:10,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2021-11-20 06:17:10,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:17:10,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283374687] [2021-11-20 06:17:10,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:10,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:17:10,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:17:10,468 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:17:10,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:17:10,498 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:17:11,043 INFO L210 LassoAnalysis]: Preferences: [2021-11-20 06:17:11,044 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-20 06:17:11,044 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-20 06:17:11,044 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-20 06:17:11,044 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-20 06:17:11,045 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:17:11,045 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-20 06:17:11,045 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-20 06:17:11,045 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlcpy-alloca-1.i_Iteration1_Lasso [2021-11-20 06:17:11,046 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-20 06:17:11,046 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-20 06:17:11,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:11,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:11,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:11,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:11,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:11,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:11,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:11,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:11,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:11,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:11,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:11,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:11,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:11,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:11,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:11,752 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-20 06:17:11,757 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-20 06:17:11,760 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:17:11,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:11,763 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:17:11,775 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:17:11,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:17:11,788 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:17:11,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:17:11,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:17:11,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:17:11,792 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:17:11,793 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:17:11,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-11-20 06:17:11,810 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:17:11,855 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2021-11-20 06:17:11,856 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:17:11,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:11,858 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:17:11,871 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:17:11,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-11-20 06:17:11,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:17:11,883 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:17:11,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:17:11,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:17:11,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:17:11,884 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:17:11,885 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:17:11,918 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:17:11,943 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2021-11-20 06:17:11,948 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:17:11,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:11,950 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:17:11,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-11-20 06:17:11,956 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:17:11,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:17:11,966 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:17:11,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:17:11,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:17:11,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:17:11,967 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:17:11,968 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:17:11,980 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:17:12,026 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-11-20 06:17:12,027 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:17:12,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:12,030 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:17:12,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-11-20 06:17:12,042 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:17:12,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:17:12,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:17:12,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:17:12,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:17:12,078 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 06:17:12,078 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 06:17:12,104 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-20 06:17:12,134 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2021-11-20 06:17:12,134 INFO L444 ModelExtractionUtils]: 14 out of 22 variables were initially zero. Simplification set additionally 5 variables to zero. [2021-11-20 06:17:12,136 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:17:12,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:12,142 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:17:12,147 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-20 06:17:12,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-11-20 06:17:12,175 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-11-20 06:17:12,176 INFO L513 LassoAnalysis]: Proved termination. [2021-11-20 06:17:12,177 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~length~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_~length~0#1 Supporting invariants [] [2021-11-20 06:17:12,222 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-11-20 06:17:12,252 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2021-11-20 06:17:12,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:17:12,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-20 06:17:12,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:17:12,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:17:12,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-20 06:17:12,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:17:12,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:17:12,444 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-11-20 06:17:12,445 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 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 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-11-20 06:17:12,544 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 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 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 60 states and 93 transitions. Complement of second has 7 states. [2021-11-20 06:17:12,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-11-20 06:17:12,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-11-20 06:17:12,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2021-11-20 06:17:12,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 63 transitions. Stem has 5 letters. Loop has 2 letters. [2021-11-20 06:17:12,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:17:12,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 63 transitions. Stem has 7 letters. Loop has 2 letters. [2021-11-20 06:17:12,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:17:12,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 63 transitions. Stem has 5 letters. Loop has 4 letters. [2021-11-20 06:17:12,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:17:12,558 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 93 transitions. [2021-11-20 06:17:12,565 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2021-11-20 06:17:12,570 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 20 states and 29 transitions. [2021-11-20 06:17:12,571 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-11-20 06:17:12,572 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2021-11-20 06:17:12,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 29 transitions. [2021-11-20 06:17:12,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:17:12,573 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2021-11-20 06:17:12,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 29 transitions. [2021-11-20 06:17:12,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-11-20 06:17:12,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 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-11-20 06:17:12,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2021-11-20 06:17:12,607 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2021-11-20 06:17:12,608 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2021-11-20 06:17:12,608 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-11-20 06:17:12,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2021-11-20 06:17:12,609 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2021-11-20 06:17:12,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:17:12,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:17:12,610 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:17:12,610 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-20 06:17:12,610 INFO L791 eck$LassoCheckResult]: Stem: 160#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 161#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 172#L536 assume !(main_~length~0#1 < 1); 164#L536-2 assume !(main_~n~1#1 < 1); 165#L539-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 156#L545-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 157#L545-4 main_~i~1#1 := 0; 168#L550-3 [2021-11-20 06:17:12,611 INFO L793 eck$LassoCheckResult]: Loop: 168#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 169#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 168#L550-3 [2021-11-20 06:17:12,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:12,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2021-11-20 06:17:12,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:17:12,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351624007] [2021-11-20 06:17:12,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:12,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:17:12,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:17:12,628 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:17:12,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:17:12,646 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:17:12,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:12,647 INFO L85 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2021-11-20 06:17:12,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:17:12,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625809069] [2021-11-20 06:17:12,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:12,648 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:17:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:17:12,657 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:17:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:17:12,703 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:17:12,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:12,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2021-11-20 06:17:12,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:17:12,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39762374] [2021-11-20 06:17:12,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:12,708 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:17:12,719 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2021-11-20 06:17:12,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:17:12,735 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:17:12,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:17:12,758 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:17:13,228 INFO L210 LassoAnalysis]: Preferences: [2021-11-20 06:17:13,229 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-20 06:17:13,229 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-20 06:17:13,229 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-20 06:17:13,229 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-20 06:17:13,229 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:17:13,229 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-20 06:17:13,229 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-20 06:17:13,229 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlcpy-alloca-1.i_Iteration2_Lasso [2021-11-20 06:17:13,230 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-20 06:17:13,230 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-20 06:17:13,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:13,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:13,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:13,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:13,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:13,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:13,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:13,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:13,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:13,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:13,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:13,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:13,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:13,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:13,837 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-20 06:17:13,849 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-20 06:17:13,849 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:17:13,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:13,851 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:17:13,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-11-20 06:17:13,863 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:17:13,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:17:13,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:17:13,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:17:13,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:17:13,878 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 06:17:13,878 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 06:17:13,898 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:17:13,933 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-11-20 06:17:13,933 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:17:13,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:13,950 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:17:13,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-11-20 06:17:13,956 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:17:13,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:17:13,971 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:17:13,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:17:13,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:17:13,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:17:13,973 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:17:13,973 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:17:13,980 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:17:14,006 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-11-20 06:17:14,006 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:17:14,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:14,008 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:17:14,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-11-20 06:17:14,013 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:17:14,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:17:14,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:17:14,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:17:14,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:17:14,029 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 06:17:14,030 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 06:17:14,063 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:17:14,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-11-20 06:17:14,095 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:17:14,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:14,097 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:17:14,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:17:14,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:17:14,125 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:17:14,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:17:14,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:17:14,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:17:14,127 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:17:14,127 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:17:14,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-11-20 06:17:14,150 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:17:14,192 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-11-20 06:17:14,193 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:17:14,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:14,194 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:17:14,203 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:17:14,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:17:14,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:17:14,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:17:14,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:17:14,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-11-20 06:17:14,227 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 06:17:14,227 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 06:17:14,262 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-20 06:17:14,313 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2021-11-20 06:17:14,313 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2021-11-20 06:17:14,314 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:17:14,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:14,318 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:17:14,358 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-20 06:17:14,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-11-20 06:17:14,379 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-11-20 06:17:14,379 INFO L513 LassoAnalysis]: Proved termination. [2021-11-20 06:17:14,379 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, v_rep(select #length ULTIMATE.start_main_~nondetString1~0#1.base)_1) = -1*ULTIMATE.start_main_~i~1#1 + 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0#1.base)_1 Supporting invariants [1*ULTIMATE.start_main_~nondetString1~0#1.offset >= 0] [2021-11-20 06:17:14,409 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2021-11-20 06:17:14,432 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2021-11-20 06:17:14,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:14,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:17:14,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-20 06:17:14,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:17:14,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:17:14,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-20 06:17:14,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:17:14,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:17:14,635 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2021-11-20 06:17:14,635 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:17:14,720 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 13. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 48 transitions. Complement of second has 7 states. [2021-11-20 06:17:14,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2021-11-20 06:17:14,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:17:14,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2021-11-20 06:17:14,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2021-11-20 06:17:14,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:17:14,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 9 letters. Loop has 2 letters. [2021-11-20 06:17:14,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:17:14,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 7 letters. Loop has 4 letters. [2021-11-20 06:17:14,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:17:14,725 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 48 transitions. [2021-11-20 06:17:14,728 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-11-20 06:17:14,729 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 31 transitions. [2021-11-20 06:17:14,729 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2021-11-20 06:17:14,730 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-11-20 06:17:14,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 31 transitions. [2021-11-20 06:17:14,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:17:14,731 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 31 transitions. [2021-11-20 06:17:14,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 31 transitions. [2021-11-20 06:17:14,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-11-20 06:17:14,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 20 states have internal predecessors, (31), 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-11-20 06:17:14,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2021-11-20 06:17:14,735 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 31 transitions. [2021-11-20 06:17:14,735 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 31 transitions. [2021-11-20 06:17:14,735 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-11-20 06:17:14,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 31 transitions. [2021-11-20 06:17:14,737 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-11-20 06:17:14,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:17:14,737 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:17:14,738 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:17:14,738 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-11-20 06:17:14,739 INFO L791 eck$LassoCheckResult]: Stem: 296#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 297#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 309#L536 assume !(main_~length~0#1 < 1); 300#L536-2 assume !(main_~n~1#1 < 1); 301#L539-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 292#L545-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 293#L545-4 main_~i~1#1 := 0; 306#L550-3 assume !(main_~i~1#1 < main_~n~1#1 - 1); 302#L550-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~n~1#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset, cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset, cstrlcpy_#in~siz#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~1#1;havoc cstrlcpy_#res#1;havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, cstrlcpy_#t~mem5#1, cstrlcpy_#t~pre2#1, cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, cstrlcpy_#t~mem7#1, cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset, cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset, cstrlcpy_~siz#1, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset, cstrlcpy_~n~0#1;cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset := cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset;cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset := cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset;cstrlcpy_~siz#1 := cstrlcpy_#in~siz#1;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset;cstrlcpy_~n~0#1 := cstrlcpy_~siz#1; 303#L519 assume 0 != cstrlcpy_~n~0#1 % 4294967296; 298#L520-3 [2021-11-20 06:17:14,739 INFO L793 eck$LassoCheckResult]: Loop: 298#L520-3 cstrlcpy_#t~pre2#1 := cstrlcpy_~n~0#1 - 1;cstrlcpy_~n~0#1 := cstrlcpy_~n~0#1 - 1; 299#L520-1 assume !!(0 != cstrlcpy_#t~pre2#1 % 4294967296);havoc cstrlcpy_#t~pre2#1;cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset := cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_#t~post3#1.base, 1 + cstrlcpy_#t~post3#1.offset;cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset := cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_#t~post4#1.base, 1 + cstrlcpy_#t~post4#1.offset;call cstrlcpy_#t~mem5#1 := read~int(cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, 1);call write~int(cstrlcpy_#t~mem5#1, cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, 1); 310#L521 assume !(0 == cstrlcpy_#t~mem5#1);havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset;havoc cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset;havoc cstrlcpy_#t~mem5#1; 298#L520-3 [2021-11-20 06:17:14,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:14,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1595220888, now seen corresponding path program 1 times [2021-11-20 06:17:14,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:17:14,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371088216] [2021-11-20 06:17:14,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:14,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:17:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:17:14,786 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:17:14,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:17:14,847 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:17:14,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:14,850 INFO L85 PathProgramCache]: Analyzing trace with hash 80599, now seen corresponding path program 1 times [2021-11-20 06:17:14,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:17:14,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115160879] [2021-11-20 06:17:14,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:14,851 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:17:14,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:17:14,885 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:17:14,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:17:14,901 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:17:14,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:14,902 INFO L85 PathProgramCache]: Analyzing trace with hash -587605024, now seen corresponding path program 1 times [2021-11-20 06:17:14,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:17:14,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620846857] [2021-11-20 06:17:14,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:14,903 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:17:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:17:15,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:17:15,137 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:17:15,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620846857] [2021-11-20 06:17:15,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620846857] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:17:15,139 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:17:15,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 06:17:15,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702333472] [2021-11-20 06:17:15,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:17:15,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:17:15,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 06:17:15,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-20 06:17:15,348 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. cyclomatic complexity: 14 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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-11-20 06:17:15,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:17:15,495 INFO L93 Difference]: Finished difference Result 36 states and 49 transitions. [2021-11-20 06:17:15,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 06:17:15,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 49 transitions. [2021-11-20 06:17:15,506 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2021-11-20 06:17:15,507 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 49 transitions. [2021-11-20 06:17:15,507 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2021-11-20 06:17:15,508 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2021-11-20 06:17:15,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 49 transitions. [2021-11-20 06:17:15,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:17:15,508 INFO L681 BuchiCegarLoop]: Abstraction has 36 states and 49 transitions. [2021-11-20 06:17:15,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 49 transitions. [2021-11-20 06:17:15,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2021-11-20 06:17:15,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 30 states have internal predecessors, (43), 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-11-20 06:17:15,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2021-11-20 06:17:15,513 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 43 transitions. [2021-11-20 06:17:15,513 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 43 transitions. [2021-11-20 06:17:15,513 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-11-20 06:17:15,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 43 transitions. [2021-11-20 06:17:15,520 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-11-20 06:17:15,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:17:15,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:17:15,521 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:17:15,521 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-11-20 06:17:15,522 INFO L791 eck$LassoCheckResult]: Stem: 371#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 372#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 388#L536 assume !(main_~length~0#1 < 1); 375#L536-2 assume !(main_~n~1#1 < 1); 377#L539-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 367#L545-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 368#L545-4 main_~i~1#1 := 0; 393#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 385#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 384#L550-3 assume !(main_~i~1#1 < main_~n~1#1 - 1); 378#L550-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~n~1#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset, cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset, cstrlcpy_#in~siz#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~1#1;havoc cstrlcpy_#res#1;havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, cstrlcpy_#t~mem5#1, cstrlcpy_#t~pre2#1, cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, cstrlcpy_#t~mem7#1, cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset, cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset, cstrlcpy_~siz#1, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset, cstrlcpy_~n~0#1;cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset := cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset;cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset := cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset;cstrlcpy_~siz#1 := cstrlcpy_#in~siz#1;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset;cstrlcpy_~n~0#1 := cstrlcpy_~siz#1; 379#L519 assume 0 != cstrlcpy_~n~0#1 % 4294967296; 373#L520-3 [2021-11-20 06:17:15,522 INFO L793 eck$LassoCheckResult]: Loop: 373#L520-3 cstrlcpy_#t~pre2#1 := cstrlcpy_~n~0#1 - 1;cstrlcpy_~n~0#1 := cstrlcpy_~n~0#1 - 1; 374#L520-1 assume !!(0 != cstrlcpy_#t~pre2#1 % 4294967296);havoc cstrlcpy_#t~pre2#1;cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset := cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_#t~post3#1.base, 1 + cstrlcpy_#t~post3#1.offset;cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset := cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_#t~post4#1.base, 1 + cstrlcpy_#t~post4#1.offset;call cstrlcpy_#t~mem5#1 := read~int(cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, 1);call write~int(cstrlcpy_#t~mem5#1, cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, 1); 389#L521 assume !(0 == cstrlcpy_#t~mem5#1);havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset;havoc cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset;havoc cstrlcpy_#t~mem5#1; 373#L520-3 [2021-11-20 06:17:15,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:15,522 INFO L85 PathProgramCache]: Analyzing trace with hash -294332618, now seen corresponding path program 1 times [2021-11-20 06:17:15,523 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:17:15,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211887907] [2021-11-20 06:17:15,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:15,526 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:17:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:17:15,575 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:17:15,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:17:15,619 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:17:15,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:15,620 INFO L85 PathProgramCache]: Analyzing trace with hash 80599, now seen corresponding path program 2 times [2021-11-20 06:17:15,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:17:15,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72177500] [2021-11-20 06:17:15,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:15,621 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:17:15,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:17:15,637 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:17:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:17:15,654 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:17:15,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:15,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1860246402, now seen corresponding path program 1 times [2021-11-20 06:17:15,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:17:15,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774476364] [2021-11-20 06:17:15,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:15,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:17:15,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:17:15,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 06:17:15,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:17:15,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774476364] [2021-11-20 06:17:15,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774476364] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:17:15,876 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:17:15,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 06:17:15,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016715311] [2021-11-20 06:17:15,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:17:16,112 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-11-20 06:17:16,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:17:16,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 06:17:16,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-20 06:17:16,118 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. cyclomatic complexity: 17 Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:17:16,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:17:16,228 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2021-11-20 06:17:16,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 06:17:16,229 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 73 transitions. [2021-11-20 06:17:16,231 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2021-11-20 06:17:16,234 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 73 transitions. [2021-11-20 06:17:16,234 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2021-11-20 06:17:16,235 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2021-11-20 06:17:16,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 73 transitions. [2021-11-20 06:17:16,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:17:16,236 INFO L681 BuchiCegarLoop]: Abstraction has 55 states and 73 transitions. [2021-11-20 06:17:16,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 73 transitions. [2021-11-20 06:17:16,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2021-11-20 06:17:16,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.4) internal successors, (56), 39 states have internal predecessors, (56), 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-11-20 06:17:16,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2021-11-20 06:17:16,254 INFO L704 BuchiCegarLoop]: Abstraction has 40 states and 56 transitions. [2021-11-20 06:17:16,254 INFO L587 BuchiCegarLoop]: Abstraction has 40 states and 56 transitions. [2021-11-20 06:17:16,254 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-11-20 06:17:16,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 56 transitions. [2021-11-20 06:17:16,255 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-11-20 06:17:16,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:17:16,260 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:17:16,261 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:17:16,261 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-20 06:17:16,262 INFO L791 eck$LassoCheckResult]: Stem: 473#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 474#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 491#L536 assume !(main_~length~0#1 < 1); 477#L536-2 assume main_~n~1#1 < 1;main_~n~1#1 := 1; 478#L539-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 469#L545-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 470#L545-4 main_~i~1#1 := 0; 485#L550-3 assume !(main_~i~1#1 < main_~n~1#1 - 1); 481#L550-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~n~1#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset, cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset, cstrlcpy_#in~siz#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~1#1;havoc cstrlcpy_#res#1;havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, cstrlcpy_#t~mem5#1, cstrlcpy_#t~pre2#1, cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, cstrlcpy_#t~mem7#1, cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset, cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset, cstrlcpy_~siz#1, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset, cstrlcpy_~n~0#1;cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset := cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset;cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset := cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset;cstrlcpy_~siz#1 := cstrlcpy_#in~siz#1;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset;cstrlcpy_~n~0#1 := cstrlcpy_~siz#1; 482#L519 assume 0 != cstrlcpy_~n~0#1 % 4294967296; 475#L520-3 cstrlcpy_#t~pre2#1 := cstrlcpy_~n~0#1 - 1;cstrlcpy_~n~0#1 := cstrlcpy_~n~0#1 - 1; 476#L520-1 assume !(0 != cstrlcpy_#t~pre2#1 % 4294967296);havoc cstrlcpy_#t~pre2#1; 493#L519-1 assume 0 == cstrlcpy_~n~0#1 % 4294967296; 494#L526 assume !(0 != cstrlcpy_~siz#1 % 4294967296); 489#L528-2 [2021-11-20 06:17:16,262 INFO L793 eck$LassoCheckResult]: Loop: 489#L528-2 cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset := cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_#t~post6#1.base, 1 + cstrlcpy_#t~post6#1.offset;call cstrlcpy_#t~mem7#1 := read~int(cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, 1); 490#L528 assume !!(0 != cstrlcpy_#t~mem7#1);havoc cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset;havoc cstrlcpy_#t~mem7#1; 489#L528-2 [2021-11-20 06:17:16,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:16,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1736952706, now seen corresponding path program 1 times [2021-11-20 06:17:16,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:17:16,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496547401] [2021-11-20 06:17:16,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:16,265 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:17:16,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:17:16,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:17:16,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:17:16,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496547401] [2021-11-20 06:17:16,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496547401] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:17:16,389 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:17:16,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 06:17:16,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003471187] [2021-11-20 06:17:16,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:17:16,391 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-20 06:17:16,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:16,391 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 1 times [2021-11-20 06:17:16,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:17:16,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173744374] [2021-11-20 06:17:16,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:16,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:17:16,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:17:16,397 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:17:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:17:16,409 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:17:16,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:17:16,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 06:17:16,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-20 06:17:16,468 INFO L87 Difference]: Start difference. First operand 40 states and 56 transitions. cyclomatic complexity: 22 Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:17:16,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:17:16,517 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2021-11-20 06:17:16,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 06:17:16,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 63 transitions. [2021-11-20 06:17:16,525 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 9 [2021-11-20 06:17:16,527 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 63 transitions. [2021-11-20 06:17:16,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2021-11-20 06:17:16,531 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2021-11-20 06:17:16,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 63 transitions. [2021-11-20 06:17:16,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:17:16,533 INFO L681 BuchiCegarLoop]: Abstraction has 47 states and 63 transitions. [2021-11-20 06:17:16,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 63 transitions. [2021-11-20 06:17:16,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2021-11-20 06:17:16,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.380952380952381) internal successors, (58), 41 states have internal predecessors, (58), 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-11-20 06:17:16,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2021-11-20 06:17:16,552 INFO L704 BuchiCegarLoop]: Abstraction has 42 states and 58 transitions. [2021-11-20 06:17:16,552 INFO L587 BuchiCegarLoop]: Abstraction has 42 states and 58 transitions. [2021-11-20 06:17:16,552 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-11-20 06:17:16,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 58 transitions. [2021-11-20 06:17:16,553 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-11-20 06:17:16,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:17:16,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:17:16,555 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:17:16,555 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-20 06:17:16,556 INFO L791 eck$LassoCheckResult]: Stem: 569#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 570#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 585#L536 assume !(main_~length~0#1 < 1); 573#L536-2 assume main_~n~1#1 < 1;main_~n~1#1 := 1; 574#L539-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 576#L545-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 589#L545-4 main_~i~1#1 := 0; 579#L550-3 assume !(main_~i~1#1 < main_~n~1#1 - 1); 577#L550-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~n~1#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset, cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset, cstrlcpy_#in~siz#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~1#1;havoc cstrlcpy_#res#1;havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, cstrlcpy_#t~mem5#1, cstrlcpy_#t~pre2#1, cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, cstrlcpy_#t~mem7#1, cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset, cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset, cstrlcpy_~siz#1, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset, cstrlcpy_~n~0#1;cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset := cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset;cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset := cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset;cstrlcpy_~siz#1 := cstrlcpy_#in~siz#1;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset;cstrlcpy_~n~0#1 := cstrlcpy_~siz#1; 578#L519 assume 0 != cstrlcpy_~n~0#1 % 4294967296; 571#L520-3 cstrlcpy_#t~pre2#1 := cstrlcpy_~n~0#1 - 1;cstrlcpy_~n~0#1 := cstrlcpy_~n~0#1 - 1; 572#L520-1 assume !(0 != cstrlcpy_#t~pre2#1 % 4294967296);havoc cstrlcpy_#t~pre2#1; 587#L519-1 assume 0 == cstrlcpy_~n~0#1 % 4294967296; 588#L526 assume 0 != cstrlcpy_~siz#1 % 4294967296;call write~int(0, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, 1); 583#L528-2 [2021-11-20 06:17:16,556 INFO L793 eck$LassoCheckResult]: Loop: 583#L528-2 cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset := cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_#t~post6#1.base, 1 + cstrlcpy_#t~post6#1.offset;call cstrlcpy_#t~mem7#1 := read~int(cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, 1); 584#L528 assume !!(0 != cstrlcpy_#t~mem7#1);havoc cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset;havoc cstrlcpy_#t~mem7#1; 583#L528-2 [2021-11-20 06:17:16,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:16,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1736952708, now seen corresponding path program 1 times [2021-11-20 06:17:16,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:17:16,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109921458] [2021-11-20 06:17:16,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:16,558 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:17:16,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:17:16,596 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:17:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:17:16,623 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:17:16,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:16,624 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 2 times [2021-11-20 06:17:16,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:17:16,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592099107] [2021-11-20 06:17:16,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:16,625 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:17:16,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:17:16,630 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:17:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:17:16,636 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:17:16,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:16,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1530728321, now seen corresponding path program 1 times [2021-11-20 06:17:16,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:17:16,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906739550] [2021-11-20 06:17:16,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:16,637 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:17:16,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:17:16,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:17:16,885 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:17:16,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906739550] [2021-11-20 06:17:16,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906739550] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:17:16,886 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:17:16,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 06:17:16,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857766912] [2021-11-20 06:17:16,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:17:16,949 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:17:16,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-20 06:17:16,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-20 06:17:16,951 INFO L87 Difference]: Start difference. First operand 42 states and 58 transitions. cyclomatic complexity: 22 Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:17:17,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:17:17,082 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2021-11-20 06:17:17,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 06:17:17,084 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 76 transitions. [2021-11-20 06:17:17,088 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2021-11-20 06:17:17,089 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 48 states and 60 transitions. [2021-11-20 06:17:17,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2021-11-20 06:17:17,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2021-11-20 06:17:17,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 60 transitions. [2021-11-20 06:17:17,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:17:17,090 INFO L681 BuchiCegarLoop]: Abstraction has 48 states and 60 transitions. [2021-11-20 06:17:17,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 60 transitions. [2021-11-20 06:17:17,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2021-11-20 06:17:17,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 41 states have internal predecessors, (54), 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-11-20 06:17:17,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2021-11-20 06:17:17,098 INFO L704 BuchiCegarLoop]: Abstraction has 42 states and 54 transitions. [2021-11-20 06:17:17,098 INFO L587 BuchiCegarLoop]: Abstraction has 42 states and 54 transitions. [2021-11-20 06:17:17,098 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-11-20 06:17:17,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 54 transitions. [2021-11-20 06:17:17,099 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-11-20 06:17:17,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:17:17,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:17:17,104 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:17:17,105 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-11-20 06:17:17,105 INFO L791 eck$LassoCheckResult]: Stem: 688#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 689#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 705#L536 assume !(main_~length~0#1 < 1); 692#L536-2 assume !(main_~n~1#1 < 1); 694#L539-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 695#L545-3 assume !!(main_~i~0#1 < main_~length~0#1 - 1);call write~int(main_#t~nondet13#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet13#1; 687#L545-2 main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 685#L545-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 686#L545-4 main_~i~1#1 := 0; 713#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 710#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 711#L550-3 assume !(main_~i~1#1 < main_~n~1#1 - 1); 718#L550-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~n~1#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset, cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset, cstrlcpy_#in~siz#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~1#1;havoc cstrlcpy_#res#1;havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, cstrlcpy_#t~mem5#1, cstrlcpy_#t~pre2#1, cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, cstrlcpy_#t~mem7#1, cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset, cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset, cstrlcpy_~siz#1, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset, cstrlcpy_~n~0#1;cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset := cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset;cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset := cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset;cstrlcpy_~siz#1 := cstrlcpy_#in~siz#1;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset;cstrlcpy_~n~0#1 := cstrlcpy_~siz#1; 716#L519 assume 0 != cstrlcpy_~n~0#1 % 4294967296; 717#L520-3 [2021-11-20 06:17:17,105 INFO L793 eck$LassoCheckResult]: Loop: 717#L520-3 cstrlcpy_#t~pre2#1 := cstrlcpy_~n~0#1 - 1;cstrlcpy_~n~0#1 := cstrlcpy_~n~0#1 - 1; 721#L520-1 assume !!(0 != cstrlcpy_#t~pre2#1 % 4294967296);havoc cstrlcpy_#t~pre2#1;cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset := cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_#t~post3#1.base, 1 + cstrlcpy_#t~post3#1.offset;cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset := cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_#t~post4#1.base, 1 + cstrlcpy_#t~post4#1.offset;call cstrlcpy_#t~mem5#1 := read~int(cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, 1);call write~int(cstrlcpy_#t~mem5#1, cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, 1); 722#L521 assume !(0 == cstrlcpy_#t~mem5#1);havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset;havoc cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset;havoc cstrlcpy_#t~mem5#1; 717#L520-3 [2021-11-20 06:17:17,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:17,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1313217428, now seen corresponding path program 1 times [2021-11-20 06:17:17,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:17:17,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696570977] [2021-11-20 06:17:17,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:17,107 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:17:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:17:17,132 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:17:17,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:17:17,177 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:17:17,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:17,188 INFO L85 PathProgramCache]: Analyzing trace with hash 80599, now seen corresponding path program 3 times [2021-11-20 06:17:17,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:17:17,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169480095] [2021-11-20 06:17:17,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:17,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:17:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:17:17,201 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:17:17,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:17:17,210 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:17:17,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:17,211 INFO L85 PathProgramCache]: Analyzing trace with hash -796650908, now seen corresponding path program 1 times [2021-11-20 06:17:17,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:17:17,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712978980] [2021-11-20 06:17:17,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:17,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:17:17,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:17:17,231 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:17:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:17:17,258 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:17:18,875 INFO L210 LassoAnalysis]: Preferences: [2021-11-20 06:17:18,876 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-20 06:17:18,876 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-20 06:17:18,876 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-20 06:17:18,876 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-20 06:17:18,876 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:17:18,876 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-20 06:17:18,876 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-20 06:17:18,876 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlcpy-alloca-1.i_Iteration7_Lasso [2021-11-20 06:17:18,877 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-20 06:17:18,877 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-20 06:17:18,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:18,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:18,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:18,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:18,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:18,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:18,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:18,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:18,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:18,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:18,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:18,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:18,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:18,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:18,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:18,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:18,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:18,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:18,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:18,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:18,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:18,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:18,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:18,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:17:20,379 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-20 06:17:20,379 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-20 06:17:20,380 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:17:20,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:20,388 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:17:20,395 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:17:20,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:17:20,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:17:20,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:17:20,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:17:20,411 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 06:17:20,411 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 06:17:20,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-11-20 06:17:20,418 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:17:20,465 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-11-20 06:17:20,466 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:17:20,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:20,467 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:17:20,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-11-20 06:17:20,473 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:17:20,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:17:20,484 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:17:20,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:17:20,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:17:20,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:17:20,484 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:17:20,485 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:17:20,486 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:17:20,517 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-11-20 06:17:20,517 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:17:20,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:20,518 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:17:20,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-11-20 06:17:20,523 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:17:20,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:17:20,531 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:17:20,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:17:20,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:17:20,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:17:20,532 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:17:20,532 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:17:20,538 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:17:20,562 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-11-20 06:17:20,563 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:17:20,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:20,564 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:17:20,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-11-20 06:17:20,568 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:17:20,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:17:20,577 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:17:20,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:17:20,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:17:20,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:17:20,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:17:20,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:17:20,580 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:17:20,606 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-11-20 06:17:20,607 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:17:20,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:20,608 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:17:20,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-11-20 06:17:20,616 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:17:20,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:17:20,625 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:17:20,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:17:20,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:17:20,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:17:20,626 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:17:20,626 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:17:20,627 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:17:20,656 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2021-11-20 06:17:20,656 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:17:20,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:20,658 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:17:20,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-11-20 06:17:20,663 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:17:20,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:17:20,672 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:17:20,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:17:20,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:17:20,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:17:20,673 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:17:20,673 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:17:20,674 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:17:20,702 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-11-20 06:17:20,702 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:17:20,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:20,704 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:17:20,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-11-20 06:17:20,706 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:17:20,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:17:20,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:17:20,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:17:20,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:17:20,717 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 06:17:20,717 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 06:17:20,720 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:17:20,748 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-11-20 06:17:20,749 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:17:20,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:20,750 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:17:20,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-11-20 06:17:20,753 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:17:20,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:17:20,762 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:17:20,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:17:20,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:17:20,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:17:20,762 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:17:20,763 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:17:20,770 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:17:20,795 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-11-20 06:17:20,795 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:17:20,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:20,796 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:17:20,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-11-20 06:17:20,806 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:17:20,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:17:20,815 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:17:20,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:17:20,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:17:20,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:17:20,816 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:17:20,816 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:17:20,817 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:17:20,845 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2021-11-20 06:17:20,846 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:17:20,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:20,847 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:17:20,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-11-20 06:17:20,848 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:17:20,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:17:20,858 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:17:20,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:17:20,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:17:20,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:17:20,859 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:17:20,859 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:17:20,860 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:17:20,886 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2021-11-20 06:17:20,886 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:17:20,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:20,887 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:17:20,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-11-20 06:17:20,889 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:17:20,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:17:20,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:17:20,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:17:20,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:17:20,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:17:20,899 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:17:20,899 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:17:20,900 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:17:20,925 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2021-11-20 06:17:20,925 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:17:20,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:20,926 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:17:20,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-11-20 06:17:20,928 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:17:20,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:17:20,939 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:17:20,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:17:20,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:17:20,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:17:20,939 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:17:20,939 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:17:20,965 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:17:20,989 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2021-11-20 06:17:20,989 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:17:20,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:20,990 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:17:20,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-11-20 06:17:20,992 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:17:21,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:17:21,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:17:21,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:17:21,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:17:21,004 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 06:17:21,004 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 06:17:21,007 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:17:21,030 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2021-11-20 06:17:21,031 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:17:21,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:21,032 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:17:21,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-11-20 06:17:21,034 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:17:21,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:17:21,043 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:17:21,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:17:21,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:17:21,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:17:21,043 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:17:21,043 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:17:21,069 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:17:21,093 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-11-20 06:17:21,093 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:17:21,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:21,095 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:17:21,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:17:21,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-11-20 06:17:21,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:17:21,105 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:17:21,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:17:21,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:17:21,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:17:21,106 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:17:21,106 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:17:21,107 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:17:21,131 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2021-11-20 06:17:21,131 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:17:21,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:21,132 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:17:21,135 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:17:21,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-11-20 06:17:21,144 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:17:21,144 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:17:21,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:17:21,144 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:17:21,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:17:21,145 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:17:21,145 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:17:21,146 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:17:21,172 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2021-11-20 06:17:21,172 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:17:21,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:21,173 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:17:21,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-11-20 06:17:21,177 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:17:21,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:17:21,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:17:21,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:17:21,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:17:21,189 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 06:17:21,189 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 06:17:21,219 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:17:21,244 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2021-11-20 06:17:21,244 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:17:21,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:21,245 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:17:21,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-11-20 06:17:21,247 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:17:21,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:17:21,257 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:17:21,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:17:21,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:17:21,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:17:21,258 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:17:21,258 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:17:21,260 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:17:21,284 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2021-11-20 06:17:21,284 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:17:21,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:21,285 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:17:21,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-11-20 06:17:21,287 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:17:21,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:17:21,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:17:21,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:17:21,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:17:21,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:17:21,299 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:17:21,299 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:17:21,318 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:17:21,359 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2021-11-20 06:17:21,360 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:17:21,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:21,361 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:17:21,367 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:17:21,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:17:21,378 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:17:21,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:17:21,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:17:21,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:17:21,379 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:17:21,379 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:17:21,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-11-20 06:17:21,398 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:17:21,443 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2021-11-20 06:17:21,443 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:17:21,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:21,446 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:17:21,449 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:17:21,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:17:21,460 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:17:21,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:17:21,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:17:21,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:17:21,461 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:17:21,461 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:17:21,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-11-20 06:17:21,474 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:17:21,507 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2021-11-20 06:17:21,507 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:17:21,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:21,508 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:17:21,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-11-20 06:17:21,510 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:17:21,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:17:21,519 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:17:21,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:17:21,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:17:21,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:17:21,520 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:17:21,520 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:17:21,532 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:17:21,556 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2021-11-20 06:17:21,556 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:17:21,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:21,558 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:17:21,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2021-11-20 06:17:21,559 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:17:21,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:17:21,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:17:21,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:17:21,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:17:21,569 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 06:17:21,569 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 06:17:21,593 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:17:21,617 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2021-11-20 06:17:21,617 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:17:21,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:21,618 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:17:21,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:17:21,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2021-11-20 06:17:21,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:17:21,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:17:21,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:17:21,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:17:21,661 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 06:17:21,662 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 06:17:21,688 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-20 06:17:21,737 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2021-11-20 06:17:21,738 INFO L444 ModelExtractionUtils]: 6 out of 31 variables were initially zero. Simplification set additionally 22 variables to zero. [2021-11-20 06:17:21,738 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:17:21,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:21,742 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:17:21,746 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-20 06:17:21,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-11-20 06:17:21,778 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-11-20 06:17:21,779 INFO L513 LassoAnalysis]: Proved termination. [2021-11-20 06:17:21,779 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc11#1.base)_3, ULTIMATE.start_cstrlcpy_~s~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11#1.base)_3 - 1*ULTIMATE.start_cstrlcpy_~s~0#1.offset Supporting invariants [] [2021-11-20 06:17:21,809 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2021-11-20 06:17:21,870 INFO L297 tatePredicateManager]: 13 out of 14 supporting invariants were superfluous and have been removed [2021-11-20 06:17:21,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:21,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:17:21,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-20 06:17:21,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:17:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:17:22,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-20 06:17:22,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:17:22,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:17:22,115 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2021-11-20 06:17:22,115 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 54 transitions. cyclomatic complexity: 18 Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:17:22,191 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 54 transitions. cyclomatic complexity: 18. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 55 states and 71 transitions. Complement of second has 6 states. [2021-11-20 06:17:22,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2021-11-20 06:17:22,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:17:22,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2021-11-20 06:17:22,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 14 letters. Loop has 3 letters. [2021-11-20 06:17:22,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:17:22,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 17 letters. Loop has 3 letters. [2021-11-20 06:17:22,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:17:22,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 14 letters. Loop has 6 letters. [2021-11-20 06:17:22,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:17:22,196 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 71 transitions. [2021-11-20 06:17:22,197 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-20 06:17:22,198 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 18 states and 22 transitions. [2021-11-20 06:17:22,199 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-20 06:17:22,199 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-20 06:17:22,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2021-11-20 06:17:22,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:17:22,200 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-11-20 06:17:22,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2021-11-20 06:17:22,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-11-20 06:17:22,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 states have internal predecessors, (22), 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-11-20 06:17:22,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-11-20 06:17:22,202 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-11-20 06:17:22,203 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-11-20 06:17:22,203 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-11-20 06:17:22,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 22 transitions. [2021-11-20 06:17:22,203 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-20 06:17:22,204 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:17:22,204 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:17:22,204 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:17:22,205 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-20 06:17:22,205 INFO L791 eck$LassoCheckResult]: Stem: 922#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 923#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 933#L536 assume !(main_~length~0#1 < 1); 924#L536-2 assume !(main_~n~1#1 < 1); 925#L539-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 918#L545-3 assume !!(main_~i~0#1 < main_~length~0#1 - 1);call write~int(main_#t~nondet13#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet13#1; 919#L545-2 main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 920#L545-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 921#L545-4 main_~i~1#1 := 0; 928#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 929#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 930#L550-3 assume !(main_~i~1#1 < main_~n~1#1 - 1); 926#L550-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~n~1#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset, cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset, cstrlcpy_#in~siz#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~1#1;havoc cstrlcpy_#res#1;havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, cstrlcpy_#t~mem5#1, cstrlcpy_#t~pre2#1, cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, cstrlcpy_#t~mem7#1, cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset, cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset, cstrlcpy_~siz#1, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset, cstrlcpy_~n~0#1;cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset := cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset;cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset := cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset;cstrlcpy_~siz#1 := cstrlcpy_#in~siz#1;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset;cstrlcpy_~n~0#1 := cstrlcpy_~siz#1; 927#L519 assume !(0 != cstrlcpy_~n~0#1 % 4294967296); 935#L519-1 assume 0 == cstrlcpy_~n~0#1 % 4294967296; 934#L526 assume !(0 != cstrlcpy_~siz#1 % 4294967296); 931#L528-2 [2021-11-20 06:17:22,205 INFO L793 eck$LassoCheckResult]: Loop: 931#L528-2 cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset := cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_#t~post6#1.base, 1 + cstrlcpy_#t~post6#1.offset;call cstrlcpy_#t~mem7#1 := read~int(cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, 1); 932#L528 assume !!(0 != cstrlcpy_#t~mem7#1);havoc cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset;havoc cstrlcpy_#t~mem7#1; 931#L528-2 [2021-11-20 06:17:22,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:22,206 INFO L85 PathProgramCache]: Analyzing trace with hash -718415251, now seen corresponding path program 1 times [2021-11-20 06:17:22,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:17:22,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207768884] [2021-11-20 06:17:22,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:22,206 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:17:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:17:22,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 06:17:22,306 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:17:22,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207768884] [2021-11-20 06:17:22,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207768884] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:17:22,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872742619] [2021-11-20 06:17:22,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:22,308 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:17:22,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:22,309 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:17:22,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2021-11-20 06:17:22,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:17:22,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-20 06:17:22,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:17:22,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 06:17:22,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:17:22,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 06:17:22,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872742619] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:17:22,762 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:17:22,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2021-11-20 06:17:22,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649863703] [2021-11-20 06:17:22,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:17:22,763 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-20 06:17:22,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:22,764 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 3 times [2021-11-20 06:17:22,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:17:22,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802454669] [2021-11-20 06:17:22,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:22,764 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:17:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:17:22,768 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:17:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:17:22,772 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:17:22,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:17:22,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-20 06:17:22,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2021-11-20 06:17:22,819 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. cyclomatic complexity: 7 Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 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-11-20 06:17:23,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:17:23,066 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2021-11-20 06:17:23,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-20 06:17:23,067 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 40 transitions. [2021-11-20 06:17:23,068 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-11-20 06:17:23,068 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 32 states and 38 transitions. [2021-11-20 06:17:23,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2021-11-20 06:17:23,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2021-11-20 06:17:23,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 38 transitions. [2021-11-20 06:17:23,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:17:23,069 INFO L681 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2021-11-20 06:17:23,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 38 transitions. [2021-11-20 06:17:23,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2021-11-20 06:17:23,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 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-11-20 06:17:23,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2021-11-20 06:17:23,072 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2021-11-20 06:17:23,072 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2021-11-20 06:17:23,072 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-11-20 06:17:23,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 34 transitions. [2021-11-20 06:17:23,073 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-20 06:17:23,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:17:23,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:17:23,074 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:17:23,074 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-20 06:17:23,074 INFO L791 eck$LassoCheckResult]: Stem: 1100#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1101#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 1112#L536 assume !(main_~length~0#1 < 1); 1102#L536-2 assume !(main_~n~1#1 < 1); 1103#L539-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 1096#L545-3 assume !!(main_~i~0#1 < main_~length~0#1 - 1);call write~int(main_#t~nondet13#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet13#1; 1097#L545-2 main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 1098#L545-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 1099#L545-4 main_~i~1#1 := 0; 1108#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1109#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1110#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1111#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1116#L550-3 assume !(main_~i~1#1 < main_~n~1#1 - 1); 1121#L550-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~n~1#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset, cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset, cstrlcpy_#in~siz#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~1#1;havoc cstrlcpy_#res#1;havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, cstrlcpy_#t~mem5#1, cstrlcpy_#t~pre2#1, cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, cstrlcpy_#t~mem7#1, cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset, cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset, cstrlcpy_~siz#1, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset, cstrlcpy_~n~0#1;cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset := cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset;cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset := cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset;cstrlcpy_~siz#1 := cstrlcpy_#in~siz#1;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset;cstrlcpy_~n~0#1 := cstrlcpy_~siz#1; 1120#L519 assume !(0 != cstrlcpy_~n~0#1 % 4294967296); 1119#L519-1 assume 0 == cstrlcpy_~n~0#1 % 4294967296; 1113#L526 assume 0 != cstrlcpy_~siz#1 % 4294967296;call write~int(0, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, 1); 1106#L528-2 [2021-11-20 06:17:23,074 INFO L793 eck$LassoCheckResult]: Loop: 1106#L528-2 cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset := cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_#t~post6#1.base, 1 + cstrlcpy_#t~post6#1.offset;call cstrlcpy_#t~mem7#1 := read~int(cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, 1); 1107#L528 assume !!(0 != cstrlcpy_#t~mem7#1);havoc cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset;havoc cstrlcpy_#t~mem7#1; 1106#L528-2 [2021-11-20 06:17:23,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:23,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1571238007, now seen corresponding path program 1 times [2021-11-20 06:17:23,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:17:23,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667362998] [2021-11-20 06:17:23,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:23,075 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:17:23,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:17:23,146 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-20 06:17:23,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:17:23,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667362998] [2021-11-20 06:17:23,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667362998] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:17:23,147 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:17:23,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 06:17:23,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454220270] [2021-11-20 06:17:23,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:17:23,147 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-20 06:17:23,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:23,148 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 4 times [2021-11-20 06:17:23,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:17:23,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379315872] [2021-11-20 06:17:23,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:23,149 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:17:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:17:23,157 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:17:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:17:23,164 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:17:23,213 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:17:23,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 06:17:23,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-20 06:17:23,214 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:17:23,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:17:23,227 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2021-11-20 06:17:23,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 06:17:23,228 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2021-11-20 06:17:23,229 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-20 06:17:23,232 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 24 states and 27 transitions. [2021-11-20 06:17:23,232 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-20 06:17:23,232 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-20 06:17:23,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2021-11-20 06:17:23,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:17:23,233 INFO L681 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2021-11-20 06:17:23,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2021-11-20 06:17:23,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-11-20 06:17:23,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 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-11-20 06:17:23,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2021-11-20 06:17:23,247 INFO L704 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2021-11-20 06:17:23,247 INFO L587 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2021-11-20 06:17:23,247 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-11-20 06:17:23,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2021-11-20 06:17:23,248 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-20 06:17:23,248 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:17:23,248 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:17:23,249 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:17:23,249 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-20 06:17:23,251 INFO L791 eck$LassoCheckResult]: Stem: 1164#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1165#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 1176#L536 assume !(main_~length~0#1 < 1); 1166#L536-2 assume !(main_~n~1#1 < 1); 1167#L539-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 1160#L545-3 assume !!(main_~i~0#1 < main_~length~0#1 - 1);call write~int(main_#t~nondet13#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet13#1; 1161#L545-2 main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 1162#L545-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 1163#L545-4 main_~i~1#1 := 0; 1170#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1171#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1172#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1173#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1179#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1183#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1182#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1181#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1180#L550-3 assume !(main_~i~1#1 < main_~n~1#1 - 1); 1168#L550-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~n~1#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset, cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset, cstrlcpy_#in~siz#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~1#1;havoc cstrlcpy_#res#1;havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, cstrlcpy_#t~mem5#1, cstrlcpy_#t~pre2#1, cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, cstrlcpy_#t~mem7#1, cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset, cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset, cstrlcpy_~siz#1, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset, cstrlcpy_~n~0#1;cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset := cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset;cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset := cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset;cstrlcpy_~siz#1 := cstrlcpy_#in~siz#1;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset;cstrlcpy_~n~0#1 := cstrlcpy_~siz#1; 1169#L519 assume !(0 != cstrlcpy_~n~0#1 % 4294967296); 1178#L519-1 assume 0 == cstrlcpy_~n~0#1 % 4294967296; 1177#L526 assume !(0 != cstrlcpy_~siz#1 % 4294967296); 1174#L528-2 [2021-11-20 06:17:23,251 INFO L793 eck$LassoCheckResult]: Loop: 1174#L528-2 cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset := cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_#t~post6#1.base, 1 + cstrlcpy_#t~post6#1.offset;call cstrlcpy_#t~mem7#1 := read~int(cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, 1); 1175#L528 assume !!(0 != cstrlcpy_#t~mem7#1);havoc cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset;havoc cstrlcpy_#t~mem7#1; 1174#L528-2 [2021-11-20 06:17:23,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:23,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1995057991, now seen corresponding path program 2 times [2021-11-20 06:17:23,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:17:23,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998434769] [2021-11-20 06:17:23,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:23,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:17:23,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:17:23,419 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 06:17:23,419 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:17:23,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998434769] [2021-11-20 06:17:23,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998434769] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:17:23,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132062062] [2021-11-20 06:17:23,420 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:17:23,420 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:17:23,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:23,430 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:17:23,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2021-11-20 06:17:23,517 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 06:17:23,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:17:23,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-20 06:17:23,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:17:23,554 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2021-11-20 06:17:23,765 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 06:17:23,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:17:24,155 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 06:17:24,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132062062] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:17:24,156 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:17:24,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2021-11-20 06:17:24,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341668543] [2021-11-20 06:17:24,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:17:24,157 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-20 06:17:24,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:24,157 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 5 times [2021-11-20 06:17:24,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:17:24,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97456094] [2021-11-20 06:17:24,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:24,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:17:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:17:24,161 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:17:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:17:24,166 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:17:24,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:17:24,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-20 06:17:24,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2021-11-20 06:17:24,206 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. cyclomatic complexity: 6 Second operand has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 26 states have internal predecessors, (56), 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-11-20 06:17:24,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:17:24,729 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2021-11-20 06:17:24,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-20 06:17:24,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 47 transitions. [2021-11-20 06:17:24,731 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-20 06:17:24,731 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 36 states and 39 transitions. [2021-11-20 06:17:24,731 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-20 06:17:24,731 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-20 06:17:24,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 39 transitions. [2021-11-20 06:17:24,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:17:24,732 INFO L681 BuchiCegarLoop]: Abstraction has 36 states and 39 transitions. [2021-11-20 06:17:24,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 39 transitions. [2021-11-20 06:17:24,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2021-11-20 06:17:24,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 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-11-20 06:17:24,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2021-11-20 06:17:24,734 INFO L704 BuchiCegarLoop]: Abstraction has 36 states and 39 transitions. [2021-11-20 06:17:24,734 INFO L587 BuchiCegarLoop]: Abstraction has 36 states and 39 transitions. [2021-11-20 06:17:24,734 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-11-20 06:17:24,734 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 39 transitions. [2021-11-20 06:17:24,735 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-20 06:17:24,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:17:24,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:17:24,736 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:17:24,736 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-20 06:17:24,737 INFO L791 eck$LassoCheckResult]: Stem: 1411#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1412#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 1423#L536 assume !(main_~length~0#1 < 1); 1413#L536-2 assume !(main_~n~1#1 < 1); 1414#L539-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 1407#L545-3 assume !!(main_~i~0#1 < main_~length~0#1 - 1);call write~int(main_#t~nondet13#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet13#1; 1408#L545-2 main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 1409#L545-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 1410#L545-4 main_~i~1#1 := 0; 1417#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1418#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1419#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1420#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1426#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1442#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1441#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1440#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1439#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1438#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1437#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1436#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1435#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1434#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1433#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1432#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1431#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1430#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1429#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1428#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1427#L550-3 assume !(main_~i~1#1 < main_~n~1#1 - 1); 1415#L550-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~n~1#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset, cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset, cstrlcpy_#in~siz#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~1#1;havoc cstrlcpy_#res#1;havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, cstrlcpy_#t~mem5#1, cstrlcpy_#t~pre2#1, cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, cstrlcpy_#t~mem7#1, cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset, cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset, cstrlcpy_~siz#1, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset, cstrlcpy_~n~0#1;cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset := cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset;cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset := cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset;cstrlcpy_~siz#1 := cstrlcpy_#in~siz#1;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset;cstrlcpy_~n~0#1 := cstrlcpy_~siz#1; 1416#L519 assume !(0 != cstrlcpy_~n~0#1 % 4294967296); 1425#L519-1 assume 0 == cstrlcpy_~n~0#1 % 4294967296; 1424#L526 assume !(0 != cstrlcpy_~siz#1 % 4294967296); 1421#L528-2 [2021-11-20 06:17:24,737 INFO L793 eck$LassoCheckResult]: Loop: 1421#L528-2 cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset := cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_#t~post6#1.base, 1 + cstrlcpy_#t~post6#1.offset;call cstrlcpy_#t~mem7#1 := read~int(cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, 1); 1422#L528 assume !!(0 != cstrlcpy_#t~mem7#1);havoc cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset;havoc cstrlcpy_#t~mem7#1; 1421#L528-2 [2021-11-20 06:17:24,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:24,737 INFO L85 PathProgramCache]: Analyzing trace with hash -812594565, now seen corresponding path program 3 times [2021-11-20 06:17:24,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:17:24,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294105468] [2021-11-20 06:17:24,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:24,738 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:17:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:17:25,031 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 06:17:25,031 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:17:25,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294105468] [2021-11-20 06:17:25,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294105468] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:17:25,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603467945] [2021-11-20 06:17:25,032 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 06:17:25,032 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:17:25,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:25,038 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:17:25,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2021-11-20 06:17:25,445 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2021-11-20 06:17:25,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:17:25,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-20 06:17:25,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:17:26,018 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 06:17:26,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:17:26,975 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 06:17:26,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603467945] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:17:26,976 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:17:26,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 43 [2021-11-20 06:17:26,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679479017] [2021-11-20 06:17:26,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:17:26,977 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-20 06:17:26,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:26,977 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 6 times [2021-11-20 06:17:26,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:17:26,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836354708] [2021-11-20 06:17:26,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:26,978 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:17:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:17:26,982 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:17:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:17:26,985 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:17:27,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:17:27,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-11-20 06:17:27,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=1416, Unknown=0, NotChecked=0, Total=1806 [2021-11-20 06:17:27,040 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. cyclomatic complexity: 6 Second operand has 43 states, 43 states have (on average 1.930232558139535) internal successors, (83), 43 states have internal predecessors, (83), 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-11-20 06:17:27,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:17:27,824 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2021-11-20 06:17:27,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-20 06:17:27,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 77 transitions. [2021-11-20 06:17:27,826 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-20 06:17:27,827 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 60 states and 63 transitions. [2021-11-20 06:17:27,827 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-20 06:17:27,827 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-20 06:17:27,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 63 transitions. [2021-11-20 06:17:27,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:17:27,828 INFO L681 BuchiCegarLoop]: Abstraction has 60 states and 63 transitions. [2021-11-20 06:17:27,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 63 transitions. [2021-11-20 06:17:27,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2021-11-20 06:17:27,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.05) internal successors, (63), 59 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:17:27,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2021-11-20 06:17:27,832 INFO L704 BuchiCegarLoop]: Abstraction has 60 states and 63 transitions. [2021-11-20 06:17:27,832 INFO L587 BuchiCegarLoop]: Abstraction has 60 states and 63 transitions. [2021-11-20 06:17:27,832 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-11-20 06:17:27,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 63 transitions. [2021-11-20 06:17:27,833 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-20 06:17:27,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:17:27,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:17:27,835 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:17:27,835 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-20 06:17:27,836 INFO L791 eck$LassoCheckResult]: Stem: 1783#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1784#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 1795#L536 assume !(main_~length~0#1 < 1); 1785#L536-2 assume !(main_~n~1#1 < 1); 1786#L539-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 1779#L545-3 assume !!(main_~i~0#1 < main_~length~0#1 - 1);call write~int(main_#t~nondet13#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet13#1; 1780#L545-2 main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 1781#L545-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 1782#L545-4 main_~i~1#1 := 0; 1789#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1790#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1791#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1792#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1798#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1838#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1837#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1836#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1835#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1834#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1833#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1832#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1831#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1830#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1829#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1828#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1827#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1826#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1825#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1824#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1823#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1822#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1821#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1820#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1819#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1818#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1817#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1816#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1815#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1814#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1813#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1812#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1811#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1810#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1809#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1808#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1807#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1806#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1805#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1804#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1803#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1802#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1801#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1800#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1799#L550-3 assume !(main_~i~1#1 < main_~n~1#1 - 1); 1787#L550-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~n~1#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset, cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset, cstrlcpy_#in~siz#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~1#1;havoc cstrlcpy_#res#1;havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, cstrlcpy_#t~mem5#1, cstrlcpy_#t~pre2#1, cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, cstrlcpy_#t~mem7#1, cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset, cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset, cstrlcpy_~siz#1, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset, cstrlcpy_~n~0#1;cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset := cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset;cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset := cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset;cstrlcpy_~siz#1 := cstrlcpy_#in~siz#1;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset;cstrlcpy_~n~0#1 := cstrlcpy_~siz#1; 1788#L519 assume !(0 != cstrlcpy_~n~0#1 % 4294967296); 1797#L519-1 assume 0 == cstrlcpy_~n~0#1 % 4294967296; 1796#L526 assume !(0 != cstrlcpy_~siz#1 % 4294967296); 1793#L528-2 [2021-11-20 06:17:27,836 INFO L793 eck$LassoCheckResult]: Loop: 1793#L528-2 cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset := cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_#t~post6#1.base, 1 + cstrlcpy_#t~post6#1.offset;call cstrlcpy_#t~mem7#1 := read~int(cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, 1); 1794#L528 assume !!(0 != cstrlcpy_#t~mem7#1);havoc cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset;havoc cstrlcpy_#t~mem7#1; 1793#L528-2 [2021-11-20 06:17:27,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:27,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1395097315, now seen corresponding path program 4 times [2021-11-20 06:17:27,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:17:27,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721666488] [2021-11-20 06:17:27,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:27,838 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:17:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:17:28,494 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 06:17:28,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:17:28,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721666488] [2021-11-20 06:17:28,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721666488] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:17:28,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789112694] [2021-11-20 06:17:28,495 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 06:17:28,495 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:17:28,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:28,503 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:17:28,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2021-11-20 06:17:29,032 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 06:17:29,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:17:29,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 32 conjunts are in the unsatisfiable core [2021-11-20 06:17:29,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:17:30,424 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 06:17:30,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:17:32,817 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 06:17:32,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789112694] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:17:32,818 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:17:32,818 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 80 [2021-11-20 06:17:32,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59707795] [2021-11-20 06:17:32,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:17:32,819 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-20 06:17:32,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:32,820 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 7 times [2021-11-20 06:17:32,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:17:32,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333886676] [2021-11-20 06:17:32,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:32,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:17:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:17:32,824 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:17:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:17:32,827 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:17:32,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:17:32,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2021-11-20 06:17:32,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1372, Invalid=4948, Unknown=0, NotChecked=0, Total=6320 [2021-11-20 06:17:32,874 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. cyclomatic complexity: 6 Second operand has 80 states, 80 states have (on average 2.05) internal successors, (164), 80 states have internal predecessors, (164), 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-11-20 06:17:36,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:17:36,677 INFO L93 Difference]: Finished difference Result 112 states and 137 transitions. [2021-11-20 06:17:36,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-11-20 06:17:36,680 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 137 transitions. [2021-11-20 06:17:36,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-20 06:17:36,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 108 states and 111 transitions. [2021-11-20 06:17:36,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-20 06:17:36,682 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-20 06:17:36,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 111 transitions. [2021-11-20 06:17:36,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:17:36,683 INFO L681 BuchiCegarLoop]: Abstraction has 108 states and 111 transitions. [2021-11-20 06:17:36,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 111 transitions. [2021-11-20 06:17:36,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-11-20 06:17:36,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 108 states have (on average 1.0277777777777777) internal successors, (111), 107 states have internal predecessors, (111), 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-11-20 06:17:36,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 111 transitions. [2021-11-20 06:17:36,688 INFO L704 BuchiCegarLoop]: Abstraction has 108 states and 111 transitions. [2021-11-20 06:17:36,688 INFO L587 BuchiCegarLoop]: Abstraction has 108 states and 111 transitions. [2021-11-20 06:17:36,688 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-11-20 06:17:36,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states and 111 transitions. [2021-11-20 06:17:36,689 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-20 06:17:36,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:17:36,689 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:17:36,691 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:17:36,691 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-20 06:17:36,691 INFO L791 eck$LassoCheckResult]: Stem: 2480#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2481#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 2492#L536 assume !(main_~length~0#1 < 1); 2482#L536-2 assume !(main_~n~1#1 < 1); 2483#L539-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 2476#L545-3 assume !!(main_~i~0#1 < main_~length~0#1 - 1);call write~int(main_#t~nondet13#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet13#1; 2477#L545-2 main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 2478#L545-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 2479#L545-4 main_~i~1#1 := 0; 2486#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2487#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2488#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2489#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2495#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2583#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2582#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2581#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2580#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2579#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2578#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2577#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2576#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2575#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2574#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2573#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2572#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2571#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2570#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2569#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2568#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2567#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2566#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2565#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2564#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2563#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2562#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2561#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2560#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2559#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2558#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2557#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2556#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2555#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2554#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2553#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2552#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2551#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2550#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2549#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2548#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2547#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2546#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2545#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2544#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2543#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2542#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2541#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2540#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2539#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2538#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2537#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2536#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2535#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2534#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2533#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2532#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2531#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2530#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2529#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2528#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2527#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2526#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2525#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2524#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2523#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2522#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2521#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2520#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2519#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2518#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2517#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2516#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2515#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2514#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2513#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2512#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2511#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2510#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2509#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2508#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2507#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2506#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2505#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2504#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2503#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2502#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2501#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2500#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2499#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2498#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2497#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2496#L550-3 assume !(main_~i~1#1 < main_~n~1#1 - 1); 2484#L550-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~n~1#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset, cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset, cstrlcpy_#in~siz#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~1#1;havoc cstrlcpy_#res#1;havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, cstrlcpy_#t~mem5#1, cstrlcpy_#t~pre2#1, cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, cstrlcpy_#t~mem7#1, cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset, cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset, cstrlcpy_~siz#1, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset, cstrlcpy_~n~0#1;cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset := cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset;cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset := cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset;cstrlcpy_~siz#1 := cstrlcpy_#in~siz#1;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset;cstrlcpy_~n~0#1 := cstrlcpy_~siz#1; 2485#L519 assume !(0 != cstrlcpy_~n~0#1 % 4294967296); 2494#L519-1 assume 0 == cstrlcpy_~n~0#1 % 4294967296; 2493#L526 assume !(0 != cstrlcpy_~siz#1 % 4294967296); 2490#L528-2 [2021-11-20 06:17:36,692 INFO L793 eck$LassoCheckResult]: Loop: 2490#L528-2 cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset := cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_#t~post6#1.base, 1 + cstrlcpy_#t~post6#1.offset;call cstrlcpy_#t~mem7#1 := read~int(cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, 1); 2491#L528 assume !!(0 != cstrlcpy_#t~mem7#1);havoc cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset;havoc cstrlcpy_#t~mem7#1; 2490#L528-2 [2021-11-20 06:17:36,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:36,692 INFO L85 PathProgramCache]: Analyzing trace with hash -297353293, now seen corresponding path program 5 times [2021-11-20 06:17:36,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:17:36,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606297041] [2021-11-20 06:17:36,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:36,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:17:36,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:17:38,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2117 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 06:17:38,339 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:17:38,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606297041] [2021-11-20 06:17:38,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606297041] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:17:38,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798369606] [2021-11-20 06:17:38,340 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-20 06:17:38,340 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:17:38,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:38,341 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:17:38,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2021-11-20 06:18:10,543 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2021-11-20 06:18:10,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:18:10,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 54 conjunts are in the unsatisfiable core [2021-11-20 06:18:10,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:18:14,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2117 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 06:18:14,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:18:20,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2117 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 06:18:20,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798369606] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:18:20,284 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:18:20,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 51, 51] total 152 [2021-11-20 06:18:20,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208141167] [2021-11-20 06:18:20,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:18:20,285 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-20 06:18:20,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:18:20,286 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 8 times [2021-11-20 06:18:20,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:18:20,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138869114] [2021-11-20 06:18:20,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:18:20,287 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:18:20,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:18:20,290 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:18:20,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:18:20,293 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:18:20,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:18:20,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2021-11-20 06:18:20,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5020, Invalid=17932, Unknown=0, NotChecked=0, Total=22952 [2021-11-20 06:18:20,352 INFO L87 Difference]: Start difference. First operand 108 states and 111 transitions. cyclomatic complexity: 6 Second operand has 152 states, 152 states have (on average 2.0526315789473686) internal successors, (312), 152 states have internal predecessors, (312), 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-11-20 06:18:29,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:18:29,983 INFO L93 Difference]: Finished difference Result 210 states and 259 transitions. [2021-11-20 06:18:29,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2021-11-20 06:18:29,984 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 210 states and 259 transitions. [2021-11-20 06:18:29,986 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-20 06:18:29,988 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 210 states to 204 states and 207 transitions. [2021-11-20 06:18:29,989 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-20 06:18:29,989 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-20 06:18:29,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 204 states and 207 transitions. [2021-11-20 06:18:29,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:18:29,990 INFO L681 BuchiCegarLoop]: Abstraction has 204 states and 207 transitions. [2021-11-20 06:18:29,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states and 207 transitions. [2021-11-20 06:18:29,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2021-11-20 06:18:29,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 204 states have (on average 1.0147058823529411) internal successors, (207), 203 states have internal predecessors, (207), 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-11-20 06:18:29,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 207 transitions. [2021-11-20 06:18:29,998 INFO L704 BuchiCegarLoop]: Abstraction has 204 states and 207 transitions. [2021-11-20 06:18:29,998 INFO L587 BuchiCegarLoop]: Abstraction has 204 states and 207 transitions. [2021-11-20 06:18:29,999 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-11-20 06:18:29,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 204 states and 207 transitions. [2021-11-20 06:18:30,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-20 06:18:30,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:18:30,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:18:30,005 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:18:30,005 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-20 06:18:30,006 INFO L791 eck$LassoCheckResult]: Stem: 3779#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3780#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 3791#L536 assume !(main_~length~0#1 < 1); 3781#L536-2 assume !(main_~n~1#1 < 1); 3782#L539-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 3775#L545-3 assume !!(main_~i~0#1 < main_~length~0#1 - 1);call write~int(main_#t~nondet13#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet13#1; 3776#L545-2 main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 3777#L545-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 3778#L545-4 main_~i~1#1 := 0; 3785#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3786#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3787#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3788#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3794#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3978#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3977#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3976#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3975#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3974#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3973#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3972#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3971#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3970#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3969#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3968#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3967#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3966#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3965#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3964#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3963#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3962#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3961#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3960#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3959#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3958#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3957#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3956#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3955#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3954#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3953#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3952#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3951#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3950#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3949#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3948#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3947#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3946#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3945#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3944#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3943#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3942#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3941#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3940#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3939#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3938#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3937#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3936#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3935#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3934#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3933#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3932#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3931#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3930#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3929#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3928#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3927#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3926#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3925#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3924#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3923#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3922#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3921#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3920#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3919#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3918#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3917#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3916#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3915#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3914#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3913#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3912#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3911#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3910#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3909#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3908#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3907#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3906#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3905#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3904#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3903#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3902#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3901#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3900#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3899#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3898#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3897#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3896#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3895#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3894#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3893#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3892#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3891#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3890#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3889#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3888#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3887#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3886#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3885#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3884#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3883#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3882#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3881#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3880#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3879#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3878#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3877#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3876#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3875#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3874#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3873#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3872#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3871#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3870#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3869#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3868#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3867#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3866#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3865#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3864#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3863#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3862#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3861#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3860#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3859#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3858#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3857#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3856#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3855#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3854#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3853#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3852#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3851#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3850#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3849#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3848#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3847#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3846#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3845#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3844#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3843#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3842#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3841#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3840#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3839#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3838#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3837#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3836#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3835#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3834#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3833#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3832#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3831#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3830#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3829#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3828#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3827#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3826#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3825#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3824#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3823#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3822#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3821#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3820#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3819#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3818#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3817#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3816#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3815#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3814#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3813#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3812#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3811#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3810#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3809#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3808#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3807#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3806#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3805#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3804#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3803#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3802#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3801#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3800#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3799#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3798#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3797#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3796#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3795#L550-3 assume !(main_~i~1#1 < main_~n~1#1 - 1); 3783#L550-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~n~1#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset, cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset, cstrlcpy_#in~siz#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~1#1;havoc cstrlcpy_#res#1;havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, cstrlcpy_#t~mem5#1, cstrlcpy_#t~pre2#1, cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, cstrlcpy_#t~mem7#1, cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset, cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset, cstrlcpy_~siz#1, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset, cstrlcpy_~n~0#1;cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset := cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset;cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset := cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset;cstrlcpy_~siz#1 := cstrlcpy_#in~siz#1;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset;cstrlcpy_~n~0#1 := cstrlcpy_~siz#1; 3784#L519 assume !(0 != cstrlcpy_~n~0#1 % 4294967296); 3793#L519-1 assume 0 == cstrlcpy_~n~0#1 % 4294967296; 3792#L526 assume !(0 != cstrlcpy_~siz#1 % 4294967296); 3789#L528-2 [2021-11-20 06:18:30,006 INFO L793 eck$LassoCheckResult]: Loop: 3789#L528-2 cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset := cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_#t~post6#1.base, 1 + cstrlcpy_#t~post6#1.offset;call cstrlcpy_#t~mem7#1 := read~int(cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, 1); 3790#L528 assume !!(0 != cstrlcpy_#t~mem7#1);havoc cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset;havoc cstrlcpy_#t~mem7#1; 3789#L528-2 [2021-11-20 06:18:30,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:18:30,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1364418221, now seen corresponding path program 6 times [2021-11-20 06:18:30,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:18:30,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607894134] [2021-11-20 06:18:30,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:18:30,007 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:18:30,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:18:34,637 INFO L134 CoverageAnalysis]: Checked inductivity of 8837 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 06:18:34,637 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:18:34,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607894134] [2021-11-20 06:18:34,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607894134] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:18:34,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874138431] [2021-11-20 06:18:34,638 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-20 06:18:34,638 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:18:34,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:18:34,653 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:18:34,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10933675-3386-48e7-b893-60679814b176/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process